Long packing and covering codes

DOI10.1109/18.623161zbMath0898.94015OpenAlexW2063555306MaRDI QIDQ4371906

Gérard D. Cohen, Patrick Solé, Simon N. Litsyn, Iiro S. Honkala

Publication date: 4 November 1998

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

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

zbMATH Keywords

covering radiusbinary codesminimum distance

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (4)

On the string consensus problem and the Manhattan sequence consensus problem ⋮ How many weights can a linear code have? ⋮ Consensus String Problem for Multiple Regular Languages ⋮ Consensus string problem for multiple regular languages

This page was built for publication: Long packing and covering codes