New lower bounds for binary codes of asymmetric distance two

DOI10.1109/18.149514MaRDI QIDQ4014187zbMATH OpenOpenAlexFDO

Authors Zhen Zhang, X.-G. Xia

Publication date 12 October 1992

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

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

zbMATH Keywords

asymmetric distanceasymmetric single-error-correcting codeschainsconstant weights codeslower boundsrandom codingunidirectional errors

Mathematics Subject Classification ID

Other types of codes (94B60) Bounds on codes (94B65)

Cited in

(2)

• A construction of \(V_{h}\)-sequences and its application to binary asymmetric error-correcting codes
• New lower bounds for asymmetric and unidirectional codes

This page was built for publication: New lower bounds for binary codes of asymmetric distance two

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