Deep holes in Reed-Solomon codes based on Dickson polynomials

DOI10.1016/j.ffa.2016.03.005zbMath1409.11124arXiv1507.01653OpenAlexW856910904MaRDI QIDQ285466

Matt Keti, Daqing Wan

Publication date: 19 May 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.01653

zbMATH Keywords

character sumReed-Solomon codeWaring's problemsubset sumdeep holeDickson polynomial

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Waring's problem and variants (11P05) Polynomials over finite fields (11T06) Other character sums and Gauss sums (11T24) Applications of sieve methods (11N36)

Related Items (9)

On the error-correcting pair for MDS linear codes with even minimum distance ⋮ Subset sums over Galois rings. II ⋮ On LCD codes from skew symmetric Toeplitz matrices ⋮ Counting polynomials with distinct zeros in finite fields ⋮ The \(k\)-subset sum problem over finite fields ⋮ On deep holes of Gabidulin codes ⋮ Moment subset sums over finite fields ⋮ Subset sums over Galois rings ⋮ The \(k\)-subset sum problem over finite fields of characteristic 2

Cites Work

• Unnamed Item
• Unnamed Item
• Singularities of symmetric hypersurfaces and Reed-Solomon codes
• A new sieve for distinct coordinate counting
• On the number of solutions of equations of Dickson polynomials over finite fields
• On the subset sum problem over finite fields
• On deep holes of standard Reed-Solomon codes
• On Reed-Solomon codes
• On Determining Deep Holes of Generalized Reed-Solomon Codes
• Computing Error Distance of Reed-Solomon Codes
• Counting Value Sets: Algorithm and Complexity
• On the Waring problem with Dickson polynomials in finite fields
• Deep holes of generalized Reed-Solomon codes
• On Deciding Deep Holes of Reed-Solomon Codes

This page was built for publication: Deep holes in Reed-Solomon codes based on Dickson polynomials