By Topic

Error Correcting Coding for a Nonsymmetric Ternary Channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bitouze, N. ; Dept. of Electron., Inst. TELECOM-TELECOM Bretagne, Brest, France ; Graell i Amat, A. ; Rosnes, E.

Ternary channels can be used to model the behavior of some memory devices, where information is stored in three different levels. In this paper, error correcting coding for a ternary channel where some of the error transitions are not allowed, is considered. The resulting channel is nonsymmetric, therefore, classical linear codes are not optimal for this channel. We define the maximum-likelihood (ML) decoding rule for ternary codes over this channel and show that it depends on the channel error probability. An alternative decoding rule which depends only on code properties, called dA-decoding, is then proposed. It is shown that dA-decoding and ML decoding are equivalent, i.e., dA-decoding is optimal, under certain conditions. Assuming dA-decoding, we characterize the error correcting capabilities of ternary codes over the nonsymmetric ternary channel. We also derive an upper bound and a constructive lower bound on the size of codes. The results arising from the constructive lower bound are then compared, for short sizes, to optimal codes (in terms of code size) found by a clique-based search. It is shown that the proposed construction method gives good codes, and that in some cases the codes are optimal.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 11 )