Optimal LRC codes for all lenghts n <= q
2018
Online
report
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.
Titel: |
Optimal LRC codes for all lenghts n <= q
|
---|---|
Autor/in / Beteiligte Person: | Kolosov, Oleg ; Barg, Alexander ; Tamo, Itzhak ; Yadgar, Gala |
Link: | |
Veröffentlichung: | 2018 |
Medientyp: | report |
Schlagwort: |
|
Sonstiges: |
|