Strongly-MDS convolutional codes

Maximum-distance separable (MDS) convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper, a class of MDS convolutional codes is introduced whose column distances reach the generalized Singleton bound at the earliest possible instant. Such codes are called strongly-MDS convolutional codes. They also have a maximum or near-maximum distance profile. The extended row distances of these codes will also be discussed briefly.

[1]  Heide Gluesing-Luerssen,et al.  On Cyclic Convolutional Codes , 2002 .

[2]  Kees Roos.  On the structure of convolutional and cyclic convolutional codes , 1979, IEEE Trans. Inf. Theory.

[3]  John P. Robinson.  Error propagation and definite decoding of convolutional codes , 1968, IEEE Trans. Inf. Theory.

[4]  Joachim Rosenthal,et al.  Linear systems analysis and decoding of convolutional codes , 1999 .

[5]  Christoforos N. Hadjicostis,et al.  Finite-state machine embeddings for nonconcurrent error detection and identification , 2005, IEEE Transactions on Automatic Control.

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

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

[8]  Jørn Justesen.  Upper bounds on the number of errors corrected by a convolutional code , 2004, IEEE Transactions on Information Theory.

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

[10]  Daniel J. Costello.  A construction technique for random-error-correcting convolutional codes , 1969, IEEE Trans. Inf. Theory.

[11]  Joachim Rosenthal,et al.  Maximum Distance Separable Convolutional Codes , 1999, Applicable Algebra in Engineering, Communication and Computing.

[12]  Joachim Rosenthal,et al.  Constructions of MDS-convolutional codes , 2001, IEEE Trans. Inf. Theory.

[13]  Joachim Rosenthal,et al.  Convolutional codes with maximum distance profile , 2003, Syst. Control. Lett..

[14]  Joachim Rosenthal,et al.  BCH convolutional codes , 1999, IEEE Trans. Inf. Theory.

[15]  Christoforos N. Hadjicostis,et al.  Encoded dynamics for fault tolerance in linear finite-state machines , 2002, IEEE Trans. Autom. Control..

[16]  Jørn Justesen,et al.  On maximum-distance-separable convolutional codes (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[17]  Christoforos N. Hadjicostis,et al.  Non-Concurrent Error Detection and Correction in Fault-Tolerant Discrete-Time LTI Dynamic Systems , 2003 .

[18]  P. Piret,et al.  Structure and constructions of cyclic convolutional codes , 1976, IEEE Trans. Inf. Theory.

[19]  E. Paaske,et al.  Quasi-cyclic unit memory convolutional codes , 1990, IEEE Trans. Inf. Theory.

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

[21]  Tor Aulin,et al.  Algorithmic construction of trellis codes , 1993, IEEE Trans. Commun..

[22]  Vakhtang Lomadze,et al.  Convolutional Codes and Coherent Sheaves , 2001, Applicable Algebra in Engineering, Communication and Computing.

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

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

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

[26]  J. M. Muñoz Porras,et al.  Convolutional Codes of Goppa Type , 2003, Applicable Algebra in Engineering, Communication and Computing.

[27]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

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

[29]  Heide Gluesing-Luerssen,et al.  Some Small Cyclic Convolutional Codes , 2002 .

[30]  R. Johannesson,et al.  Distances and distance bounds for convolutional codes—an overview , 1989 .

[31]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[32]  Ron M. Roth,et al.  On MDS codes via Cauchy matrices , 1989, IEEE Trans. Inf. Theory.

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

[34]  Ron M. Roth,et al.  On generator matrices of MDS codes , 1985, IEEE Trans. Inf. Theory.

[35]  J. B. Shearer,et al.  There is no MacWilliams identity for convolutional codes (Corresp.) , 1977, IEEE Trans. Inf. Theory.

[36]  Jørn Justesen,et al.  Bounds on distances and error exponents of unit memory codes , 1983, IEEE Trans. Inf. Theory.

[37]  A. Robert Calderbank,et al.  Minimal tail-biting trellises: The Golay code and more , 1999, IEEE Trans. Inf. Theory.

[38]  Joachim Rosenthal,et al.  Connections between linear systems and convolutional codes , 2000, math/0005281.

[39]  Rolf Johannesson,et al.  Optimal and near-optimal encoders for short and moderate-length tail-biting trellises , 1999, IEEE Trans. Inf. Theory.