AbstractLet A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w (0 ⩽ w ⩽ ⌊n/2⌋) and Hamming distance d. In this paper a method is discussed in order to determine upper bounds for A(n, d, w), combining ideas from Delsarte (1973), Johnson (1972) and de Vroedt (1980)
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
The maximum cardinality of a code of length n over an alphabet of size q and with s distinct distanc...
AbstractLet A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w ...
This paper obtains an upper bound on the cardinality of a binary code of length n and minimum distan...
AbstractWe estimate the maximum cardinality of binary codes (linear and nonlinear) when arbitrary re...
AbstractIn earlier papers the author has developed upper bounds for A(n, d), the maximum number of b...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
AbstractLet β(n,M) denote the minimum average Hamming distance of a binary code of length n and card...
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary co...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
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...
AbstractAhlswede and Katona posed the following average distance problem: For every n and 1⩽M⩽2n, de...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
The maximum cardinality of a code of length n over an alphabet of size q and with s distinct distanc...
AbstractLet A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w ...
This paper obtains an upper bound on the cardinality of a binary code of length n and minimum distan...
AbstractWe estimate the maximum cardinality of binary codes (linear and nonlinear) when arbitrary re...
AbstractIn earlier papers the author has developed upper bounds for A(n, d), the maximum number of b...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
AbstractLet β(n,M) denote the minimum average Hamming distance of a binary code of length n and card...
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary co...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
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...
AbstractAhlswede and Katona posed the following average distance problem: For every n and 1⩽M⩽2n, de...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
The maximum cardinality of a code of length n over an alphabet of size q and with s distinct distanc...
DOI
Add to ORKG