Theoretical analysis of the error correction performance of majority-logic-like vector symbol codes

Jong Moon Chung, John J. Metzner

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, the average codeword success probability of the majority-logic-like vector symbol (MLLVS) code is derived for the following two cases: 1) single-pass decoding and 2) upper bound of multipass decoding, when the received word has more than (J - 1) symbol errors, where J is the number of check sum equations. The MLLVS code has been simulated in [8] and [9], and it was concluded that the average error correcting capability of MLLVS codes exceed the decoding capability of Reed-Solomon codes, but is achieved with less complexity. Additionally, for codes that have larger structures, the error correcting capability is sustained even further with a high probability of decoding success through multipass decoding procedures. The mathematical derivations of the error correction performance beyond (J - 1) symbol errors serve as theoretical proof of the MLLVS code error correcting capability that was shown only through simulation results until now in [8] and [9]. One characteristic feature of this derivation is that it does not assume any specific inner code usage, enabling the derived decoding probability equations to be easily applied to any inner code selected, of a concatenated coding structure.

Original languageEnglish
Pages (from-to)979-987
Number of pages9
JournalIEEE Transactions on Communications
Volume49
Issue number6
DOIs
Publication statusPublished - 2001 Jun 1

Fingerprint

Majority logic
Error correction
Decoding
Reed-Solomon codes

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{5ab5e60ba3974983af7239837e293669,
title = "Theoretical analysis of the error correction performance of majority-logic-like vector symbol codes",
abstract = "In this paper, the average codeword success probability of the majority-logic-like vector symbol (MLLVS) code is derived for the following two cases: 1) single-pass decoding and 2) upper bound of multipass decoding, when the received word has more than (J - 1) symbol errors, where J is the number of check sum equations. The MLLVS code has been simulated in [8] and [9], and it was concluded that the average error correcting capability of MLLVS codes exceed the decoding capability of Reed-Solomon codes, but is achieved with less complexity. Additionally, for codes that have larger structures, the error correcting capability is sustained even further with a high probability of decoding success through multipass decoding procedures. The mathematical derivations of the error correction performance beyond (J - 1) symbol errors serve as theoretical proof of the MLLVS code error correcting capability that was shown only through simulation results until now in [8] and [9]. One characteristic feature of this derivation is that it does not assume any specific inner code usage, enabling the derived decoding probability equations to be easily applied to any inner code selected, of a concatenated coding structure.",
author = "Chung, {Jong Moon} and Metzner, {John J.}",
year = "2001",
month = "6",
day = "1",
doi = "10.1109/26.930628",
language = "English",
volume = "49",
pages = "979--987",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

Theoretical analysis of the error correction performance of majority-logic-like vector symbol codes. / Chung, Jong Moon; Metzner, John J.

In: IEEE Transactions on Communications, Vol. 49, No. 6, 01.06.2001, p. 979-987.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Theoretical analysis of the error correction performance of majority-logic-like vector symbol codes

AU - Chung, Jong Moon

AU - Metzner, John J.

PY - 2001/6/1

Y1 - 2001/6/1

N2 - In this paper, the average codeword success probability of the majority-logic-like vector symbol (MLLVS) code is derived for the following two cases: 1) single-pass decoding and 2) upper bound of multipass decoding, when the received word has more than (J - 1) symbol errors, where J is the number of check sum equations. The MLLVS code has been simulated in [8] and [9], and it was concluded that the average error correcting capability of MLLVS codes exceed the decoding capability of Reed-Solomon codes, but is achieved with less complexity. Additionally, for codes that have larger structures, the error correcting capability is sustained even further with a high probability of decoding success through multipass decoding procedures. The mathematical derivations of the error correction performance beyond (J - 1) symbol errors serve as theoretical proof of the MLLVS code error correcting capability that was shown only through simulation results until now in [8] and [9]. One characteristic feature of this derivation is that it does not assume any specific inner code usage, enabling the derived decoding probability equations to be easily applied to any inner code selected, of a concatenated coding structure.

AB - In this paper, the average codeword success probability of the majority-logic-like vector symbol (MLLVS) code is derived for the following two cases: 1) single-pass decoding and 2) upper bound of multipass decoding, when the received word has more than (J - 1) symbol errors, where J is the number of check sum equations. The MLLVS code has been simulated in [8] and [9], and it was concluded that the average error correcting capability of MLLVS codes exceed the decoding capability of Reed-Solomon codes, but is achieved with less complexity. Additionally, for codes that have larger structures, the error correcting capability is sustained even further with a high probability of decoding success through multipass decoding procedures. The mathematical derivations of the error correction performance beyond (J - 1) symbol errors serve as theoretical proof of the MLLVS code error correcting capability that was shown only through simulation results until now in [8] and [9]. One characteristic feature of this derivation is that it does not assume any specific inner code usage, enabling the derived decoding probability equations to be easily applied to any inner code selected, of a concatenated coding structure.

UR - http://www.scopus.com/inward/record.url?scp=0035364796&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035364796&partnerID=8YFLogxK

U2 - 10.1109/26.930628

DO - 10.1109/26.930628

M3 - Article

AN - SCOPUS:0035364796

VL - 49

SP - 979

EP - 987

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 6

ER -