Counting polynomials with distinct zeros in Galois ring GR(p^2,r)

DOI10.1016/J.DISC.2024.114354MaRDI QIDQ7028868zbMATH OpenFDO

Authors Ying Wang, Haiyan Zhou

Publication date 11 February 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114354

zbMATH Keywords

distance distributionGalois ringsReed-Solomon codessubset sum problem

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Cites work

• A new sieve for distinct coordinate counting
• An asymptotic formula for counting subset sums over subgroups of finite fields
• Computing error distance of Reed-Solomon codes
• Counting polynomials with a given number of zeros in a finite field
• Counting polynomials with distinct zeros in finite fields
• Deep holes in Reed-Solomon codes based on Dickson polynomials
• Distance Distribution in Reed-Solomon Codes
• Extensions of Schönemann's theorem in Galois rings
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 2002850 (Why is no real title available?)
• scientific article; zbMATH DE number 1421001 (Why is no real title available?)
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
• List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
• On error distance of Reed-Solomon codes
• On the subset sum problem over finite fields
• Subset sums over Galois rings
• Subset sums over Galois rings. II

This page was built for publication: Counting polynomials with distinct zeros in Galois ring \(\mathrm{GR}(p^2,r)\)

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