Title :
Constructions of generalized concatenated codes and their trellis-based decoding complexity
Author :
Morelos-Zaragoza, Robert ; Fujiwara, Toru ; Kasami, Tadao ; Lin, Shu
Author_Institution :
LSI Logic Corp., Milpitas, CA, USA
fDate :
3/1/1999 12:00:00 AM
Abstract :
In this article, constructions of generalized concatenated (GC) codes with good rates and distances are presented. Some of the proposed GC codes have simpler trellis complexity than Euclidean geometry (EG), Reed-Muller (RM), or Bose-Chaudhuri-Hocquenghem (BCH) codes of approximately the same rates and minimum distances, and in addition can be decoded with trellis-based multistage decoding up to their minimum distances. Several codes of the same length, dimension, and minimum distance as the best linear codes known are constructed
Keywords :
BCH codes; Reed-Muller codes; binary codes; block codes; computational complexity; concatenated codes; decoding; linear codes; BCH codes; Bose-Chaudhuri-Hocquenghem codes; Euclidean geometry; Reed-Muller codes; binary codes; code distances; code length; code rates; dimension; generalized concatenated codes; linear codes; minimum distance; minimum distances; trellis-based decoding complexity; trellis-based multistage decoding; two-stage soft-decision decoding; Block codes; Concatenated codes; Decoding; Error correction codes; Geometry; Information science; Information theory; Large scale integration; Linear code; NASA;
Journal_Title :
Information Theory, IEEE Transactions on
