From the 1 of 5 linked papers with an AI index.
5 papers
Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions
Yang Li, San Ling, Zhenliang Lu +2
The paper proposes entanglement-assisted quantum locally recoverable codes (EAQLRCs) that relax dual‑containing constraints of standard constructions, provides locality and Singlet…
Improved bounds and optimal constructions of pure quantum locally recoverable codes
Yang Li, Shitao Li, Gaojun Luo +1
By incorporating the concept of locality into quantum information theory, quantum locally recoverable codes (qLRCs) have been proposed, motivated by their potential applications in…
Generalized Repetition Codes and Their Application to HARQ
Chaofeng Guan, Gaojun Luo, Lan Luo +2
The inherent uncertainty of communication channels implies that any coding scheme has a non-zero probability of failing to correct errors, making retransmission mechanisms essentia…
On optimal quantum LRCs from the Hermitian construction and -designs
Yang Li, Shitao Li, Huimin Lao +2
In a recent work, quantum locally recoverable codes (qLRCs) have been introduced for their potential application in large-scale quantum data storage and implication for quantum LDP…
Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration
Chaofeng Guan, Shitao Li, Gaojun Luo +2
The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest err…