The Generalized Covering Radii of Linear Codes

Dor Elimelech, Marcelo Firer, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review

Abstract

Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes-the generalized covering radius. The generalized covering-radius hierarchy of a linear code characterizes the trade-off between storage amount, latency, and access complexity, in such database systems. Several equivalent definitions are provided, showing this as a combinatorial, geometric, and algebraic notion. We derive bounds on the code parameters in relation with the generalized covering radii, study the effect of simple code operations, and describe a connection with generalized Hamming weights.

Original languageEnglish
Pages (from-to)8070-8085
Number of pages16
JournalIEEE Transactions on Information Theory
Volume67
Issue number12
DOIs
StatePublished - 1 Dec 2021

Keywords

  • Linear codes
  • block metric
  • covering radius
  • generalized Hamming weights

Fingerprint

Dive into the research topics of 'The Generalized Covering Radii of Linear Codes'. Together they form a unique fingerprint.

Cite this