DOIAbstract
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n and minimum distance at least d, are presented in case n = 2d + j, where j is small
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n and minimum distance at least d, are presented in case n = 2d + j, where j is small
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
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...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
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...
This bachelor thesis is about binary error-correcting codes. A binary code is a collection words wit...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
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...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
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...
This bachelor thesis is about binary error-correcting codes. A binary code is a collection words wit...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
Add to ORKG