Weighted coverings and packings

DOI10.1109/18.476311MaRDI QIDQ4880308zbMATH OpenOpenAlexFDO

Authors H. F. jun. Mattson, Gérard Cohen, Iiro Honkala, Simon Litsyn

Publication date 25 March 1997

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

Full work available at URL https://surface.syr.edu/eecs_techreports/140

zbMATH Keywords

code constructionscoveringsexistence of perfect weighted coveringsHamming spacepackingsperfect codes

Mathematics Subject Classification ID

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

Cited in

(15)

• The packing problem in statistics, coding theory and finite projective spaces
• (a,b)-codes in Z/n Z
• On the packing radius and the covering radius of equal-weight codes
• Constant 2-labellings and an application to \((r, a, b)\)-covering codes
• Short coverings and matching in weighted graphs
• Weighted perfect codes in Lee metric
• Hypercube packings and coverings with higher dimensional rooks
• A note on perfect multiple coverings of the Hamming space
• scientific article; zbMATH DE number 3952657 (Why is no real title available?)
• scientific article; zbMATH DE number 493080 (Why is no real title available?)
• scientific article; zbMATH DE number 826044 (Why is no real title available?)
• scientific article; zbMATH DE number 910953 (Why is no real title available?)
• Short covering codes arising from matchings in weighted graphs
• Weighted codes in Lee metrics
• Duality between packings and coverings of the Hamming space

This page was built for publication: Weighted coverings and packings

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