Fast operations on linearized polynomials and their applications in coding theory
From MaRDI portal
Publication:1635282
DOI10.1016/j.jsc.2017.11.012zbMath1398.12015arXiv1512.06520OpenAlexW2963687969MaRDI QIDQ1635282
Sven Puchinger, Antonia Wachter-Zeh
Publication date: 6 June 2018
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.06520
fast multiplicationlinearized polynomialsskew polynomialsfast decodingfast minimal subspace polynomialfast multi-point evaluation
Related Items
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ On decoding additive generalized twisted Gabidulin codes ⋮ Encoding and decoding of several optimal rank metric codes ⋮ Rank-Metric Codes and Their Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On transform-domain error and erasure correction by Gabidulin codes
- A new faster algorithm for factoring skew polynomials over finite fields
- Matrix multiplication via arithmetic progressions
- Fast rectangular matrix multiplication and some applications
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Fast rectangular matrix multiplication and applications
- Decoding of Reed Solomon codes beyond the error-correction bound
- Linearized polynomials and permutation polynomials of finite fields
- Fast decoding of Gabidulin codes
- Linear codes using skew polynomials with automorphisms and derivations
- Linearized polynomials over finite fields revisited
- Elliptic periods for finite fields
- Gaussian elimination is not optimal
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
- A New Algorithm for Decoding Reed-Solomon Codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- A method for solving key equation for decoding goppa codes
- Fast Algorithms for Manipulating Formal Power Series
- The dynamics of linearized polynomials
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Maximum-rank array codes and their application to crisscross error correction
