Paper Info
Title
Constructions of generalized concatenated codes and their trellis-based decoding complexity
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
Year
DOI
Venue
1999
10.1109/18.749022
IEEE Transactions on Information Theory
Keywords
Field
DocType
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
Discrete mathematics,Combinatorics,BCJR algorithm,Concatenated error correction code,Convolutional code,Serial concatenated convolutional codes,Block code,Expander code,Space–time trellis code,Linear code,Mathematics
Journal
Volume
Issue
ISSN
45
2
0018-9448
Citations 
PageRank 
References 
4
0.54
11
Authors
4
Name
Order
Citations
PageRank
robert h moreloszaragoza1243.51
Toru Fujiwara2237.41
T. Kasami3836357.33
Shu Lin422876.61