Generalization of the ball-collision algorithm

Carmelo Interlando; Karan Khathuria; Nicole Rohrer; Joachim Rosenthal; Violetta Weger

doi:10.13069/jacodesmath.729477

Authors

Carmelo Interlando Department of Mathematics and Statistics, San Diego State University, San Diego, CA 92182-7720 https://orcid.org/0000-0003-4928-043X
Karan Khathuria Institute of Mathematics, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland https://orcid.org/0000-0002-9886-2770
Nicole Rohrer Institute of Mathematics, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland
Joachim Rosenthal Institute of Mathematics, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland https://orcid.org/0000-0003-4545-3559
Violetta Weger Institute of Mathematics, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland https://orcid.org/0000-0001-9186-2885

DOI:

https://doi.org/10.13069/jacodesmath.729477

Keywords:

Coding theory, ISD, Ball-collision

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.

Received: 10 September 2019 | Accepted: 18 April 2020

Downloads

Download data is not yet available.

Generalization of the ball-collision algorithm

Authors

DOI:

Keywords:

Abstract

Downloads

Downloads

Published

How to Cite

Issue

Section

customsearchblock

journal_status

Journal Status

Make a Submission