Decoding Binary Cyclic Codes with Irreducible Generator Polynomials up to Actual Minimum Distance

被引：7

作者：

Lee, Chong-Dao ^{[1
]}

Chang, Yaotsu ^{[2
]}

Jing, Ming-Haw ^{[3
]}

Chen, Jian-Hong ^{[3
]}

机构：

[1] I Shou Univ, Dept Commun Engn, Dashu Township 840, Kaohsiung Count, Taiwan

[2] I Shou Univ, Dept Appl Math, Dashu Township 840, Kaohsiung Count, Taiwan

[3] I Shou Univ, Dept Informat Engn, Dashu Township 840, Kaohsiung Count, Taiwan

来源：

IEEE COMMUNICATIONS LETTERS | 2010年 / 14卷 / 11期

关键词：

Cyclic code; extended Euclid's algorithm; general error locator polynomial; INTERPOLATION;

D O I：

10.1109/LCOMM.2010.092310.101111

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

This letter presents two modified algorithms to decode up to actual minimum distance for binary cyclic codes with irreducible generator polynomials. The key ideas behind these decoding algorithms are the utilization of the extended Euclid's algorithm for univariate polynomials to evaluate the unknown syndromes and the coefficients of general error locator polynomial, which has not been developed before. The advantage of these algorithms is particularly suitable for software and hardware implementations.

引用

页码：1050 / 1052

页数：3

共 50 条

[1] A NEW PROCEDURE FOR DECODING CYCLIC AND BCH CODES UP TO ACTUAL MINIMUM DISTANCE
FENG, GL
TZENG, KK
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) : 1364 - 1374
[2] The minimum distance of the duals of binary irreducible cyclic codes
Ding, CS
Helleseth, T
Niederreiter, H
Xing, CP
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (10) : 2679 - 2689
[3] On Decoding of Quadratic Residue Codes with Irreducible Generator Polynomials
Shih, Pei-Yu
Su, Wen-Ku
Lin, Tsung-Ching
Truong, Trieu-Kien
[J]. 2008 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEM, 2008, : 35 - 37
[4] Decoding Cyclic Codes up to a New Bound on the Minimum Distance
Zeh, Alexander
Wachter-Zeh, Antonia
Bezzateev, Sergey V.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 3951 - 3960
[5] DECODING CYCLIC AND BCH CODES UP TO ACTUAL MINIMUM DISTANCE USING NONRECURRENT SYNDROME DEPENDENCE RELATIONS
FENG, GL
TZENG, KK
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (06) : 1716 - 1723
[6] The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance
Lin, Tsung-Ching
Lee, Chong-Dao
Trieu-Kien Truong
Chang, Yaotsu
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (10) : 6590 - 6603
[7] MINIMUM-HAMMING-DISTANCE DECODING OF SINGLE-GENERATOR BINARY CONVOLUTIONAL CODES
NG, WH
PFEIFFER, PE
[J]. INFORMATION AND CONTROL, 1968, 13 (04): : 295 - &
[8] On the minimum distance of concatenated codes and decoding method up to the true minimum distance
Kohnosu, T
Nishijima, T
Hirasawa, S
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (11) : 2111 - 2116
[9] Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance
Zeh, Alexander
Ling, San
[J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2584 - 2588
[10] Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
A. Zeh
M. Ulmschneider
[J]. Problems of Information Transmission, 2015, 51 : 217 - 230

← 1 2 3 4 5 →