On binary locally repairable codes with distance four

DOI10.1016/j.ffa.2020.101793zbMath1467.94053OpenAlexW3119846430MaRDI QIDQ2662041

Yanyan Li

Publication date: 8 April 2021

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

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

zbMATH Keywords

optimal codelocally repairable codeCadambe-Mazumdar boundsingleton-like bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

A characterization of optimal locally repairable codes

Cites Work

• Unnamed Item
• Locality of optimal binary codes
• Binary Linear Locally Repairable Codes
• Bounds on the Size of Locally Recoverable Codes
• Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• On the Locality of Codeword Symbols
• Fundamentals of Error-Correcting Codes
• Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
• Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups
• How Long Can Optimal Locally Repairable Codes Be?
• Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes

This page was built for publication: On binary locally repairable codes with distance four