Generalization of the ball-collision algorithm
- 7 May 2020
- journal article
- research article
- Published by Journal of Algebra Combinatorics Discrete Structures and Applications in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 7 (2) , 195-207
Abstract
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary field to a general finite field. We also provide a complexity analysis and compare the asymptotic complexity to other generalized information set decoding algorithms.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Security Bounds for the Design of Code-Based Cryptosystems2009
- A Statistical Decoding Algorithm for General Linear Block Codes2001
- On the complexity of minimum distance decoding of long linear codesIEEE Transactions on Information Theory, 1999
- Minimal vectors in linear codesIEEE Transactions on Information Theory, 1998
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- Asymptotic Analysis of Probabilistic Algorithms for Finding Short Codewords1993
- A probabilistic algorithm for computing minimum weights of large error-correcting codesIEEE Transactions on Information Theory, 1988
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- Schnelle Multiplikation großer ZahlenComputing, 1971
- The use of information sets in decoding cyclic codesIEEE Transactions on Information Theory, 1962