Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6

DOI10.1109/18.21262zbMath0666.94016OpenAlexW2034672123MaRDI QIDQ3818990

Cornelis De Vroedt, D. E. Boekee, J. H. Weber

Publication date: 1989

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

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

zbMATH Keywords

upper boundsHamming distanceasymmetric distanceasymmetric error-correcting codesmaximum number of codewords in a binary code

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (2)

A construction of \(V_{h}\)-sequences and its application to binary asymmetric error-correcting codes ⋮ Bounds and constructions of asymmetric or unidirectional error-correcting codes

This page was built for publication: Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6