Some Partial Unit Memory Convolutional Codes

K. Abdel-GhaffarUniversity of California, DavisR. J. McEliece 1G. Solomon 2This article presents the results of a study of a class of error-correcting codescalled partial-unit-memory convolutional codes, or PUM codes for short. This classof codes, though not entirely new, has until now remained relatively unexplored.This article shows that it is possible to use the well-developed theory of block codesto construct a large family of promising PUM codes. Indeed, at the end of thearticle the performances of several specific PUM codes are compared with that ofthe Voyager standard (2, i, 6) convolutional code. It was found that these codes canoutperform the Voyager code with little or no increase in decoder complexity. Thissuggests that there may very well be PUM codes that can be used for deep-spacetelemetry that offer both increased performance and decreased implementationalcomplexity over current coding systems.

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

[2]  Harald Niederreiter,et al.  Weights of Cyclic Codes , 1977, Information and Control.

[3]  Fabrizio Pollara,et al.  Further results on finite-state codes , 1988 .

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

[5]  Lin-nan Lee,et al.  Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.) , 1976, IEEE Trans. Inf. Theory.

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

[7]  Khaled A. S. Abdel-Ghaffar,et al.  Finite-state codes , 1988, IEEE Trans. Inf. Theory.

[8]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[9]  Gregory S. Lauer Some optimal partial-unit-memory codes (Corresp.) , 1979, IEEE Trans. Inf. Theory.