On Maximum Likelihood Decoding for Constantin-Rao Codes

Tomohiko UYEMATSU

On Maximum Likelihood Decoding for Constantin-Rao Codes

Tomohiko UYEMATSU

Full Text Views

0

Cite this

Summary :

In the photon communication system, it is known that the communication channel can be modeled by an asymmetric channel (Z-channel) in which symbol 0" does not change to symbol 1", but 1" changes to 0". As a typical error correcting code for Z-channel, there is a Constantin-Rao (CR) code which can correct a 10 type transition error (an asymmetric error). In order to derive the maximum error correcting capability from the code, it is desirable to devise an efficient maximum likelihood decoding (MLD) algorithm for CR codes. This paper presents an implementation of MLD for the CR code in Z-channel. Moreover, some methods to reduce the decoding complexity are proposed. Computer simulation reveals that the proposed decoding algorithm gives better performance than the conventional decoding.

Publication: IEICE TRANSACTIONS on transactions Vol.E73-E No.5 pp.630-637

Publication Date: 1990/05/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Information Theory and Its Applications)

Category

Authors

Tomohiko UYEMATSU

Keyword

Cite this

Copy

Tomohiko UYEMATSU, "On Maximum Likelihood Decoding for Constantin-Rao Codes" in IEICE TRANSACTIONS on transactions, vol. E73-E, no. 5, pp. 630-637, May 1990, doi: .
Abstract: In the photon communication system, it is known that the communication channel can be modeled by an asymmetric channel (Z-channel) in which symbol 0" does not change to symbol 1", but 1" changes to 0". As a typical error correcting code for Z-channel, there is a Constantin-Rao (CR) code which can correct a 10 type transition error (an asymmetric error). In order to derive the maximum error correcting capability from the code, it is desirable to devise an efficient maximum likelihood decoding (MLD) algorithm for CR codes. This paper presents an implementation of MLD for the CR code in Z-channel. Moreover, some methods to reduce the decoding complexity are proposed. Computer simulation reveals that the proposed decoding algorithm gives better performance than the conventional decoding.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_5_630/_p

Copy

@ARTICLE{e73-e_5_630,
author={Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on transactions},
title={On Maximum Likelihood Decoding for Constantin-Rao Codes},
year={1990},
volume={E73-E},
number={5},
pages={630-637},
abstract={In the photon communication system, it is known that the communication channel can be modeled by an asymmetric channel (Z-channel) in which symbol 0" does not change to symbol 1", but 1" changes to 0". As a typical error correcting code for Z-channel, there is a Constantin-Rao (CR) code which can correct a 10 type transition error (an asymmetric error). In order to derive the maximum error correcting capability from the code, it is desirable to devise an efficient maximum likelihood decoding (MLD) algorithm for CR codes. This paper presents an implementation of MLD for the CR code in Z-channel. Moreover, some methods to reduce the decoding complexity are proposed. Computer simulation reveals that the proposed decoding algorithm gives better performance than the conventional decoding.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - On Maximum Likelihood Decoding for Constantin-Rao Codes
T2 - IEICE TRANSACTIONS on transactions
SP - 630
EP - 637
AU - Tomohiko UYEMATSU
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 5
JA - IEICE TRANSACTIONS on transactions
Y1 - May 1990
AB - In the photon communication system, it is known that the communication channel can be modeled by an asymmetric channel (Z-channel) in which symbol 0" does not change to symbol 1", but 1" changes to 0". As a typical error correcting code for Z-channel, there is a Constantin-Rao (CR) code which can correct a 10 type transition error (an asymmetric error). In order to derive the maximum error correcting capability from the code, it is desirable to devise an efficient maximum likelihood decoding (MLD) algorithm for CR codes. This paper presents an implementation of MLD for the CR code in Z-channel. Moreover, some methods to reduce the decoding complexity are proposed. Computer simulation reveals that the proposed decoding algorithm gives better performance than the conventional decoding.
ER -