Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces

2025/04/09 by Sihuang Hu, Hu, Sihuang, Hexiang Huang +3 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Combinatorics #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2504.07036

openalex publication_date 2025/04/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces.

Cited by

• Equality in the linear algebra bound

Related

• Equidistant subspace codes
• An Improved Linear Programming Bound on the Average Distance of a Binary Code
• A new upper bound for codes with a single Hamming distance
• Improved Semidefinite Programming Bound on Sizes of Codes
• New Upper Bounds on A(n,d)