A method for finding codewords of small weight

  • Jacques Stern
Section II Information Theory, Decoding And Cryptography

DOI: 10.1007/BFb0019850

Part of the Lecture Notes in Computer Science book series (LNCS, volume 388)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Jacques Stern
    • 1
    • 2
  1. 1.Équipe de logiqueUniversité Paris 7France
  2. 2.Département de mathématiques et informatiqueÉcole Normale SupérieureFrance

Personalised recommendations