The complete hierarchical locality of the punctured Simplex code-Reference-Cited by-同舟云学术

The complete hierarchical locality of the punctured Simplex code

Published:2020-10-16 Issue:1 Volume:89 Page:105-125
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Grezet Matthias^ORCID,Hollanti Camilla^ORCID

Abstract

AbstractThis 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.

Funder

Academy of Finland

Seventh Framework Programme

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10623-020-00810-2.pdf

Reference20 articles.

1. Agarwal A., Barg A., Hu S., Mazumdar A., Tamo I.: Combinatorial alphabet-dependent bounds for locally recoverable codes. IEEE Trans. Inf. Theory 64, 3481–3492 (2018).

2. Ballentine S., Barg A., Vladuts S.: Codes with hierarchical locality from covering maps of curves. arXiv preprint. arXiv:1807.05473 (2018).

3. Cadambe V., Mazumdar A.: An upper bound on the size of locally recoverable codes. In: International Symposium on Network Coding, pp. 1–5 (2013).

4. Farrell P.: Linear binary anticodes. Electron. Lett. 6(13), 419–421 (1970).

5. Freij-Hollanti R., Hollanti C., Westerbäck T.: Matroid theory and storage codes: bounds and constructions. In: Network Coding and Subspace Designs, pp. 385–425. Springer (2018).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The minimum locality of linear codes;Designs, Codes and Cryptography;2022-08-24