An improvement to GMD-like decoding algorithms

H. Tokushige, Takuya Kusaka, T. Kasami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages396
Number of pages1
Publication statusPublished - 2000
Externally publishedYes
Event2000 IEEE International Symposium on Information Theory - Serrento, Italy
Duration: Jun 25 2000Jun 30 2000

Other

Other2000 IEEE International Symposium on Information Theory
CountryItaly
CitySerrento
Period6/25/006/30/00

Fingerprint

Decoding
Block codes
Error correction

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Tokushige, H., Kusaka, T., & Kasami, T. (2000). An improvement to GMD-like decoding algorithms. In IEEE International Symposium on Information Theory - Proceedings (pp. 396)

An improvement to GMD-like decoding algorithms. / Tokushige, H.; Kusaka, Takuya; Kasami, T.

IEEE International Symposium on Information Theory - Proceedings. 2000. p. 396.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tokushige, H, Kusaka, T & Kasami, T 2000, An improvement to GMD-like decoding algorithms. in IEEE International Symposium on Information Theory - Proceedings. pp. 396, 2000 IEEE International Symposium on Information Theory, Serrento, Italy, 6/25/00.
Tokushige H, Kusaka T, Kasami T. An improvement to GMD-like decoding algorithms. In IEEE International Symposium on Information Theory - Proceedings. 2000. p. 396
Tokushige, H. ; Kusaka, Takuya ; Kasami, T. / An improvement to GMD-like decoding algorithms. IEEE International Symposium on Information Theory - Proceedings. 2000. pp. 396
@inproceedings{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 = "H. Tokushige and Takuya Kusaka and T. Kasami",
year = "2000",
language = "English",
pages = "396",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - An improvement to GMD-like decoding algorithms

AU - Tokushige, H.

AU - Kusaka, Takuya

AU - Kasami, T.

PY - 2000

Y1 - 2000

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

M3 - Conference contribution

AN - SCOPUS:0034448071

SP - 396

BT - IEEE International Symposium on Information Theory - Proceedings

ER -