Results 41 to 50 of about 48,367 (290)
Quantum Coding with Low-Depth Random Circuits
Random quantum circuits have played a central role in establishing the computational advantages of near-term quantum computers over their conventional counterparts.
Michael J. Gullans +4 more
doaj +1 more source
Erasure List-Decodable Codes from Random and Algebraic Geometry Codes
Erasure list decoding was introduced to correct a larger number of erasures with output of a list of possible candidates. In the present paper, we consider both random linear codes and algebraic geometry codes for list decoding erasure errors.
Ding, Yang, Jin, Lingfei, Xing, Chaoping
core +1 more source
A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity [PDF]
We present the construction of a new family of erasure correcting codes for distributed storage that yield low repair bandwidth and low repair complexity. The construction is based on two classes of parity symbols.
Amat, Alexandre Graell i +3 more
core +3 more sources
The increasing demand for data storage has prompted the exploration of new techniques, with molecular data storage being a promising alternative. In this work, we develop coding schemes for a new storage paradigm that can be represented as a collection of two-dimensional arrays.
Boaz Moav, Ryan Gabrys, Eitan Yaakobi
openaire +3 more sources
Perfect and Quasi-Perfect Codes for the Bosonic Classical-Quantum Channel
In this article, we explore perfect and quasi-perfect codes for the Bosonic channel, where information is generated by a laser and conveyed in the form of coherent states.
Andreu Blasco Coll, Javier R. Fonollosa
doaj +1 more source
Multi-Error-Correcting Amplitude Damping Codes
We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude damping channel simulate a quantum erasure channel.
Duan, Runyao +3 more
core +1 more source
MDS Array Codes with Optimal Rebuilding [PDF]
MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fraction of the remaining information that needs to be accessed in order to
Bruck, Jehoshua +2 more
core +3 more sources
Codes With Locality for Two Erasures
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. Prakash +3 more
openaire +2 more sources
Bit-Error-Rate Analysis of Raptor Codes over Rician Fading Channels
The bit-error-rate expressions of nonsystematic Raptor (NR) codes and systematic Raptor (SR) codes over Rician fading channels are first derived using a Gaussian approximation (GA) approach.
Jingke Dai
doaj +1 more source
On the Generalized Hamming Weights of (
Locally repairable codes (LRCs) have attracted a lot of interests recently due to their important applications in distributed storage systems. An (n, k, r, δ)-LRC (δ ≥ 2) is an [n, k, d] linear code such that each of the n code ...
Jie Hao, Bin Chen
doaj +1 more source

