Lower Bounds for Binary Codes of Covering Radius One

DOI10.1109/TIT.2007.901186MaRDI QIDQ3548961zbMATH OpenFDO

Authors Wolfgang Haas

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.2007.901186

Mathematics Subject Classification ID

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

Cited in

(2)

• Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
• Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one

This page was built for publication: Lower Bounds for Binary Codes of Covering Radius One

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