New upper bounds for binary covering codes
From MaRDI portal
Publication:1377844
DOI10.1016/S0012-365X(97)81825-0zbMath0898.94017OpenAlexW1975005357MaRDI QIDQ1377844
Markku K. Kaikkonen, Patric R. J. Östergård
Publication date: 26 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)81825-0
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (5)
Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ \(K_{5}(7,3) \leqslant 100\). ⋮ A remark on Haas' method ⋮ Bounds for covering codes over large alphabets ⋮ Hypercube Packings and Coverings with Higher Dimensional Rooks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Covering radius 1985-1994
- More coverings by rook domains
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
- Bounds for binary multiple covering codes
- Constructing covering codes with given automorphisms
- A coloring problem in Hamming spaces
- A new table of binary/ternary mixed covering codes
- Unit sphere packings and coverings of the Hamming space
- On covering sets and error-correcting codes
- Construction of linear covering codes
- Linear codes with covering radius 2 and other new covering codes
- A new binary code of length 10 and covering radius 1
- Upper bounds for q-ary covering codes
- On (k, t)-subnormal covering codes
- Some results on the norm of codes
- On the covering radius of codes
- Covering radius---Survey and recent results
- Further results on the covering radius of codes
- Lower bounds for binary covering codes
- A new construction for covering codes
- Further results on (k, t)-subnormal covering codes
- Tabu Search—Part I
- Constructions for perfect mixed codes and other covering codes
- Group Partitions and Mixed Perfect Codes
- New lower bounds for binary covering codes
- On the covering radius of small codes
- Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
- New binary covering codes obtained by simulated annealing
- New single-error-correcting codes
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
- Rook domains, Latin squares, affine planes, and error-distributing codes
- Modified bounds for covering codes
- Covering problems for dichotomized matchings
This page was built for publication: New upper bounds for binary covering codes
