Row reduction applied to decoding of rank-metric and subspace codes

DOI10.1007/s10623-016-0257-9zbMath1402.94092arXiv1510.04728OpenAlexW2963181730MaRDI QIDQ510489

Johan Rosenkilde né Nielsen, Vladimir Sidorenko, Sven Puchinger, Wen-Hui Li

Publication date: 10 February 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.04728

zbMATH Keywords

Gabidulin codesskew polynomialsrow reductionMahdavifar-Vardy codesmodule minimisationshift register synthesis

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Skew fields, division rings (12E15)

Related Items

Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ 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
• Efficient algorithms for order basis computation
• A linear algebraic approach to multisequence shift-register synthesis
• List decoding of Reed-Solomon codes from a Gröbner basis perspective
• Key equations for list decoding of Reed-Solomon codes and how to solve them
• Factoring multivariate polynomials over finite fields
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• On lattice reduction for polynomial matrices
• Fast operations on linearized polynomials and their applications in coding theory
• Decoding interleaved Gabidulin codes using Alekhnovich's algorithm
• Theory of non-commutative polynomials
• Fast skew-feedback shift-register synthesis
• Linear codes using skew polynomials with automorphisms and derivations
• Fraction-free row reduction of matrices of Ore polynomials.
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
• On solutions of linear functional systems
• Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes
• Sub-Quadratic Decoding of One-Point Hermitian Codes
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• DIEUDONNÉ DETERMINANTS FOR SKEW POLYNOMIAL RINGS
• Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance
• Linearized Polynomial Interpolation and Its Applications
• A computational view on normal forms of matrices of Ore polynomials
• An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations
• Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
• Algebraic List-Decoding of Subspace Codes
• Bounds on List Decoding of Rank-Metric Codes
• List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
• Maximum-rank array codes and their application to crisscross error correction
• Les déterminants sur un corps non commutatif

This page was built for publication: Row reduction applied to decoding of rank-metric and subspace codes