A construction of maximally recoverable codes

Alexander Barg; Zitan Chen; Itzhak Tamo

doi:10.1007/s10623-022-01020-8

A construction of maximally recoverable codes

Alexander Barg, Zitan Chen, Itzhak Tamo

School of Electrical Engineering

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

We construct a family of linear maximally recoverable codes with locality r and dimension r + 1. For codes of length n with r ≈ n^α, 0 ≤ α ≤ 1 the code alphabet is of the order n^1+3α, which improves upon the previously known constructions of maximally recoverable codes.

Original language	English
Pages (from-to)	939-945
Number of pages	7
Journal	Designs, Codes, and Cryptography
Volume	90
Issue number	4
DOIs	https://doi.org/10.1007/s10623-022-01020-8
State	Published - Apr 2022

Keywords

Codes with local recovery
Distributed storage
Maximally recoverable codes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science Applications
Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1007/s10623-022-01020-8

Cite this

@article{9af064c95ebe4ed887c7e1eb182fc86b,

title = "A construction of maximally recoverable codes",

abstract = "We construct a family of linear maximally recoverable codes with locality r and dimension r + 1. For codes of length n with r ≈ nα, 0 ≤ α ≤ 1 the code alphabet is of the order n1+3α, which improves upon the previously known constructions of maximally recoverable codes.",

keywords = "Codes with local recovery, Distributed storage, Maximally recoverable codes",

author = "Alexander Barg and Zitan Chen and Itzhak Tamo",

note = "Publisher Copyright: {\textcopyright} The Author(s).",

year = "2022",

month = apr,

doi = "10.1007/s10623-022-01020-8",

language = "الإنجليزيّة",

volume = "90",

pages = "939--945",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - A construction of maximally recoverable codes

AU - Barg, Alexander

AU - Chen, Zitan

AU - Tamo, Itzhak

N1 - Publisher Copyright: © The Author(s).

PY - 2022/4

Y1 - 2022/4

N2 - We construct a family of linear maximally recoverable codes with locality r and dimension r + 1. For codes of length n with r ≈ nα, 0 ≤ α ≤ 1 the code alphabet is of the order n1+3α, which improves upon the previously known constructions of maximally recoverable codes.

AB - We construct a family of linear maximally recoverable codes with locality r and dimension r + 1. For codes of length n with r ≈ nα, 0 ≤ α ≤ 1 the code alphabet is of the order n1+3α, which improves upon the previously known constructions of maximally recoverable codes.

KW - Codes with local recovery

KW - Distributed storage

KW - Maximally recoverable codes

UR - http://www.scopus.com/inward/record.url?scp=85124826781&partnerID=8YFLogxK

U2 - 10.1007/s10623-022-01020-8

DO - 10.1007/s10623-022-01020-8

M3 - مقالة

SN - 0925-1022

VL - 90

SP - 939

EP - 945

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 4

ER -

A construction of maximally recoverable codes

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this