New upper bounds and constructions of multi-erasure locally recoverable codes
From MaRDI portal
Publication:6107451
DOI10.1007/s12095-022-00618-yzbMath1530.94057OpenAlexW4311104700MaRDI QIDQ6107451
Huimin Lao, Hao Chen, Fagang Li, Shanxiang Lyu
Publication date: 3 July 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-022-00618-y
Cites Work
- Unnamed Item
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- Integrated interleaved codes as locally recoverable codes: properties and performance
- The non-existence of Griesmer codes with parameters close to codes of Belov type
- Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
- Classification of Griesmer codes and dual transform
- Anticode-based locally repairable codes with high availability
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- On the non-existence of linear codes attaining the Griesmer bound
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- Bounds on the Parameters of Locally Recoverable Codes
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
- Bounds on the Size of Locally Recoverable Codes
- Explicit Maximally Recoverable Codes With Locality
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- A new class of codes meeting the Griesmer bound
- A characterization of codes meeting the Griesmer bound
- New array codes for multiple phased burst correction
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
- Extended Product and Integrated Interleaved Codes
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Long Optimal and Small-Defect LRC Codes With Unbounded Minimum Distances
- New Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes From Their Zeros
- Private Streaming With Convolutional Codes
- Multi-Erasure Locally Recoverable Codes Over Small Fields: A Tensor Product Approach
- Array Codes With Local Properties
- On Optimal Locally Repairable Codes With Super-Linear Length
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
- Constructions of Locally Recoverable Codes Which are Optimal
- Extended Integrated Interleaved Codes Over Any Field With Applications to Locally Recoverable Codes
- Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
- A Bound for the Maximum Weight of a Linear Code
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Locally Recoverable Codes on Algebraic Curves
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
This page was built for publication: New upper bounds and constructions of multi-erasure locally recoverable codes
