New Constructions of Codes for Asymmetric Channels via Concatenation
Authors:
- Markus GrasslMGMarkus Grassl
- Peter ShorPSPeter Shor
- Graeme SmithGSGraeme Smith
- John SmolinJSJohn Smolin
- Bei ZengBZBei Zeng
Preprint
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.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- High Performance Single-Error-Correcting Quantum Codes for Amplitude DampingIEEE Transactions on Information Theory, 2011
- Systematic, Single Limited Magnitude Error Correcting Codes for Flash MemoriesIEEE Transactions on Information Theory, 2011
- Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash MemoriesIEEE Transactions on Information Theory, 2010
- New Lower Bounds of the Size of Error-Correcting Codes for the Z-ChannelCybernetics and Systems Analysis, 2002
- Greedy and heuristic algorithms for codes and coloringsIEEE Transactions on Information Theory, 1998
- New lower bounds for asymmetric and unidirectional codesIEEE Transactions on Information Theory, 1991
- The constantinrao construction for binary asymmetric error-correcting codesInformation and Control, 1980
- On the theory of binary asymmetric error correcting codesInformation and Control, 1979
- Concatenated group theoretic codes for binary asymmetric channels1977
- A class of codes for asymmetric channels and a problem from the additive theory of numbersIEEE Transactions on Information Theory, 1973