A Constrained Coding Scheme for Correcting Asymmetric Magnitude-1 Errors in q -Ary Channels

DOI10.1109/TIT.2017.2747558MaRDI QIDQ4566675zbMATH OpenOpenAlexFDO

Authors Evyatar Hemo, Yuval Cassuto

Publication date 27 June 2018

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: We present a constraint-coding scheme to correct asymmetric magnitude-$1$ errors in multi-level non-volatile memories. For large numbers of such errors, the scheme is shown to deliver better correction capability compared to known alternatives, while admitting low-complexity of decoding. Our results include an algebraic formulation of the constraint, necessary and sufficient conditions for correctability, a maximum-likelihood decoder running in complexity linear in the alphabet size, and upper bounds on the probability of failing to correct $t$ errors. Besides the superior rate-correction tradeoff, another advantage of this scheme over standard error-correcting codes is the flexibility to vary the code parameters without significant modifications.

Cited in

(1)

• On the uniformity of the approximation for \(r\)-associated Stirling numbers of the second kind

This page was built for publication: A Constrained Coding Scheme for Correcting Asymmetric Magnitude-1 Errors in $q$ -Ary Channels

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