BCH convolutional codes

Using a new parity-check matrix, a class of convolutional codes with a designed free distance is introduced. This new class of codes has many characteristics of BCH block codes, therefore, we call these codes BCH convolutional codes.

[1]  Philippe Piret,et al.  Convolutional Codes: An Algebraic Approach , 1988 .

[2]  Philippe Piret.  A convolutional equivalent to Reed-Solomon codes , 1988 .

[3]  Thomas Kailath,et al.  Linear Systems , 1980 .

[4]  Joachim Rosenthal,et al.  Realization by inspection , 1997, IEEE Trans. Autom. Control..

[5]  M.L.J. Hautus,et al.  Controllability and observability conditions of linear autonomous systems , 1969 .

[6]  Ettore Fornasini,et al.  On 2D finite support convolutional codes: An algebraic approach , 1994, Multidimens. Syst. Signal Process..

[7]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[8]  D. Prätzel-Wolters,et al.  Minimal bases of polynomial modules, structural indices and Brunovsky-transformations , 1979 .

[9]  Jørn Justesen,et al.  New convolutional code constructions and a class of asymptotically good time-varying codes , 1973, IEEE Trans. Inf. Theory.

[10]  Jørn Justesen,et al.  An algebraic construction of rate 1/v -ary codes; algebraic construction (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[11]  J. Massey,et al.  Codes, automata, and continuous systems: Explicit interconnections , 1967, IEEE Transactions on Automatic Control.

[12]  Joachim Rosenthal,et al.  An Algebraic Decoding Algorithm for Convolutional Codes , 1999 .

[13]  G. David Forney,et al.  Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.

[14]  M. S. Ravi,et al.  A smooth compactification of the space of transfer functions with fixed McMillan degree , 1994 .

[15]  Daniel J. Costello,et al.  Polynomial weights and code constructions , 1973, IEEE Trans. Inf. Theory.

[16]  R. Tennant.  Algebra , 1941, Nature.

[17]  E. V. York.  Algebraic Description And Construction Of Error Correcting Codes: A Linear Systems Point Of View , 1997 .

[18]  J. Rosenthal,et al.  A state space approach for constructing MDS rate 1/n convolutional codes , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[19]  Joachim Rosenthal,et al.  On behaviors and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[20]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[21]  Av . Van Becelaere.  A CONVOLUTIONAL EQUIVALENT TO REED- SOLOMON CODES , 1988 .

[22]  Daniel J. Costello,et al.  An Algebraic Approach to COnstruction Convolutional Codes from Quasi-Cyclic Codes , 1992, Coding And Quantization.

[23]  Jr. G. Forney,et al.  Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .

[24]  T. Aaron Gulliver,et al.  A Link Between Quasi-Cyclic Codes and Convolutional Codes , 1998, IEEE Trans. Inf. Theory.

[25]  Rolf Johannesson,et al.  A linear algebra approach to minimal convolutional encoders , 1993, IEEE Trans. Inf. Theory.

[26]  V. Popov.  Invariant Description of Linear, Time-Invariant Controllable Systems , 1972 .

[27]  N. Karcanias.  Geometric properties, invariants, and the Toeplitz structure of minimal bases of rational vector spaces , 1996 .

[28]  Joachim Rosenthal.  Construction of Convolutional Codes using Methods from Linear Systems Theory , 1997 .

[29]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[30]  Rolf Johannesson,et al.  Fundamentals of Convolutional Coding , 1999 .