Generalization of the Ball-Collision Algorithm

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Carmelo Interlando¹  Karan Khathuria²  Nicole Rohrer²  Joachim Rosenthal²  Violetta Weger² 

[1] Department of Mathematics and Statistics, San Diego State University;Institute of Mathematics, University of Zurich

关键词: Coding theory;    ISD;    Ball-collision;   

DOI  :  10.13069/jacodesmath.729477

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

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.

【 授权许可】

CC BY