Title :
Designing lexicographic codes with a given trellis complexity
Author :
Trachtenberg, Ari
Author_Institution :
Dept. of Electr. & Comput. Eng., Boston Univ., MA, USA
fDate :
1/1/2002 12:00:00 AM
Abstract :
We generalize constructions of lexicographic codes to produce locally optimal codes with a desired trellis decoding complexity. These constructions are efficient for high-rate codes and provide a means for automated code design. As a byproduct, we improve known bounds on the parameters of lexicodes
Keywords :
computational complexity; decoding; error correction codes; linear codes; trellis codes; automated code design; decoding properties; error-correction codes; generator matrices; high-rate codes; lexicodes parameters bounds; lexicographic codes design; linear codes; locally optimal codes; memory constraint; trellis complexity; trellis decoding complexity; Computational modeling; Decoding; Design methodology; Encoding; Energy consumption; Linear code; Memory management; Mobile communication; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
