DocumentCode
314064
Title
On the minimum distance of concatenated codes and decoding based on the true minimum distance
Author
Kohnosu, Toshiyuki ; Nishijima, Toshihisa ; Hirasawa, Shigeichi
Author_Institution
Dept. of Ind. & Manage. Syst. Eng., Waseda Univ., Tokyo, Japan
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
427
Abstract
We show some conditions that the minimum distance of concatenated codes is beyond the lower bound. Furthermore a new decoding method is proposed up to the true minimum distance
Keywords
concatenated codes; decoding; Reddy-Robinson algorithm; concatenated codes; decoding; lower bound; minimum distance; true minimum distance; Concatenated codes; Decoding; Engineering management; Error correction; Error correction codes; Linear code; Parity check codes; Reed-Solomon codes; Systems engineering and theory; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613364
Filename
613364
Link To Document