The Complete Hierarchical Locality of the Punctured Simplex Code

Grezet, Matthias; Hollanti, Camilla

Aaltodoc
→
6b Artikkelit / Articles from Research information portal
→
[article-cris] Perustieteiden korkeakoulu / SCI
→
View Item

The Complete Hierarchical Locality of the Punctured Simplex Code

Altmetrics



Title:	The Complete Hierarchical Locality of the Punctured Simplex Code
Author(s):	Grezet, Matthias ; Hollanti, Camilla
Date:	2019
Language:	en
Pages:	5 2833-2837
Department:	Department of Mathematics and Systems Analysis
ISBN:	978-1-5386-9291-2
Series:	2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), IEEE International Symposium on Information Theory
ISSN:	2157-8095 2157-8117
DOI-number:	10.1109/ISIT.2019.8849656
Keywords:	REPAIRABLE CODES
» Show full item record
This publication is imported from Aalto University Research information portal: https://research.aalto.fi > View this publication in Research information portal > View/Open full text file from Research information portal
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
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.

Permanent link to this item: http://urn.fi/URN:NBN:fi:aalto-201911156273 Email this Export to RefWorks QR Code Print BibTex Tweet