The Complete Hierarchical Locality of the Punctured Simplex Code

Loading...
Thumbnail Image
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Date
2019
Major/Subject
Mcode
Degree programme
Language
en
Pages
5
2833-2837
Series
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), IEEE International Symposium on Information Theory
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.
Description
Keywords
REPAIRABLE CODES
Other note
Citation
Grezet , M & Hollanti , C 2019 , The Complete Hierarchical Locality of the Punctured Simplex Code . in 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) . IEEE International Symposium on Information Theory , IEEE , pp. 2833-2837 , IEEE International Symposium on Information Theory , Paris , France , 07/07/2019 . https://doi.org/10.1109/ISIT.2019.8849656