On the Generalized Covering Radii of Reed-Muller Codes

Dor Elimelech, Hengjia Wei, Moshe Schwartz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study generalized covering radii, a fundamental property of linear codes that characterizes the trade-off between storage, latency, and access in linear data-query protocols such as PIR. We find the exact value of the generalized covering radii of Reed-Muller codes in certain extreme cases, as well as proving lower and upper bounds in various scenarios.

Original languageEnglish
Title of host publication2022 IEEE International Symposium on Information Theory, ISIT 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1749-1754
Number of pages6
ISBN (Electronic)9781665421591
DOIs
StatePublished - 1 Jan 2022
Event2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finland
Duration: 26 Jun 20221 Jul 2022

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2022-June
ISSN (Print)2157-8095

Conference

Conference2022 IEEE International Symposium on Information Theory, ISIT 2022
Country/TerritoryFinland
CityEspoo
Period26/06/221/07/22

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On the Generalized Covering Radii of Reed-Muller Codes'. Together they form a unique fingerprint.

Cite this