期刊论文详细信息
| Journal of Algebra Combinatorics Discrete Structures and Applications | |
| Generalization of the Ball-Collision Algorithm | |
| 关键词: Coding theory; ISD; Ball-collision; | |
| DOI : | |
| 来源: DOAJ | |
【 摘 要 】
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.
【 授权许可】
Unknown
878987797
028-85220240
