Exact bounds on the sizes of covering codes
From MaRDI portal
Publication:1406876
zbMATH Open1035.94020MaRDI QIDQ1406876
Maria Axenovich, Zoltán Füredi
Publication date: 7 September 2003
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Hypergraphs (05C65) Bounds on codes (94B65) Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Coding theorems (Shannon theory) (94A24)
Related Items (10)
Covers and partial transversals of Latin squares ⋮ Some Bounds on the Size of Codes ⋮ On small covering codes in arbitrary mixed hamming spaces ⋮ Almost cover-free codes and designs ⋮ Bounds for short covering codes and reactive tabu search ⋮ Modified bounds for covering codes ⋮ Optimal binary covering codes of length 2j ⋮ Bounds on the sizes of constant weight covering codes ⋮ [[Publication:2918473|Title not available (Why is that?)]] ⋮ Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering
This page was built for publication: Exact bounds on the sizes of covering codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406876)
