An updated table of minimum-distance bounds for binary linear codes

DOI10.1109/18.212301zbMath0776.94017OpenAlexW4255713959MaRDI QIDQ4202096

Tom Verhoeff, Andries E. Brouwer

Publication date: 7 December 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.212301

zbMATH Keywords

binary linear codelower and upper bounds on minimum distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items

A (105,10,47) binary quasi-cyclic code, An updated table of rate \(1/p\) binary quasi-cyclic codes, The uniformly packed binary \([27, 21, 3 \) and \([35, 29, 3 ]\) codes], Combinatorial methods in the construction of point sets with uniformity properties, Codes based on complete graphs, A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters, Extending and lengthening BCH codes., The existence of a self-dual \([70 ,35 ,12\) code and formally self-dual codes.], The existence of a formally self-dual even [70, 35,14 code], Metacyclic error-correcting codes, The extremal codes of length 42 with automorphism of order 7, Euclidean weights of codes from elliptic curves over rings, On row-cyclic codes with algebraic structure