An improvement to GMD-like decoding algorithms

Hitoshi Tokushige; Takuya Koumoto; Tadao Kasami

doi:10.1109/ISIT.2000.866694

An improvement to GMD-like decoding algorithms

Hitoshi Tokushige, Takuya Koumoto, Tadao Kasami

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

1 Citation (Scopus)

Abstract

For binary linear block codes, we introduce "multiple GMD decoding algorithm", where GMD-like decoding is iterated around a few appropriately selected search centers. Compared with the original GMD decoding by Forney [1], this decoding algorithm provides better error performance with increasing the number of iterations of erasure and error correction moderately. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.

Original language	English
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/ISIT.2000.866694
Publication status	Published - Jan 1 2000
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2000.866694

Cite this

@article{7b5643487ecd4f84aa9c39d89f9f747f,

title = "An improvement to GMD-like decoding algorithms",

abstract = "For binary linear block codes, we introduce {"}multiple GMD decoding algorithm{"}, where GMD-like decoding is iterated around a few appropriately selected search centers. Compared with the original GMD decoding by Forney [1], this decoding algorithm provides better error performance with increasing the number of iterations of erasure and error correction moderately. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.",

author = "Hitoshi Tokushige and Takuya Koumoto and Tadao Kasami",

year = "2000",

month = jan,

day = "1",

doi = "10.1109/ISIT.2000.866694",

language = "English",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

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

}

TY - JOUR

T1 - An improvement to GMD-like decoding algorithms

AU - Tokushige, Hitoshi

AU - Koumoto, Takuya

AU - Kasami, Tadao

PY - 2000/1/1

Y1 - 2000/1/1

N2 - For binary linear block codes, we introduce "multiple GMD decoding algorithm", where GMD-like decoding is iterated around a few appropriately selected search centers. Compared with the original GMD decoding by Forney [1], this decoding algorithm provides better error performance with increasing the number of iterations of erasure and error correction moderately. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.

AB - For binary linear block codes, we introduce "multiple GMD decoding algorithm", where GMD-like decoding is iterated around a few appropriately selected search centers. Compared with the original GMD decoding by Forney [1], this decoding algorithm provides better error performance with increasing the number of iterations of erasure and error correction moderately. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.

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

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

U2 - 10.1109/ISIT.2000.866694

DO - 10.1109/ISIT.2000.866694

M3 - Article

AN - SCOPUS:0034448071

SN - 2157-8095

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

ER -

An improvement to GMD-like decoding algorithms

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this