Papers
Topics
Authors
Recent
2000 character limit reached

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

Published 9 Apr 2025 in math.CO | (2504.07036v1)

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.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up for Free