List decoding of number field codes
From MaRDI portal
Publication:2249795
DOI10.1007/s10623-013-9803-xzbMath1321.94137MaRDI QIDQ2249795
Publication date: 3 July 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01947490/file/manuscript_ncoxon.pdf
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B35: Decoding
94B40: Arithmetic codes
Related Items
Algebraic integers with small absolute size, List decoding of maximal order codes over number fields, Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding, The size of algebraic integers with many real conjugates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topics in computational algebraic number theory
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Factoring polynomials with rational coefficients
- Decoding of Reed Solomon codes beyond the error-correction bound
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- A relative van Hoeij algorithm over number fields
- Bemerkung zur Norm der Inversen einer Matrix
- Algorithms for the Shortest and Closest Lattice Vector Problems
- Integer Relations Among Algebraic Numbers
- An LLL Algorithm with Quadratic Complexity
- Factoring Polynomials over Algebraic Number Fields
- Algorithms in Algebraic Number Theory
- On Computing the Exact Determinant of Matrices with Polynomial Entries
- An Inequality About Factors of Polynomials
- On a class of arithmetic codes and a decoding algorithm (Corresp.)
- Chinese remaindering with errors
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Constructions of codes from number fields
- Improved asymptotic bounds for error-correcting codes
- Advanced Topics in Computional Number Theory
- The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
- Efficient computation of the characteristic polynomial
- Floating-Point LLL Revisited
- Generalized minimum distance decoding
- Finding smooth integers in short intervals using CRT decoding
- Number fields
