The Complete Hierarchical Locality of the Punctured Simplex Code
classification
💻 cs.IT
math.COmath.IT
keywords
codeshierarchicallocalitycodecompletelistsimplexalphabet-dependent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.