Work

On Optimal Locally Repairable Codes with Super-Linear Length

Year: 2018

Type: preprint

Abstract: Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order-optimal when compared with the new upper bounds. The length of the codes is super-linear in the alphabet size.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1812.11942

Authors: Cai, Han, Miao, Ying, Schwartz, Moshe, Tang, Xiaohu

Institutions: Ben-Gurion University of the Negev, University of Tsukuba, Southwest Jiaotong University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2908029873

Cites: 33

Cited by: 1

Related to: 10