The Complete Hierarchical Locality of the Punctured Simplex Code
Information Theory
2019-07-04 v2 Combinatorics
math.IT
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.
Keywords
Cite
@article{arxiv.1901.03149,
title = {The Complete Hierarchical Locality of the Punctured Simplex Code},
author = {Matthias Grezet and Camilla Hollanti},
journal= {arXiv preprint arXiv:1901.03149},
year = {2019}
}
Comments
Draft