Skip to main content
SpringerLink
Log in

Tables of coverings for decoding by S-sets

  • 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

A linear block decoding method in which decoding is reduced to the repeated decoding of shortened codes is proposed. The algorithm for constructing coverings from codewords, which are necessary for the proposed technique, is provided. A tables of such coverings for a number of binary BCH and quadratic-residue (QR) codes is presented.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Krouk E.A., Mironchikov E.T., Fedorenko S.V. “Decoding by S-sets.” In: Fifth Joint Soviet-Swedish International Workshop on Information Theory ”Convolutional Codes; Multi-User Communication”, Moscow, 1990, pp.113–115.

    Google Scholar 

  2. Helgert H.J., Stinaff R.D. “Minimum-distance bounds for binary linear codes”, IEEE Trans. Info. Theory, vol. IT-19, pp.344–356, 1973.

    Google Scholar 

  3. Erdös P., Spencer J. Probabilistic methods in combinatorics. Akad. Kiado, Budapest, 1974.

    Google Scholar 

  4. Asnis I.L., Fedorenko S.V. “Tables of coverings for decoding by S-sets.” In: The Workshop on Information Protection, Moscow, 1993, p.22.

    Google Scholar 

  5. Krouk E.A. “A bound on the decoding complexity of linear block codes.” Problemy Peredachi Informatsii, 1989, vol.25, No.3, pp.103–107. (in Russian).

    Google Scholar 

  6. Dumer I.I. Private communication, 1986.

    Google Scholar 

  7. Dumer I.I. “On minimum distance decoding of linear codes.” In: Fifth Joint Soviet-Swedish International Workshop on Information Theory ”Convolutional Codes; Multi-User Communication”, Moscow, 1990, pp.50–52.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St.-Petersburg State Academy of Airspace Instrumentation, Bolshaia Morskaia str., 67, 190000, St.-Petersburg, Russia

    I. L. Asnis, S. V. Fedorenko, E. A. Krouk & E. T. Mironchikov

Authors
  1. I. L. Asnis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. V. Fedorenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. A. Krouk
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. E. T. Mironchikov
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Asnis, I.L., Fedorenko, S.V., Krouk, E.A., Mironchikov, E.T. (1994). Tables of coverings for decoding by S-sets. 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_13

Download citation

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

  • 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

Search

Navigation