AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of length n with minimum distance d between codewords
Some upper bounds are given on the number of sequences of n binary symbols which can be found such t...
AbstractIn [4] Dodunekov and Manev have shown thatn(k, 2k-i) ≥g(k, 2k-i)+2for3≤i≤k-4.In casek≥9,we f...
AbstractWe estimate the maximum cardinality of binary codes (linear and nonlinear) when arbitrary re...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
AbstractLet n(k,d) denote the smallest value of n for which a binary (n,k,d) code exists. Then n(k, ...
This paper obtains an upper bound on the cardinality of a binary code of length n and minimum distan...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
AbstractLet A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w ...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are...
AbstractAn appropriate version of the linear programming bound of Delsarte for binary codes is used ...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
AbstractLet A(n, d, w) denote the maximum number of codewords in any binary constant weight code of ...
AbstractIn this paper we give some lower and upper bounds for the smallest length n(k, d) of a binar...
Some upper bounds are given on the number of sequences of n binary symbols which can be found such t...
AbstractIn [4] Dodunekov and Manev have shown thatn(k, 2k-i) ≥g(k, 2k-i)+2for3≤i≤k-4.In casek≥9,we f...
AbstractWe estimate the maximum cardinality of binary codes (linear and nonlinear) when arbitrary re...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
AbstractLet n(k,d) denote the smallest value of n for which a binary (n,k,d) code exists. Then n(k, ...
This paper obtains an upper bound on the cardinality of a binary code of length n and minimum distan...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
AbstractLet A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w ...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are...
AbstractAn appropriate version of the linear programming bound of Delsarte for binary codes is used ...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
AbstractLet A(n, d, w) denote the maximum number of codewords in any binary constant weight code of ...
AbstractIn this paper we give some lower and upper bounds for the smallest length n(k, d) of a binar...
Some upper bounds are given on the number of sequences of n binary symbols which can be found such t...
AbstractIn [4] Dodunekov and Manev have shown thatn(k, 2k-i) ≥g(k, 2k-i)+2for3≤i≤k-4.In casek≥9,we f...
AbstractWe estimate the maximum cardinality of binary codes (linear and nonlinear) when arbitrary re...
DOI
Add to ORKG