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:	2021-01
Language:	en
Department:	Department of Mathematics and Systems Analysis
Series:	Designs, Codes, and Cryptography
ISSN:	0925-1022 1573-7586
DOI-number:	10.1007/s10623-020-00810-2
Keywords:	Alphabet-dependent bound, Hierarchical locality, Matroid theory, Simplex code
» 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 > Other link related to publication (Research information portal) > View/Open full text file from Research information portal
Citation: Grezet , M & Hollanti , C 2021 , ' The complete hierarchical locality of the punctured Simplex code ' , Designs, Codes, and Cryptography , vol. 89 , no. 1 , pp. 105-125 . https://doi.org/10.1007/s10623-020-00810-2
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-202010306195 Email this Export to RefWorks QR Code Print BibTex Tweet