An upper bound on the size of a code with $s$ distances

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Landjev, Ivan, Vorobev, Konstantin
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Information Theory 05A05, 05A20, 94B25, 94B65
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2503.08948