Ahlswede R, Aydinian H, Khachatrian LH. On perfect codes and related concepts. Designs, Codes and Cryptography. 2001;22(3):221-237
The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two c...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
Abstract—In his pioneering work from 1973, Delsarte conjectured that there are no nontrivial perfect...
AbstractSome nontrivial properties of perfect binary codes are discussed. We consider some construct...
AbstractThe two 1-error correcting perfect binary codes, C and C′ are said to be equivalent if there...
Abstract. By using of possibilities of the package “Coding Theory “ in “Mathematica ” author check ...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractThe two concepts dual code and parity check matrix for a linear perfect 1-error correcting b...
AbstractThis short paper treats the perfect codes, in the case of arithmetic codes and Garcia-Rao mo...
We generalize the concept of perfect Lee-error-correcting codes, and present constructions of this n...
The study of coding theory aims to detect and correct the errors during the transmission of the data...
The study of coding theory aims to detect and correct the errors during the transmission of the data...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractA class of binary codes, satisfying the equality in a specialized version of the Johnson bou...
Abstract. We study the problem of existence of (nontrivial) perfect codes in the discrete n-simplex ...
The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two c...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
Abstract—In his pioneering work from 1973, Delsarte conjectured that there are no nontrivial perfect...
AbstractSome nontrivial properties of perfect binary codes are discussed. We consider some construct...
AbstractThe two 1-error correcting perfect binary codes, C and C′ are said to be equivalent if there...
Abstract. By using of possibilities of the package “Coding Theory “ in “Mathematica ” author check ...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractThe two concepts dual code and parity check matrix for a linear perfect 1-error correcting b...
AbstractThis short paper treats the perfect codes, in the case of arithmetic codes and Garcia-Rao mo...
We generalize the concept of perfect Lee-error-correcting codes, and present constructions of this n...
The study of coding theory aims to detect and correct the errors during the transmission of the data...
The study of coding theory aims to detect and correct the errors during the transmission of the data...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractA class of binary codes, satisfying the equality in a specialized version of the Johnson bou...
Abstract. We study the problem of existence of (nontrivial) perfect codes in the discrete n-simplex ...
The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two c...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
Abstract—In his pioneering work from 1973, Delsarte conjectured that there are no nontrivial perfect...
DOI
Add to ORKG