AbstractSome nontrivial properties of perfect binary codes are discussed. We consider some constructions of perfect binary codes with the purpose to outline bounds on the number of nonequivalent perfect binary codes and we present the best known lower and upper bounds on the number of different perfect binary codes
AbstractIn this paper we study an analogue of perfect codes: codes that perfectly correct errors of ...
A binary poset code of codimension m (of cardinality 2(n - m), where n is the code length) can corre...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
AbstractSome nontrivial properties of perfect binary codes are discussed. We consider some construct...
AbstractIt is proved that the number of perfect binary codes of length n is greater than 22(n+1)/2−l...
AbstractThe two concepts dual code and parity check matrix for a linear perfect 1-error correcting b...
AbstractA construction of nonsystematic perfect binary codes of length 15 is offered
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 ...
In this correspondence, we study binary asymmetric error-correcting codes. A general construction fo...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
Ahlswede R, Aydinian H, Khachatrian LH. On perfect codes and related concepts. Designs, Codes and Cr...
Abstract. This work presents a brief survey on codes (with respect to Ham-ming metric) which are per...
It has been proved that the perfect binary and ternary single error correcting AN codes exist.In thi...
This bachelor thesis is about binary error-correcting codes. A binary code is a collection words wit...
AbstractIn this paper we study an analogue of perfect codes: codes that perfectly correct errors of ...
A binary poset code of codimension m (of cardinality 2(n - m), where n is the code length) can corre...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
AbstractSome nontrivial properties of perfect binary codes are discussed. We consider some construct...
AbstractIt is proved that the number of perfect binary codes of length n is greater than 22(n+1)/2−l...
AbstractThe two concepts dual code and parity check matrix for a linear perfect 1-error correcting b...
AbstractA construction of nonsystematic perfect binary codes of length 15 is offered
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 ...
In this correspondence, we study binary asymmetric error-correcting codes. A general construction fo...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
Ahlswede R, Aydinian H, Khachatrian LH. On perfect codes and related concepts. Designs, Codes and Cr...
Abstract. This work presents a brief survey on codes (with respect to Ham-ming metric) which are per...
It has been proved that the perfect binary and ternary single error correcting AN codes exist.In thi...
This bachelor thesis is about binary error-correcting codes. A binary code is a collection words wit...
AbstractIn this paper we study an analogue of perfect codes: codes that perfectly correct errors of ...
A binary poset code of codimension m (of cardinality 2(n - m), where n is the code length) can corre...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
DOI
Add to ORKG