Results 21 to 30 of about 459 (161)
ERASER: Practical and Accurate Leakage Suppression for Fault-Tolerant Quantum Computing
<p>Quantum error correction (QEC) codes enable us to toler-<br> ate hardware errors by encoding fault-tolerant logical qubits<br> using redundant physical qubits and detecting errors using<br> parity checks.
Moinuddin Qureshi +2 more
core +3 more sources
How Long Can Optimal Locally Repairable Codes Be? [PDF]
A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbol using only r other codeword symbols. A Singleton-type bound dictates the best possible trade-off between the dimension and distance of LRCs - an LRC ...
Xing, C. (Chaoping) +5 more
core +1 more source
ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
Quantum error correction (QEC) codes can tolerate hardware errors by encoding fault-tolerant logical qubits using redundant physical qubits and detecting errors using parity checks.
Das, Poulami +2 more
core +2 more sources
Improved Maximally Recoverable LRCs using Skew Polynomials
An $(n,r,h,a,q)$-Local Reconstruction Code (LRC) is a linear code over $\mathbb{F}_q$ of length $n$, whose codeword symbols are partitioned into $n/r$ local groups each of size $r$. Each local group satisfies `$a$' local parity checks to recover from `$a$
Gopi, Sivakanth, Guruswami, Venkatesan
core
Construction of Optimal Locally Repairable Codes of Triangular Association Schemes
As a new erasure code for distributed storage systems, locally repairable codes (LRCs) can effectively realize the reliable and efficient storage of massive data.
WANG Jing, LI Jinghui, YANG Jiarong, WANG E
doaj +1 more source
A combination of discrete and finite element method models for the current collector deformation and electrochemical performance analysis, respectively. The models are calibrated and validated with electrochemical and imaging data of hard carbon electrodes. These electrodes were manufactured with different parameters (slurry solid contents of 35 and 40
Soorya Saravanan +12 more
wiley +1 more source
In distributed storage systems, locally repairable codes (LRCs) are designed to reduce disk I/O and repair costs by enabling recovery of each code symbol from a small number of other symbols.
Qiu, Jing, Fu, Fang-Wei
core
Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes [PDF]
We prove that a class of distance-optimal local reconstruction codes (LRCs), an important family of repair-efficient codes for distributed storage systems, achieve the maximum distance separable private information retrieval capacity for the case of ...
Lin, Hsuan-Yin +7 more
core +1 more source
Recent studies have demonstrated that human dental pulp contains adult stem cells. A pulse of the thymidine analog BrdU given to young animals at the optimal time could clarify where slow-cycling long-term label-retaining cells (LRCs), putative adult ...
Hiroko Ida-Yonemochi +17 more
core +2 more sources
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source

