Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of word lengthnand minimum distanced, and forA(n,d,w), the maximum number of binary vectors of lengthn, distanced, and constant weightwin the rangen leq 24andd leq 10are presented. Some of the new values are
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
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 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...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
This bachelor thesis is about binary error-correcting codes. A binary code is a collection words wit...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
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 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...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
This bachelor thesis is about binary error-correcting codes. A binary code is a collection words wit...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
DOI
Add to ORKG