Skip to main content

On periodic (partial) unit memory codes with maximum free distance

  • Conference paper
  • First Online:
Error Control, Cryptology, and Speech Compression (ECCSP 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 829))

Included in the following conference series:

Abstract

In this paper we describe two constructions of q-ary (partial) unit memory codes that achieve upper bounds on the free distance. These constructions are based on Reed-Solomon codes. We show that the increase a of the extended row distance of the proposed codes is larger than that for known ones.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Thommesen and J. Justesen, Bounds on distances and error exponents of unit memory codes, IEEE Trans. Inform. Theory, IT-29(5), 637–649, 1983

    Google Scholar 

  2. F. Pollara, R. J. McEliece, and K. Abdel-Ghaffar, Finite-states codes, IEEE Trans. Inform. Theory, IT-34(5), 1083–1089, 1988

    Google Scholar 

  3. V. V. Zyablov and V. R. Sidorenko, Bounds on complexity of trellis decoding of linear block codes, Problems of Information Transmission, 29(3), 3–9, Jul.–Sept., 1993 (transl. from Russian)

    Google Scholar 

  4. S. A. Popov, Synchronization of separate MDS codewords in presence of noise, Problems of Information Transmission, 21(3), 28–35, 1985 (transl. from Russian)

    Google Scholar 

  5. J. Justesen, Bounded distance decoding of unit memory codes, IEEE Trans. Inform. Theory, IT-39(5), 1616–1627, 1993

    Google Scholar 

  6. U. K. Sorger, A new construction of partial unit memory codes based on Reed-Solomon Codes, Problems of Information Transmission, submitted 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrew Chmora Stephen B. Wicker

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zyablov, V., Sidorenko, V. (1994). On periodic (partial) unit memory codes with maximum free distance. In: Chmora, A., Wicker, S.B. (eds) Error Control, Cryptology, and Speech Compression. ECCSP 1993. Lecture Notes in Computer Science, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58265-7_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-58265-7_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58265-6

  • Online ISBN: 978-3-540-48588-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics