The complete hierarchical locality of the punctured Simplex code

Matthias Grezet*, Camilla Hollanti

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

41 Downloads (Pure)

Abstract

This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by deleting specific columns from a Simplex code. This list is used to show that these codes are optimal codes with hierarchical locality.

Original languageEnglish
Pages (from-to)105-125
Number of pages21
JournalDesigns, Codes, and Cryptography
Volume89
Issue number1
Early online date2020
DOIs
Publication statusPublished - Jan 2021
MoE publication typeA1 Journal article-refereed

Keywords

  • Alphabet-dependent bound
  • Hierarchical locality
  • Matroid theory
  • Simplex code

Fingerprint Dive into the research topics of 'The complete hierarchical locality of the punctured Simplex code'. Together they form a unique fingerprint.

Cite this