A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are surveyed, and a table of (unrestricted) binary codes of length n⩽28 is given
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
Abstract. The author offers the further development of package CodingTheory.m [1] in the direction o...
This thesis presents new methods for finding optimal and near-optimal constant weight binary codes w...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
Summary form only given, as follows. A table of binary constant weight codes of length n ≤ 28 is pre...
Summary form only given, as follows. A table of binary constant weight codes of length n ≤ 28 is pre...
Summary form only given, as follows. A table of binary constant weight codes of length n ≤ 28 is pre...
A method for searching for constant weight codes is described and used to construct 14 codes which a...
A method for searching for constant weight codes is described and used to construct 14 codes which a...
A method for searching for constant weight codes is described and used to construct 14 codes which a...
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary co...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
Abstract. The author offers the further development of package CodingTheory.m [1] in the direction o...
This thesis presents new methods for finding optimal and near-optimal constant weight binary codes w...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
Summary form only given, as follows. A table of binary constant weight codes of length n ≤ 28 is pre...
Summary form only given, as follows. A table of binary constant weight codes of length n ≤ 28 is pre...
Summary form only given, as follows. A table of binary constant weight codes of length n ≤ 28 is pre...
A method for searching for constant weight codes is described and used to construct 14 codes which a...
A method for searching for constant weight codes is described and used to construct 14 codes which a...
A method for searching for constant weight codes is described and used to construct 14 codes which a...
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary co...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
Abstract. The author offers the further development of package CodingTheory.m [1] in the direction o...
This thesis presents new methods for finding optimal and near-optimal constant weight binary codes w...
DOI
Add to ORKG