Fast Gao-like Decoding of Horizontally Interleaved Linearized Reed-Solomon Codes

DOI10.1007/978-3-031-46495-9_2MaRDI QIDQ6448196zbMATH OpenOpenAlexFDO

Authors Felicitas Hörmann, Hannes Bartz

Publication date 22 August 2023

Full work available at URL https://doi.org/10.1007/978-3-031-46495-9_2

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• On decoding high-order interleaved sum-rank-metric codes
• Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes
• Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
• Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
• Improved syndrome decoding of lifted L-interleaved Gabidulin codes

Cited in

(1)

• Fast decoding of interleaved linearized Reed-Solomon codes and variants

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Fast Gao-like Decoding of Horizontally Interleaved Linearized Reed-Solomon Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6448196)