Unidirectional covering codes

DOI10.1109/TIT.2005.860449MaRDI QIDQ3547448zbMATH OpenFDO

Authors Patric R. J. Östergård, Esa Antero Seuranen

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Integer programming (90C10) Bounds on codes (94B65)

Recommendations

• New lower bounds for asymmetric covering codes
• scientific article; zbMATH DE number 2148773
• New upper bounds for binary covering codes
• scientific article; zbMATH DE number 1284421
• A new approach to the covering radius of codes

Cited in

(3)

• Two-batch liar games on a general bounded channel
• New lower bounds for multiple coverings
• Optimal local identifying and local locating-dominating codes

This page was built for publication: Unidirectional covering codes

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