Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
From MaRDI portal
Publication:1620975
Recommendations
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- On the decoding of cyclic codes using Gröbner bases
- Decoding interleaved Gabidulin codes using Alekhnovich's algorithm
- Decoding affine variety codes using Gröbner bases
- scientific article; zbMATH DE number 2222667
- A decoding algorithm for binary linear codes using Groebner bases
- Gröbner bases over Galois rings with an application to decoding alternant codes
- Improved syndrome decoding of lifted L-interleaved Gabidulin codes
Cites work
- A Rank-Metric Approach to Error Control in Random Network Coding
- Bilinear forms over a finite field, with applications to coding theory
- Bounds for projective codes from semidefinite programming
- Bounds on List Decoding of Rank-Metric Codes
- Coding for Errors and Erasures in Random Network Coding
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Error-Correcting Codes in Projective Space
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Johnson type bounds on constant dimension codes
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- 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
- On transform-domain error and erasure correction by Gabidulin codes
- Optimal Ferrers Diagram Rank-Metric Codes
- Recursive Code Construction for Random Networks
- Row reduction applied to decoding of rank-metric and subspace codes
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
- Theory of codes with maximum rank distance
Cited in
(14)- Improved syndrome decoding of lifted L-interleaved Gabidulin codes
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes
- Decoding interleaved Gabidulin codes using Alekhnovich's algorithm
- List decoding subspace codes from insertions and deletions
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes
- Row reduction applied to decoding of rank-metric and subspace codes
- Algebraic decoding of folded Gabidulin codes
- A module minimization approach to Gabidulin decoding via interpolation
- Rank-metric codes and their applications
- Insdel codes from subspace and rank-metric codes
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
- Fast Gao-like Decoding of Horizontally Interleaved Linearized Reed-Solomon Codes
- Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
This page was built for publication: Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1620975)
