Optimal LRC codes for all lenghts n

Oleg Kolosov; Alexander Barg; Itzhak Tamo; Gala Yadgar

Optimal LRC codes for all lenghts n

Oleg Kolosov
, Alexander Barg
, Itzhak Tamo
, Gala Yadgar

Computer Science

Technion - Israel Institute of Technology

Research output: Working paper › Preprint

Abstract

A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes.

Original language	English
State	Published - 1 Feb 2018

Keywords

cs.IT
math.IT

Access to Document

1802.00157v1

Cite this

@techreport{e9ab5a5226284478a651be3ea3579663,

title = "Optimal LRC codes for all lenghts n",

abstract = "A family of distance-optimal LRC codes from certain subcodes of \$q\$-ary Reed-Solomon codes, proposed by I.\textasciitilde{}Tamo and A.\textasciitilde{}Barg in 2014, assumes that the code length \$n\$ is a multiple of \$r+1.\$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes.",

keywords = "cs.IT, math.IT",

author = "Oleg Kolosov and Alexander Barg and Itzhak Tamo and Gala Yadgar",

year = "2018",

month = feb,

day = "1",

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

type = "WorkingPaper",

}

TY - UNPB

T1 - Optimal LRC codes for all lenghts n

AU - Kolosov, Oleg

AU - Barg, Alexander

AU - Tamo, Itzhak

AU - Yadgar, Gala

PY - 2018/2/1

Y1 - 2018/2/1

N2 - A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes.

AB - A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes.

KW - cs.IT

KW - math.IT

M3 - نسخة اولية

BT - Optimal LRC codes for all lenghts n

ER -