Comments and additions to recent papers on new convolutional codes

Recent publications on new improved convolutional codes claim different codes to be optimum under the optimum distance spectrum (ODS) criterion. This correspondence presents results from a study independent of the previous works, and seeks to clarify some inconsistencies. In addition, some new improved feed-forward convolutional encoders are presented.

[1]  Arne Svensson,et al.  Rate-compatible convolutional codes for multirate DS-CDMA systems , 1999, IEEE Trans. Commun..

[2]  G. David Forney,et al.  Convolutional Codes II. Maximum-Likelihood Decoding , 1974, Inf. Control..

[3]  Rolf Johannesson,et al.  A fast algorithm for computing distance spectrum of convolutional codes , 1989, IEEE Trans. Inf. Theory.

[4]  V.W.S. Chan,et al.  Principles of Digital Communication and Coding , 1979 .

[5]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[6]  Jinn-Ja Chang,et al.  Some extended results on the search for good convolutional codes , 1997, IEEE Trans. Inf. Theory.

[7]  Irina E. Bocharova,et al.  Rational rate punctured convolutional codes for soft-decision Viterbi decoding , 1997, IEEE Trans. Inf. Theory.

[8]  S. Host,et al.  On the error exponent for woven convolutional codes with outer warp , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[9]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[10]  Rolf Johannesson,et al.  A first encounter with binary woven convolutional codes , 1997 .