Header

UZH-Logo

Maintenance Infos

Generalization of the ball-collision algorithm


Interlando, Carmelo; Khathuria, Karan; Rohrer, Nicole; Rosenthal, Joachim; Weger, Violetta (2020). Generalization of the ball-collision algorithm. Journal of Algebra Combinatorics Discrete Structures and Applications:197-209.

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.

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.

Statistics

Citations

Dimensions.ai Metrics

Altmetrics

Downloads

4 downloads since deposited on 06 Nov 2020
4 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Journal Article, not_refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:340 Law
610 Medicine & health
510 Mathematics
Scopus Subject Areas:Physical Sciences > Algebra and Number Theory
Physical Sciences > Discrete Mathematics and Combinatorics
Language:English
Date:1 May 2020
Deposited On:06 Nov 2020 08:09
Last Modified:07 Nov 2020 21:00
Publisher:Yildiz Technical University
ISSN:2148-838X
OA Status:Gold
Free access at:Publisher DOI. An embargo period may apply.
Publisher DOI:https://doi.org/10.13069/jacodesmath.729477

Download

Gold Open Access

Download PDF  'Generalization of the ball-collision algorithm'.
Preview
Content: Published Version
Language: English
Filetype: PDF
Size: 568kB
View at publisher
Licence: Creative Commons: Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)