Long packing and covering codes

DOI10.1109/18.623161MaRDI QIDQ4371906zbMATH OpenOpenAlexFDO

Authors Gérard Cohen, Iiro Honkala, Simon Litsyn, Patrick Solé

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

binary codescovering radiusminimum 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)

Recommendations

• On lengthening of covering codes
• scientific article; zbMATH DE number 1024657
• On covering problems of codes
• scientific article; zbMATH DE number 177895
• Packing and Covering Properties of Rank Metric Codes
• scientific article; zbMATH DE number 3952657
• Covering arrays and intersecting codes
• Covering bounds for codes
• Generalized bounds and binary/ternary mixed packing and covering codes
• Bounds for covering codes over large alphabets

Cited in

(5)

• 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
• Solving LPN Using Covering Codes
• Consensus string problem for multiple regular languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371906)