Title :
Decision depths of convolutional codes
Author :
Anderson, John B. ; Balachandran, Kumar
Author_Institution :
Dept. of Electr., Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA
fDate :
3/1/1989 12:00:00 AM
Abstract :
The decision depth function of a convolutional code LD(w) is the first trellis depth at which all unmerged incorrect subset paths exceed weight w. The authors tabulate this function for most codes in common use. L D(w) specifies the path memory length of a decoder. It follows a clear asymptotic growth rule
Keywords :
decoding; error correction codes; asymptotic growth rule; convolutional codes; decision depth function; decoder; path memory length; trellis depth; Computer errors; Convolutional codes; Decoding; Error correction; Hamming distance; Systems engineering and theory;
Journal_Title :
Information Theory, IEEE Transactions on
