Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
From MaRDI portal
Publication:6123057
DOI10.1007/s10623-023-01315-4arXiv2207.01319MaRDI QIDQ6123057
Johan Rosenkilde, Hannes Bartz, Thomas Jerkovits
Publication date: 4 March 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.01319
Cites Work
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- A new faster algorithm for factoring skew polynomials over finite fields
- Algebraic decoding of folded Gabidulin codes
- Theory of codes with maximum rank distance
- Vandermonde and Wronskian matrices over division rings
- Decoding of Reed Solomon codes beyond the error-correction bound
- On lattice reduction for polynomial matrices
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Fast operations on linearized polynomials and their applications in coding theory
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Evaluation and interpolation over multivariate skew polynomial rings
- Theory of non-commutative polynomials
- Pseudo linear transformations and evaluation in Ore extensions
- Theory and applications of linearized multivariate skew polynomials
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
- Kötter interpolation in skew polynomial rings
- Canonical forms for polynomial and quadratic differential operators
- Linear codes using skew polynomials with automorphisms and derivations
- Computing minimal interpolation bases
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Hilbert 90 Theorems Over Divison Rings
- On the key equation
- Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
- Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes
- Generic Decoding in the Sum-Rank Metric
- A computational view on normal forms of matrices of Ore polynomials
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Skew Reed-Muller codes
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
