New Constructions of Codes for Asymmetric Channels via Concatenation

DOI10.1109/TIT.2015.2401567MaRDI QIDQ2978691zbMATH OpenFDO

Authors M. Grassl, Graeme Smith, John A. Smolin, Bei Zeng, Peter W. Shor

Publication date 28 April 2017

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

Full work available at URL https://arxiv.org/abs/1310.7536

Mathematics Subject Classification ID

Other types of codes (94B60)

Abstract: We present new constructions of codes for asymmetric channels for both binary and nonbinary alphabets, based on methods of generalized code concatenation. For the binary asymmetric channel, our methods construct nonlinear single-error-correcting codes from ternary outer codes. We show that some of the Varshamov-Tenengol'ts-Constantin-Rao codes, a class of binary nonlinear codes for this channel, have a nice structure when viewed as ternary codes. In many cases, our ternary construction yields even better codes. For the nonbinary asymmetric channel, our methods construct linear codes for many lengths and distances which are superior to the linear codes of the same length capable of correcting the same number of symmetric errors. In the binary case, Varshamov has shown that almost all good linear codes for the asymmetric channel are also good for the symmetric channel. Our results indicate that Varshamov's argument does not extend to the nonbinary case, i.e., one can find better linear codes for asymmetric channels than for symmetric ones.

Cited in

(3)

• Sequences and codes with asymmetrical runlength constraints
• An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel (Corresp.)
• New lower bounds for asymmetric and unidirectional codes

This page was built for publication: New Constructions of Codes for Asymmetric Channels via Concatenation

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