We present new upper bounds on the size of constant-weight binary codes, derived from bounds for spherical codes. In particular, we improve upon the 1982 Johnson bound and the linear programming bound for constant-weight codes
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
We present new upper bounds on the size of constant-weight binary codes, derived from bounds for sph...
AbstractIn earlier papers the author has developed upper bounds for A(n, d), the maximum number of b...
We give an alternative proof of Delsarte's linear programming bound for binary codes and its im...
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary co...
In this paper we give new constraints on the distance distribution of doubly constant-weight (binary...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
AbstractIt is shown that an analog of the Tietäväinen bound for binary codes holds also for spherica...
This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a vari...
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary co...
For nonnegative integers n, d, and w, let A(n,d,w) be the maximum size of a code C⊆F 2 n with a cons...
Abstract—The study of codes for powerline communications has garnered much interest over the past de...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions are ...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
We present new upper bounds on the size of constant-weight binary codes, derived from bounds for sph...
AbstractIn earlier papers the author has developed upper bounds for A(n, d), the maximum number of b...
We give an alternative proof of Delsarte's linear programming bound for binary codes and its im...
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary co...
In this paper we give new constraints on the distance distribution of doubly constant-weight (binary...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
AbstractIt is shown that an analog of the Tietäväinen bound for binary codes holds also for spherica...
This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a vari...
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary co...
For nonnegative integers n, d, and w, let A(n,d,w) be the maximum size of a code C⊆F 2 n with a cons...
Abstract—The study of codes for powerline communications has garnered much interest over the past de...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions are ...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions ...
DOI
Add to ORKG