Systematic Unit-Memory Binary Convolutional Codes from Linear Block Codes over F2r + vF2r
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 33104
Systematic Unit-Memory Binary Convolutional Codes from Linear Block Codes over F2r + vF2r

Authors: John Mark Lampos, Virgilio Sison

Abstract:

Two constructions of unit-memory binary convolutional codes from linear block codes over the finite semi-local ring F2r +vF2r , where v2 = v, are presented. In both cases, if the linear block code is systematic, then the resulting convolutional encoder is systematic, minimal, basic and non-catastrophic. The Hamming free distance of the convolutional code is bounded below by the minimum Hamming distance of the block code. New examples of binary convolutional codes that meet the Heller upper bound for systematic codes are given.

Keywords: Convolutional codes, semi-local ring, free distance, Heller bound.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1072890

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1652

References:


[1] W. Ebel, "A directed search approach for unit-memory convolutional codes," IEEE Trans. Inform. Theory, vol. 42, No.4, pp. 1290-1297, 1996.
[2] F. Fagnani, and S. Zampieri, "System-theoretic properties of convolutional codes over rings," IEEE Trans. Inform. Theory, vol. 47, no. 6, pp. 2256-2274, 2001.
[3] G.D. Forney, Jr., "Convolutional codes I: Algebraic structure," IEEE Trans. Inform. Theory, vol. IT-16, no. 6, pp. 720-738, 1970.
[4] R. Johannesson, Z. Wan, and E. Wittenmark, "Some structural properties of convolutional codes over rings," IEEE Trans. Inf. Theory, vol.44, pp. 839845, Mar. 1998.
[5] R. Johannesson, and K.Sh. Zigangirov, "Fundamentals of convolutional coding," IEEE Press, USA, 1999.
[6] L.-N. Lee, "Short unit-memory byte-oriented convolutional codes having maximal free distance," IEEE Trans. Inform. Theory, vol. IT-22, no. 3, pp. 349-352, May 1976.
[7] J.L. Massey, D.J. Costello, Jr., and J. Justesen, "Polynomial weights and code constructions," IEEE Trans. Inform. Theory, vol. IT-19, no. 1, pp. 101-110, January 1973.
[8] T. Mittelholzer, "Minimal encoders for convolutional codes over rings," in Communications Theory and Applications, London, U.K.:HW Comm. Ltd., pp. 3036, 1993.
[9] J. Rosenthal, and R. Smarandache, "Maximum Distance Separable Convolutional Codes," in Appl. Algebra Engrg. Comm. Comput., vol. 10, no. 1, pp. 1532, 1999.
[10] V. Sidorenko, C. Medina, and M. Bossert, "From block to convolutional codes using block distances," ISIT 2007,Nice, France, pp. 2331-2335, 2007.
[11] V. Sison, "Heller-type bounds for the homogeneous free distance of convolutional codes over finite Frobenius rings," Matimy'as Matematika, vol. 30, no. 1, pp. 23-30, 2007.
[12] P. Sol'e and V. Sison, "Quaternary convolutional codes from linear block codes over Galois rings," IEEE Trans. Inform. Theory, vol. 53, no. 6, pp. 2267-2270, June 2007.
[13] C. Thommesen and J. Justesen, "Bounds on distances and error exponents of unit-memory codes," IEEE Trans. Inform. Theory, vol. IT-29, no. 5, pp. 637-649, September 1983.