Subset sums over Galois rings

DOI10.1016/j.jnt.2019.05.004zbMath1454.11221OpenAlexW2952698996WikidataQ127672175 ScholiaQ127672175MaRDI QIDQ2322901

Haiyan Zhou, Yuchen Ding

Publication date: 5 September 2019

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2019.05.004

zbMATH Keywords

finite fieldsGalois ringssubset sums

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other character sums and Gauss sums (11T24) Asymptotic enumeration (05A16) Additive bases, including sumsets (11B13)

Related Items (2)

Subset sums over Galois rings. II ⋮ Extensions of Schönemann's theorem in Galois rings

Cites Work

• Unnamed Item
• Unnamed Item
• Deep holes in Reed-Solomon codes based on Dickson polynomials
• On the error distance of extended Reed-Solomon codes
• Subset sums of quadratic residues over finite fields
• A new sieve for distinct coordinate counting
• Counting subset sums of finite Abelian groups
• An asymptotic formula for counting subset sums over subgroups of finite fields
• On the subset sum problem over finite fields
• On error distance of Reed-Solomon codes
• Counting points on diagonal equations over Galois rings \(\mathrm{GR}(p^2,p^{2r})\)
• The \(k\)-subset sum problem over finite fields
• Linearized Wenger graphs
• A Deterministic Reduction for the Gap Minimum Distance Problem
• Hard Problems of Algebraic Geometry Codes
• Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
• On Deciding Deep Holes of Reed-Solomon Codes

This page was built for publication: Subset sums over Galois rings