Lower bounds for constant weight codes

IEEE Transactions on Information Theory, 1980 - ieeexplore.ieee.org
Let A (n, 2 δ, w) denote the maximum number of codewords in any binary code of length n,
constant weight w, and Hamming distance 2 δ Several lower bounds for A (n, 2 δ, w) are …
被引用次数：294 相关文章

[引用][C] LOWER BOUNDS FOR CONSTANT WEIGHT CODES

RL GRAHAM, S NJA - 1980 - pascal-francis.inist.fr
LOWER BOUNDS FOR CONSTANT WEIGHT CODES CNRS Inist Pascal-Francis CNRS
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …

Lower bounds for constant weight codes

R Graham, N Sloane - IEEE Transactions on Information Theory, 2006 - dl.acm.org
Let A (n, 2delta, w) denote the maximum number of codewords in any binary code of length
n, constant weight w, and Hamming distance 2delta Several lower bounds for A (n, 2delta …

[引用][C] Lower bounds for constant codes

RL GRAHAM - IEEE Trans. on Info. Th., 1980 - cir.nii.ac.jp

[引用][C] Lower bounds for constant weight codes

R Graham, N Sloane - IEEE Transactions on Information Theory, 1980 - cir.nii.ac.jp