Linearized polynomial Chinese remainder codes

DOI10.1007/S10623-026-01911-0MaRDI QIDQ7312753zbMATH OpenFDO

Authors Philippe Gaborit, Camille Garnier, Olivier Ruatta

Publication date 12 August 2026

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

Full work available at URL https://doi.org/10.1007/S10623-026-01911-0

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Cites work

• Soft-decision decoding of Chinese remainder codes
• A new faster algorithm for factoring skew polynomials over finite fields
• Chinese remaindering with errors
• Codes in the sum-rank metric: fundamentals and applications
• Finite-Dimensional Division Algebras over Fields
• scientific article; zbMATH DE number 7434622 (Why is no real title available?)
• Identity-based encryption from codes with rank metric
• MinRank Gabidulin encryption scheme on matrix codes
• Multiple-Burst Error Correction with the Chinese Remainder Theorem
• On a Special Class of Polynomials
• Polynomial Codes Over Certain Finite Fields
• Rank-metric codes and their applications
• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
• Structural attacks for public key cryptosystems based on Gabidulin codes
• The Partial-Inverse Approach to Linearized Polynomials and Gabidulin Codes With Applications to Network Coding
• Theory of codes with maximum rank distance
• Theory of non-commutative polynomials

This page was built for publication: Linearized polynomial Chinese remainder codes

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