Optimal locally repairable codes of distance 3 and 4 via cyclic codes
Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound). In the breakthrough work of Tamo and Barg, several classes of optimal locally repairable codes were constructed via subcodes...
Saved in:
Main Authors: | Luo, Yuan, Xing, Chaoping, Yuan, Chen |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/143233 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
How long can optimal locally repairable codes be?
by: Guruswami, Venkatesan, et al.
Published: (2018) -
All the stabilizer codes of distance 3
by: Yu, S., et al.
Published: (2014) -
New Lower Bounds and Constructions for Binary Codes Correcting Asymmetric Errors
by: Fu, F.-W., et al.
Published: (2014) -
Efficiently list-decodable insertion and deletion codes via concatenation
by: Liu, Shu, et al.
Published: (2022) -
Codes for key generation in quantum cryptography
by: Englert, B.-G., et al.
Published: (2014)