Results 31 to 40 of about 147,259 (119)
Statistical mechanics of error exponents for error-correcting codes
Error exponents characterize the exponential decay, when increasing message length, of the probability of error of many error-correcting codes. To tackle the long standing problem of computing them exactly, we introduce a general, thermodynamic ...
B. Bollobás +18 more
core +2 more sources
On the structure of non-full-rank perfect codes
The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is generalized to the ...
A. V. Los' +12 more
core +1 more source
Quantum Error-Correcting Codes Based on Orthogonal Arrays. [PDF]
Yan R, Pang S, Chen M, Yang F.
europepmc +1 more source
Iterative Optimization of Quantum Error Correcting Codes
We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside
Reimpell, M., Werner, R. F.
core +1 more source
Spin glasses, error correcting codes, and synchronization of human stem cell organoids. [PDF]
Thomson M.
europepmc +1 more source
A Fragile Image Watermarking Scheme in DWT Domain Using Chaotic Sequences and Error-Correcting Codes. [PDF]
Ramos AM +3 more
europepmc +1 more source
Construction of Binary Quantum Error-Correcting Codes from Orthogonal Array. [PDF]
Pang S, Xu H, Chen M.
europepmc +1 more source
Universal Framework for Quantum Error-Correcting Codes. [PDF]
Li Z, Xing L.
europepmc +1 more source
Hidden Hypergraphs, Error-Correcting Codes, and Critical Learning in Hopfield Networks. [PDF]
Hillar C, Chan T, Taubman R, Rolnick D.
europepmc +1 more source
Unordered Error-Correcting Codes and their Applications [PDF]
We give efficient constructions for error correcting unordered {ECU) codes, i.e., codes such that any pair of codewords are at a certain minimal distance apart and at the same time they are unordered.
Blaum, Mario, Bruck, Jehoshua
core

