Some new lower bounds for binary and ternary covering codes
From MaRDI portal
Publication:4307350
DOI10.1109/18.243462zbMath0801.94017MaRDI QIDQ4307350
Publication date: 4 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.243462
94B05: Linear codes (general theory)
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
New upper bounds for the football pool problem for 11 and 12 matches, Binary codes with covering radius one: Some new lower bounds