A Further Improvement of the Performance for the Original Iterated Codes

Toshihisa NISHIJIMA; Hiroshige INAZUMI; Shigeichi HIRASAWA

A Further Improvement of the Performance for the Original Iterated Codes

Toshihisa NISHIJIMA, Hiroshige INAZUMI, Shigeichi HIRASAWA

Full Text Views

0

Cite this

Summary :

The original iterated codes proposed by P. Elias can be regarded as the codes constructed by iterating two dimensional product codes. While the modified product codes have been proposed and shown to be able to increase the rates without increasing the probability of decoding error. On the other hand, we have proposed new codes, called modified iterated codes A, and improved the performance for the original iterated codes by applying the coding and the decoding schemes of the modified product codes to these product codes. It has been proved that the rates of codes A were always much higher than those of the original iterated codes for cross-over probability p0.1617. In this paper, by additionally combining the coding and the decoding schemes of the superimposed codes constructed on the basis of the modified product codes, which are able to increase the rates with the same minimum distance, the performance for codes A can be further improved. We call codes thus constructed modified iterated codes B. It is shown that the rates of codes B are partially higher than those of codes A for p0.0959.

Publication: IEICE TRANSACTIONS on transactions Vol.E72-E No.2 pp.104-110

Publication Date: 1989/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Information Theory and Coding Theory

Authors

Toshihisa NISHIJIMA
Hiroshige INAZUMI
Shigeichi HIRASAWA

Keyword

Cite this

Copy

Toshihisa NISHIJIMA, Hiroshige INAZUMI, Shigeichi HIRASAWA, "A Further Improvement of the Performance for the Original Iterated Codes" in IEICE TRANSACTIONS on transactions, vol. E72-E, no. 2, pp. 104-110, February 1989, doi: .
Abstract: The original iterated codes proposed by P. Elias can be regarded as the codes constructed by iterating two dimensional product codes. While the modified product codes have been proposed and shown to be able to increase the rates without increasing the probability of decoding error. On the other hand, we have proposed new codes, called modified iterated codes A, and improved the performance for the original iterated codes by applying the coding and the decoding schemes of the modified product codes to these product codes. It has been proved that the rates of codes A were always much higher than those of the original iterated codes for cross-over probability p0.1617. In this paper, by additionally combining the coding and the decoding schemes of the superimposed codes constructed on the basis of the modified product codes, which are able to increase the rates with the same minimum distance, the performance for codes A can be further improved. We call codes thus constructed modified iterated codes B. It is shown that the rates of codes B are partially higher than those of codes A for p0.0959.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e72-e_2_104/_p

Copy

@ARTICLE{e72-e_2_104,
author={Toshihisa NISHIJIMA, Hiroshige INAZUMI, Shigeichi HIRASAWA, },
journal={IEICE TRANSACTIONS on transactions},
title={A Further Improvement of the Performance for the Original Iterated Codes},
year={1989},
volume={E72-E},
number={2},
pages={104-110},
abstract={The original iterated codes proposed by P. Elias can be regarded as the codes constructed by iterating two dimensional product codes. While the modified product codes have been proposed and shown to be able to increase the rates without increasing the probability of decoding error. On the other hand, we have proposed new codes, called modified iterated codes A, and improved the performance for the original iterated codes by applying the coding and the decoding schemes of the modified product codes to these product codes. It has been proved that the rates of codes A were always much higher than those of the original iterated codes for cross-over probability p0.1617. In this paper, by additionally combining the coding and the decoding schemes of the superimposed codes constructed on the basis of the modified product codes, which are able to increase the rates with the same minimum distance, the performance for codes A can be further improved. We call codes thus constructed modified iterated codes B. It is shown that the rates of codes B are partially higher than those of codes A for p0.0959.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - A Further Improvement of the Performance for the Original Iterated Codes
T2 - IEICE TRANSACTIONS on transactions
SP - 104
EP - 110
AU - Toshihisa NISHIJIMA
AU - Hiroshige INAZUMI
AU - Shigeichi HIRASAWA
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 2
JA - IEICE TRANSACTIONS on transactions
Y1 - February 1989
AB - The original iterated codes proposed by P. Elias can be regarded as the codes constructed by iterating two dimensional product codes. While the modified product codes have been proposed and shown to be able to increase the rates without increasing the probability of decoding error. On the other hand, we have proposed new codes, called modified iterated codes A, and improved the performance for the original iterated codes by applying the coding and the decoding schemes of the modified product codes to these product codes. It has been proved that the rates of codes A were always much higher than those of the original iterated codes for cross-over probability p0.1617. In this paper, by additionally combining the coding and the decoding schemes of the superimposed codes constructed on the basis of the modified product codes, which are able to increase the rates with the same minimum distance, the performance for codes A can be further improved. We call codes thus constructed modified iterated codes B. It is shown that the rates of codes B are partially higher than those of codes A for p0.0959.
ER -