A method for finding codewords of small weight

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 388 LNCS, Issue , 1989, Pages 106-113

  Stern, Jacques ^a,b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b Centre National de la Recherche Scientifique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; COMPUTER PROGRAMMING;

CODE-WORDS; LINEAR BINARY CODE; MEDIUM SIZE; PROBABILISTIC ALGORITHM; WORK FACTORS;

CODES (SYMBOLS);

EID: 84964937021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0019850     Document Type: Review

References (3)

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.
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.
3. S. Harari, This volume.