Skip to main content
SpringerLink
Log in

A method for finding codewords of small weight

  • Section II Information Theory, Decoding And Cryptography
  • Conference paper
  • First Online:
Coding Theory and Applications (Coding Theory 1988)

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

Included in the following conference series:

Abstract

We describe a probabilistic algorithm, which can be used to discover words of small weight in a linear binary code. The work-factor of the algorithm is asymptotically quite large but the method can be applied for codes of a medium size. Typical instances that are investigated are codewords of weight 20 in a code of length 300 and dimension 150.

research supported by the P.R.C. Mathématiques et Informatique

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. E.R.Berlekamp, R.J.Mc Eliece and H.C.A. Van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, (1978) 384–386.

    Google Scholar 

  2. A. Fiat and A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Proceedings of Crypto 86, Santa-Barbara (1986), 181–187.

    Google Scholar 

  3. S. Harari, This volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Équipe de logique, Université Paris 7, France

    Jacques Stern

  2. Département de mathématiques et informatique, École Normale Supérieure, France

    Jacques Stern

Authors
  1. Jacques Stern
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Jacques Wolfmann

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stern, J. (1989). A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019850

Download citation

  • DOI: https://doi.org/10.1007/BFb0019850

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51643-9

  • Online ISBN: 978-3-540-46726-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation