Random Reed-Solomon Codes are List Recoverable with Optimal List Size

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Doron, Dean, Venkitesh, S.
Format:	Preprint
Published:	2024
Subjects:	Information Theory Computational Complexity Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2404.00206