# Generalization of the Ball-Collision Algorithm

## TL;DR

This paper extends the Ball-Collision Algorithm from binary fields to general finite fields, providing a complexity analysis and comparison with other decoding algorithms.

## Contribution

It generalizes the Ball-Collision Algorithm to finite fields beyond binary, offering new insights into its complexity and performance.

## Key findings

- Algorithm successfully generalized to finite fields
- Complexity analysis provided and compared with existing algorithms
- Shows potential advantages in non-binary decoding scenarios

## 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.