An upper bound on the size of a code with s distances
Abstract
Let C be a binary code of length n with distances 0<d1<·s<ds n. In this note we prove a general upper bound on the size of C without any restriction on the distances di. The bound is asymptotically optimal.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.