A new sieve for distinct coordinate counting

DOI10.1007/s11425-010-3121-9zbMath1210.05010OpenAlexW1984159148MaRDI QIDQ625832

Jiyou Li, Daqing Wan

Publication date: 25 February 2011

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-010-3121-9

zbMATH Keywords

sievedistinct coordinate counting

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other character sums and Gauss sums (11T24) Applications of sieve methods (11N36)

Related Items (20)

Deep holes in Reed-Solomon codes based on Dickson polynomials ⋮ Subset sums of quadratic residues over finite fields ⋮ On sums of coefficients of Borwein type polynomials over arithmetic progressions ⋮ On the average sensitivity of the weighted sum function ⋮ On the Borwein conjecture ⋮ Subset sums over Galois rings. II ⋮ Some formulae for coefficients in restricted \(q\)-products ⋮ Counting subset sums of finite Abelian groups ⋮ On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields ⋮ An asymptotic formula for counting subset sums over subgroups of finite fields ⋮ Counting polynomials with distinct zeros in finite fields ⋮ The \(k\)-subset sum problem over finite fields ⋮ A new sieve for restricted multiset counting ⋮ The simplified weighted sum function and its average sensitivity ⋮ Distinct coordinate solutions of linear equations over finite fields ⋮ Moment subset sums over finite fields ⋮ On sums of coefficients of polynomials related to the Borwein conjectures ⋮ Subset sums over Galois rings ⋮ The \(k\)-subset sum problem over finite fields of characteristic 2 ⋮ Extensions of Schönemann's theorem in Galois rings

Cites Work

• Factoring polynomials in finite fields: An application of Lang-Weil to a problem in graph theory
• On the subset sum problem over finite fields
• On error distance of Reed-Solomon codes
• Polynomial factorisation and an application to regular directed graphs
• Complexity of Decoding Positive-Rate Reed-Solomon Codes
• Diameters and Eigenvalues
• Generators and irreducible polynomials over finite fields
• A deterministic reduction for the gap minimum distance problem
• On Deciding Deep Holes of Reed-Solomon Codes
• On the List and Bounded Distance Decodability of Reed–Solomon Codes

This page was built for publication: A new sieve for distinct coordinate counting