Distinct coordinate solutions of linear equations over finite fields

DOI10.1016/j.ffa.2019.101602zbMath1461.11162arXiv1905.00306OpenAlexW2982236222MaRDI QIDQ2291366

Yanyan Li

Publication date: 30 January 2020

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldslinear equationsdistinct coordinate sieve

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items

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

Cites Work

• Unnamed Item
• On a conjecture of polynomials with prescribed range
• Distinct solution to a linear congruence
• A new sieve for distinct coordinate counting
• Counting subset sums of finite Abelian groups
• Permutations, hyperplanes and polynomials over finite fields
• Permutations over cyclic groups
• Enumerating permutation polynomials over finite fields by degree. II
• On the subset sum problem over finite fields
• Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes
• Counting compositions over finite abelian groups
• The number of permutation polynomials of a given degree over a finite field
• Enumerating permutation polynomials over finite fields by degree
• Arithmetic-progression-weighted subsequence sums
• A generalization of Schönemann's theorem via a graph theoretic method
• Linearized Wenger graphs
• On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields
• Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
• On the List and Bounded Distance Decodability of Reed–Solomon Codes