G. Hegedüs

collaborators

2 papers

math.CO2025

Codes with symmetric distances

Gábor Hegedüs, Sho Suda, Ziqing Xiang

For a code $C$ in a space with maximal distance $n$ , we say that $C$ has symmetric distances if its distance set $S (C)$ is symmetric with respect to $n /2$ . In this paper, we prov…

math.CO2020

An upper bound for the size of $s$ -distance sets in real algebraic sets

Gábor Hegedüs, Lajos Rónyai

In a recent paper Petrov and Pohoata developed a new algebraic method which combines the Croot-Lev-Pach Lemma from additive combinatorics and Sylvester's Law of Inertia for real qu…

Codes with symmetric distances

An upper bound for the size of s-distance sets in real algebraic sets

An upper bound for the size of $s$ -distance sets in real algebraic sets