Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields
From MaRDI portal
Publication:5138969
DOI10.1137/20M1318225zbMath1448.11125OpenAlexW3094996973MaRDI QIDQ5138969
Publication date: 4 December 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1318225
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The generalized Erdős-Falconer distance problems in vector spaces over finite fields
- On the Erdős distinct distances problem in the plane
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Roth's theorem in the primes
- Optimal tristance anticodes in certain graphs
- A group-theoretic viewpoint on Erdös-Falconer problems and the Mattila integral
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Hausdorff dimension and distance sets
- Codes and anticodes in the Grassman graph
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- A new proof of several inequalities on codes and sets
- Anticodes for the Grassmann and bilinear forms graphs
- On Falconer's distance set problem in the plane
- No lattice tiling of \(\mathbb{Z}^n\) by Lee sphere of radius 2
- Sharp \(L^2\) estimates of the Schrödinger maximal function in higher dimensions
- On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres
- The Difference Between Consecutive Primes, II
- Geometric configurations in the ring of integers modulo p^{ell}
- New Bounds and Constructions for Multiply Constant-Weight Codes
- Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
- Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
- Erdös distance problem in vector spaces over finite fields
- On the Hausdorff dimensions of distance sets
- 50 Years of the Golomb--Welch Conjecture
- The analog of the Erdös distance problem in finite fields
- An example related to the Erdos-Falconer question over arbitrary finite fields
- The Erdös–Falconer Distance Problem, Exponential Sums, and Fourier Analytic Approach to Incidence Theorems in Vector Spaces over Finite Fields
- Theoretical Bounds and Constructions of Codes in the Generalized Cayley Metric
- Vinogradov's theorem with almost equal summands
- What is Falconer's Conjecture?
- The Erdős-Ko-Rado theorem for integer sequences
This page was built for publication: Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields