Optimal locally repairable codes via elliptic curves
Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon...
Saved in:
Main Authors: | Li, Xudong, Ma, Liming, Xing, Chaoping |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/143232 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
What is your birthday elliptic curve?
by: Chan, H.H., et al.
Published: (2014) -
An introduction to cwatsets
by: Atienza, Julian Rizal D. L., et al.
Published: (2009) -
On even tournaments whose automorphism groups contain regular subgroups
by: Torres, Ernesto C., Jr.
Published: (1994) -
Optimal locally repairable codes of distance 3 and 4 via cyclic codes
by: Luo, Yuan, et al.
Published: (2020) -
Action by automorphisms on the dual of a group
by: Prapanpong Pongsriiam
Published: (2008)