Linear locally recoverable codes with locality r=1
A code is called a locally recoverable code (LRC) with locality r if any symbol of a codeword can be recovered by accessing r other symbols that forms the recovering set. A LRC has availability t if each symbol has at least t disjoint recovering sets. In this thesis, we summarise the known propertie...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/69622 |