Title :
Some decomposable codes: the |a+x|b+x|a+b+x| construction
Author :
Fossorier, Marc P C ; Lin, Shu
Author_Institution :
Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA
fDate :
9/1/1997 12:00:00 AM
Abstract :
Codes with decomposable structure allow the use of multistage decoding procedures to achieve suboptimum bounded-distance error performance with reduced decoding complexity. This correspondence presents some new decomposable codes, including a class of distance-8 codes, that are constructed based on the |a+x|b+x|a+b+x| construction method. Some existing best codes are shown to be decomposable and hence can be decoded with multistage decoding
Keywords :
block codes; computational complexity; decoding; trellis codes; |a+x|b+x|a+b+x| construction; decoding complexity; decomposable codes; decomposable structure; distance-8 codes; multistage decoding; suboptimum bounded-distance error performance; Block codes; Conferences; Convolutional codes; Information theory; Maximum likelihood decoding; NASA; Product codes; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
