List decoding of maximal order codes over number fields
From MaRDI portal
(Redirected from Publication:6185629)
The paper uses basic algebraic number theoretic results to briefly sketch algorithms for list decoding the number field generalizations of Chinese reminder codes from the paper by \textit{C. Maire} and \textit{F. Oggier} [J. Pure Appl. Algebra 222, No. 7, 1827--1858 (2018; Zbl 1430.94101)].
Recommendations
Cites work
- Chinese remaindering with errors
- Chinese remaindering with errors
- Construction of codes from Arakelov geometry
- Constructions of codes from number fields
- Decoding of Reed Solomon codes beyond the error-correction bound
- Divisors on division algebras and error correcting codes
- Finding smooth integers in short intervals using CRT decoding
- Finding smooth integers in short intervals using CRT decoding
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 4002031 (Why is no real title available?)
- scientific article; zbMATH DE number 2081120 (Why is no real title available?)
- Improved asymptotic bounds for error-correcting codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List decoding of number field codes
- Maximal order codes over number fields
- On a class of arithmetic codes and a decoding algorithm (Corresp.)
This page was built for publication: List decoding of maximal order codes over number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185629)