Bit-level soft-decision decoding of triple-parity reed-solomon codes through automorphism groups

Vo Tam Van; Seiichi Mita; Jing Tiffany Li; Chau Yuen; Yong Liang Guan

doi:10.1109/LCOMM.2013.020513.130016

Bit-level soft-decision decoding of triple-parity reed-solomon codes through automorphism groups

Vo Tam Van^*, Seiichi Mita, Jing Tiffany Li, Chau Yuen, Yong Liang Guan

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

This paper discusses bit-level soft decoding of triple-parity Reed-Solomon (RS) codes through automorphism permutation. A new method for identifying the automorphism groups of RS binary images is first developed. The new algorithm runs effectively, and can handle more RS codes and capture more automorphism groups than the existing ones. Utilizing the automorphism results, a new bit-level soft-decision decoding algorithm is subsequently developed for general (n,n-3,4) RS codes. Simulation on (31,28,4) RS codes demonstrates an impressive gain of more than 1 dB at the bit error rate of 10^-5 over the existing algorithms.

Original language	English
Article number	6459504
Pages (from-to)	553-556
Number of pages	4
Journal	IEEE Communications Letters
Volume	17
Issue number	3
DOIs	https://doi.org/10.1109/LCOMM.2013.020513.130016
Publication status	Published - 2013
Externally published	Yes

ASJC Scopus Subject Areas

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Keywords

automorphism groups
binary images
permutation decoding
Reed Solomon codes
soft decoding

Access to Document

10.1109/LCOMM.2013.020513.130016

Cite this

@article{06448fb912594e009c1b45bf41465a0c,

title = "Bit-level soft-decision decoding of triple-parity reed-solomon codes through automorphism groups",

abstract = "This paper discusses bit-level soft decoding of triple-parity Reed-Solomon (RS) codes through automorphism permutation. A new method for identifying the automorphism groups of RS binary images is first developed. The new algorithm runs effectively, and can handle more RS codes and capture more automorphism groups than the existing ones. Utilizing the automorphism results, a new bit-level soft-decision decoding algorithm is subsequently developed for general (n,n-3,4) RS codes. Simulation on (31,28,4) RS codes demonstrates an impressive gain of more than 1 dB at the bit error rate of 10-5 over the existing algorithms.",

keywords = "automorphism groups, binary images, permutation decoding, Reed Solomon codes, soft decoding",

author = "Van, {Vo Tam} and Seiichi Mita and Li, {Jing Tiffany} and Chau Yuen and Guan, {Yong Liang}",

year = "2013",

doi = "10.1109/LCOMM.2013.020513.130016",

language = "English",

volume = "17",

pages = "553--556",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Bit-level soft-decision decoding of triple-parity reed-solomon codes through automorphism groups

AU - Van, Vo Tam

AU - Mita, Seiichi

AU - Li, Jing Tiffany

AU - Yuen, Chau

AU - Guan, Yong Liang

PY - 2013

Y1 - 2013

N2 - This paper discusses bit-level soft decoding of triple-parity Reed-Solomon (RS) codes through automorphism permutation. A new method for identifying the automorphism groups of RS binary images is first developed. The new algorithm runs effectively, and can handle more RS codes and capture more automorphism groups than the existing ones. Utilizing the automorphism results, a new bit-level soft-decision decoding algorithm is subsequently developed for general (n,n-3,4) RS codes. Simulation on (31,28,4) RS codes demonstrates an impressive gain of more than 1 dB at the bit error rate of 10-5 over the existing algorithms.

AB - This paper discusses bit-level soft decoding of triple-parity Reed-Solomon (RS) codes through automorphism permutation. A new method for identifying the automorphism groups of RS binary images is first developed. The new algorithm runs effectively, and can handle more RS codes and capture more automorphism groups than the existing ones. Utilizing the automorphism results, a new bit-level soft-decision decoding algorithm is subsequently developed for general (n,n-3,4) RS codes. Simulation on (31,28,4) RS codes demonstrates an impressive gain of more than 1 dB at the bit error rate of 10-5 over the existing algorithms.

KW - automorphism groups

KW - binary images

KW - permutation decoding

KW - Reed Solomon codes

KW - soft decoding

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

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

U2 - 10.1109/LCOMM.2013.020513.130016

DO - 10.1109/LCOMM.2013.020513.130016

M3 - Article

AN - SCOPUS:84875633707

SN - 1089-7798

VL - 17

SP - 553

EP - 556

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 3

M1 - 6459504

ER -

Bit-level soft-decision decoding of triple-parity reed-solomon codes through automorphism groups

Abstract

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this