A Soft-Input and Output Iterative Bounded-Distance and Encoding-Based Decoding Algorithm for Product Codes

Hitoshi TOKUSHIGE; Marc FOSSORIER; Tadao KASAMI

doi:10.1587/transfun.e92.a.671

A Soft-Input and Output Iterative Bounded-Distance and Encoding-Based Decoding Algorithm for Product Codes

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e92.a.671 ◽

2009 ◽

Vol E92-A (2) ◽

pp. 671-672

Author(s):

Hitoshi TOKUSHIGE ◽

Marc FOSSORIER ◽

Tadao KASAMI

Keyword(s):

Decoding Algorithm ◽

Product Codes ◽

Input And Output ◽

Bounded Distance

Download Full-text

Selection Method of Test Patterns in Soft-Input and Output Iterative Bounded Distance Decoding Algorithm

Coding, Cryptography and Combinatorics ◽

10.1007/978-3-0348-7865-4_23 ◽

2004 ◽

pp. 331-343

Author(s):

Hitoshi Tokushige ◽

Jun Asatani ◽

Marc P. C. Fossorier ◽

Tadao Kasami

Keyword(s):

Selection Method ◽

Decoding Algorithm ◽

Input And Output ◽

Bounded Distance

Download Full-text

A Soft-Decision Recursive Decoding Algorithm Using Iterative Bounded-Distance Decoding for u|u+v Codes

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e97.a.996 ◽

2014 ◽

Vol E97.A (4) ◽

pp. 996-1000

Author(s):

Hitoshi TOKUSHIGE

Keyword(s):

Soft Decision ◽

Decoding Algorithm ◽

Bounded Distance

Download Full-text

An advanced low-complexity decoding algorithm for turbo product codes based on the syndrome

EURASIP Journal on Wireless Communications and Networking ◽

10.1186/s13638-020-01740-2 ◽

2020 ◽

Vol 2020 (1) ◽

Author(s):

Sungsik Yoon ◽

Byungkyu Ahn ◽

Jun Heo

Keyword(s):

Low Complexity ◽

Decoding Algorithm ◽

Product Codes ◽

Turbo Product Codes

Download Full-text

Reduced complexity Chase-Pyndiah decoding algorithm for turbo product codes

2011 IEEE Workshop on Signal Processing Systems (SiPS) ◽

10.1109/sips.2011.6088976 ◽

2011 ◽

Cited By ~ 4

Author(s):

Junhee Cho ◽

Wonyong Sung

Keyword(s):

Decoding Algorithm ◽

Product Codes ◽

Turbo Product Codes ◽

Reduced Complexity

Download Full-text

A bounded-distance decoding algorithm for lattices obtained from a generalized code formula

IEEE Transactions on Information Theory ◽

10.1109/18.340485 ◽

1994 ◽

Vol 40 (6) ◽

pp. 2075-2082 ◽

Cited By ~ 2

Author(s):

M.A.O. da Costa e Silva ◽

R. Palazzo

Keyword(s):

Decoding Algorithm ◽

Bounded Distance

Download Full-text

Shortened Turbo Product Codes: Encoding Design and Decoding Algorithm

IEEE Transactions on Vehicular Technology ◽

10.1109/tvt.2007.901931 ◽

2007 ◽

Vol 56 (6) ◽

pp. 3495-3501 ◽

Cited By ~ 10

Author(s):

Changlong Xu ◽

Ying-Chang Liang ◽

Wing Seng Leon

Keyword(s):

Decoding Algorithm ◽

Product Codes ◽

Turbo Product Codes

Download Full-text

Non-sequential decoding algorithm for hard iterative turbo product codes - [transactions letters]

IEEE Transactions on Communications ◽

10.1109/tcomm.2009.06.070010 ◽

2009 ◽

Vol 57 (6) ◽

pp. 1545-1549 ◽

Cited By ~ 14

Author(s):

A. J. Al-dweik ◽

B. S. Sharif

Keyword(s):

Decoding Algorithm ◽

Sequential Decoding ◽

Product Codes ◽

Turbo Product Codes

Download Full-text

Chase decoding algorithm for shortened turbo product codes in flat fading channels

2006 IEEE Radio and Wireless Symposium ◽

10.1109/rws.2006.1615083 ◽

2006 ◽

Cited By ~ 1

Author(s):

Changlong Xu ◽

Wing Seng Leon ◽

Ying-Chang Liang

Keyword(s):

Fading Channels ◽

Decoding Algorithm ◽

Product Codes ◽

Flat Fading ◽

Turbo Product Codes

Download Full-text

Performance of Modified Iterative Decoding Algorithm for Product codes

2011 International Conference on Computational Aspects of Social Networks (CASoN) ◽

10.1109/cason.2011.6085934 ◽

2011 ◽

Cited By ~ 5

Author(s):

Atta-ur-Rahman ◽

Sajjad Ahmed Ghouri ◽

Hanan Adeel ◽

Abdul Waheed

Keyword(s):

Iterative Decoding ◽

Decoding Algorithm ◽

Product Codes

Download Full-text

DECODING OF MATRIX-PRODUCT CODES

Journal of Algebra and Its Applications ◽

10.1142/s021949881250185x ◽

2013 ◽

Vol 12 (04) ◽

pp. 1250185 ◽

Cited By ~ 9

Author(s):

FERNANDO HERNANDO ◽

DIEGO RUANO

Keyword(s):

Error Correction ◽

Linear Code ◽

Minimum Distance ◽

Matrix Product ◽

Decoding Algorithm ◽

Product Codes ◽

Error Correction Capability

We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error-correction capability of the code.

Download Full-text