Optimal selection for good polynomials of degree up to five

DOI10.1007/s10623-022-01046-yzbMath1495.11127arXiv2104.01434OpenAlexW3139628486WikidataQ114849748 ScholiaQ114849748MaRDI QIDQ2672299

Andrea Ferraguti, Austin Dukes, Giacomo Micheli

Publication date: 8 June 2022

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

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

zbMATH Keywords

global function fieldsmonodromy groupsgood polynomials

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Polynomials over finite fields (11T06)

Related Items (1)

New constructions of optimal \((r, \delta)\)-LRCs via good polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analog to the discriminant over fields of characteristic two
• Good polynomials for optimal LRC of low locality
• \(r\)-fat linearized polynomials over finite fields
• Full classification of permutation rational functions and complete rational functions of degree three over finite fields
• Constructions of optimal locally recoverable codes via Dickson polynomials
• Exceptional scatteredness in prime degree
• On construction and (non)existence of \(c\)-(almost) perfect nonlinear functions
• Investigating the exceptionality of scattered polynomials
• Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• On the Locality of Codeword Symbols
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
• Locally Recoverable Codes From Automorphism Group of Function Fields of Genusg≥ 1
• Constructions of Locally Recoverable Codes Which are Optimal
• On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic

This page was built for publication: Optimal selection for good polynomials of degree up to five