Subset sums over Galois rings. II

DOI10.1016/j.jnt.2023.05.003OpenAlexW4382542483MaRDI QIDQ6166733

Haiyan Zhou, Yuchen Ding

Publication date: 3 August 2023

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

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

zbMATH Keywords

Galois ringssubset sumsWeil's bound

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other character sums and Gauss sums (11T24) Asymptotic enumeration (05A16)

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
• Distinct coordinate solutions of linear equations over finite fields
• Subset sums over Galois rings
• Linearized Wenger graphs
• Stopping Sets of Algebraic Geometry Codes
• A Deterministic Reduction for the Gap Minimum Distance Problem
• Hard Problems of Algebraic Geometry Codes
• Distance Distribution in Reed-Solomon Codes
• Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
• On Deciding Deep Holes of Reed-Solomon Codes
• On Some Exponential Sums

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