Locality of optimal binary codes

DOI10.1016/j.ffa.2017.08.013zbMath1398.94214OpenAlexW2751464272WikidataQ57968721 ScholiaQ57968721MaRDI QIDQ2406696

Yanyan Li

Publication date: 5 October 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2017.08.013

zbMATH Keywords

optimal codelocally repairable coderepair localityMacDonald code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (4)

On binary locally repairable codes with distance four ⋮ An infinite family of Griesmer quasi-cyclic self-orthogonal codes ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups

Cites Work

• Binary Linear Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• On the Locality of Codeword Symbols
• Design Methods for Maximum Minimum-Distance Error-Correcting Codes
• A note on the Griesmer bound (Corresp.)

This page was built for publication: Locality of optimal binary codes