The Complete Hierarchical Locality of the Punctured Simplex Code

Matthias Grezet*, Camilla Hollanti

*Corresponding author for this work

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

2 Citations (Scopus)
27 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
Title of host publication2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
PublisherIEEE
Pages2833-2837
Number of pages5
ISBN (Electronic)978-1-5386-9291-2
DOIs
Publication statusPublished - 2019
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Paris, France
Duration: 7 Jul 201912 Jul 2019

Publication series

NameIEEE International Symposium on Information Theory
PublisherIEEE
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountryFrance
CityParis
Period07/07/201912/07/2019

Keywords

  • REPAIRABLE CODES

Cite this