Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

04/20/2016
by   Sven Puchinger, et al.
0

We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ^3 n^(ω+1)/2(n)) decoding algorithm for ℓ-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent, improving in the exponent of n compared to previous results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2019

Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication

We propose a class of codes called random Khatri-Rao-Product (RKRP) code...
research
08/30/2022

On the exponent of cyclic codes

We propose an algorithm to find a lower bound for the number of cyclic c...
research
02/01/2016

Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations

We give a Las Vegas algorithm which computes the shifted Popov form of a...
research
10/18/2018

Solving Linear Programs in the Current Matrix Multiplication Time

This paper shows how to solve linear programs of the form _Ax=b,x≥0 c^ x...
research
05/31/2019

A Dynamical System-based Key Equation for Decoding One-Point Algebraic-Geometry Codes

A closer look at linear recurring sequences allowed us to define the mul...
research
01/30/2019

Egyptian multiplication and some of its ramifications

Fast exponentiation with an integer exponent relies on squaring of the b...
research
05/31/2019

Collaborative Decoding of Polynomial Codes for Distributed Computation

We show that polynomial codes (and some related codes) used for distribu...

Please sign up or login with your details

Forgot password? Click here to reset