Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes

DOI10.1504/IJICOT.2016.079496zbMath1410.94121arXiv1603.08878MaRDI QIDQ517737

Itzhak Tamo, Alexander Barg, Robert Calderbank, Sreechakra Goparaju

Publication date: 27 March 2017

Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.08878

zbMATH Keywords

irreducible cyclic codescyclic LRC codessubfield subcodeszeros of the code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (8)

Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ A characterization of optimal locally repairable codes ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ RS-like locally recoverable codes with intersecting recovering sets ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ Codes for Distributed Storage ⋮ On the locality of quasi-cyclic codes over finite fields

This page was built for publication: Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes