Several new lower bounds on the size of codes with covering radius one
From MaRDI portal
Publication:4701178
DOI10.1109/18.705582zbMATH Open0932.94038OpenAlexW2134722376MaRDI QIDQ4701178FDOQ4701178
Authors: Uri Blass, Simon Litsyn
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.705582
Recommendations
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cited In (5)
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- New results on codes with covering radius 1 and minimum distance \(2\)
- Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
- Combinatorial lower bounds on binary codes with covering radius one
- An updated table of binary/ternary mixed covering codes
This page was built for publication: Several new lower bounds on the size of codes with covering radius one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701178)