Hamming Distances in Vector Spaces over Finite Fields

10/12/2019
by   Esen Aksoy Yazici, et al.
0

Let F_q be the finite field of order q and E⊂F_q^d, where 4|d. Using Fourier analytic techniques, we prove that if |E|>q^d-1/ddd/2d/2d/4, then the points of E determine a Hamming distance r for every even r.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2018

Generalized Hamming weights of projective Reed--Muller-type codes over graphs

Let G be a connected graph and let X be the set of projective points def...
research
06/15/2023

On the k-Hamming and k-Edit Distances

In this paper we consider the weighted k-Hamming and k-Edit distances, t...
research
08/20/2018

Near log-convexity of measured heat in (discrete) time and consequences

Let u,v ∈R^Ω_+ be positive unit vectors and S∈R^Ω×Ω_+ be a symmetric sub...
research
12/16/2022

Antichain Codes

A family of sets A is said to be an antichain if x⊄y for all distinct x,...
research
07/12/2019

Resolvability of Hamming Graphs

A subset of vertices in a graph is called resolving when the geodesic di...
research
10/15/2017

Stable Matchings in Metric Spaces: Modeling Real-World Preferences using Proximity

Suppose each of n men and n women is located at a point in a metric spac...
research
06/27/2022

Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces

We study the maximum cardinality problem of a set of few distances in th...

Please sign up or login with your details

Forgot password? Click here to reset