Generalization of the Ball-Collision Algorithm

12/28/2018
by   Carmelo Interlando, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2020

Negative Instance for the Edge Patrolling Beacon Problem

Can an infinite-strength magnetic beacon always “catch” an iron ball, wh...
research
10/30/2017

Linearly convergent stochastic heavy ball method for minimizing generalization error

In this work we establish the first linear convergence result for the st...
research
09/21/2018

A numerical approach for the filtered generalized Cech complex

In this paper, we present an algorithm to compute the filtered generaliz...
research
09/09/2020

Bang the Can Slowly: An Investigation into the 2017 Houston Astros

This manuscript is a statistical investigation into the 2017 Major Leagu...
research
03/13/2023

The Localized Union-of-Balls Bifiltration

We propose an extension of the classical union-of-balls filtration of pe...
research
01/07/2023

D-Optimal and Nearly D-Optimal Exact Designs for Binary Response on the Ball

In this paper the results of Radloff and Schwabe (2019a) will be extende...
research
04/22/2021

Automated Tackle Injury Risk Assessment in Contact-Based Sports – A Rugby Union Example

Video analysis in tackle-collision based sports is highly subjective and...

Please sign up or login with your details

Forgot password? Click here to reset