Generalization of the Ball-Collision Algorithm
classification
💻 cs.IT
cs.CRmath.IT
keywords
algorithmball-collisioncomplexityfieldalgorithmsanalysisasymptoticbernstein
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.