Error-correcting codes provide a technique for enhancing the accuracy of optical matrix-vector multipliers (OMVM's). The effects of signal-independent and signal-dependent noise on the performance of OMVM's that employ error-correcting codes are studied through the use of computer simulations. Noise present in the matrix results in random errors that can be corrected by these codes. Noise present in the vector results in nonrandom errors that are difficult to correct by using random error-correcting codes. The effect of code type is also investigated.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1364/AO.31.005642 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Some New Constructions of -ary Codes for Correcting a Burst of at Most Deletions.
Entropy (Basel)
January 2025
Science, Mathematics and Technology (SMT) Cluster, Singapore University of Technology and Design, Singapore 487372, Singapore.
In this paper, we construct -ary codes for correcting a burst of at most deletions, where t,q≥2 are arbitrarily fixed positive integers. We consider two scenarios of error correction: the classical error correcting codes, which recover each codeword from one read (channel output), and the reconstruction codes, which allow to recover each codeword from multiple channel reads. For the first scenario, our construction has redundancy logn+8loglogn+o(loglogn) bits, encoding complexity O(q7tn(logn)3) and decoding complexity O(nlogn).
View Article and Find Full Text PDFDNA palette code for time-series archival data storage.
Natl Sci Rev
January 2025
Frontiers Science Center for Synthetic Biology and Key Laboratory of Systems Bioengineering (Ministry of Education), School of Chemical Engineering and Technology, Tianjin University, Tianjin 300072, China.
The long-term preservation of large volumes of infrequently accessed cold data poses challenges to the storage community. Deoxyribonucleic acid (DNA) is considered a promising solution due to its inherent physical stability and significant storage density. The information density and decoding sequence coverage are two important metrics that influence the efficiency of DNA data storage.
View Article and Find Full Text PDFQuantum Error-Correcting Codes with a Covariant Encoding.
Phys Rev Lett
December 2024
Inria Paris, Quandela, 7 Rue Léonard de Vinci, 91300 Massy, France.
Given some group G of logical gates, for instance the Clifford group, what are the quantum encodings for which these logical gates can be implemented by simple physical operations, described by some physical representation of G? We study this question by constructing a general form of such encoding maps. For instance, we recover that the ⟦5,1,3⟧ and Steane codes admit transversal implementations of the binary tetrahedral and binary octahedral groups, respectively. For bosonic encodings, we show how to obtain the GKP and cat qudit encodings by considering the appropriate groups, and essentially the simplest physical implementations.
View Article and Find Full Text PDFApproximate Quantum Error Correcting Codes from Conformal Field Theory.
Phys Rev Lett
November 2024
Perimeter Institute for Theoretical Physics, Waterloo, Ontario N2L 2Y5, Canada.
The low-energy subspace of a conformal field theory (CFT) can serve as a quantum error correcting code, with important consequences in holography and quantum gravity. We consider generic (1+1)D CFT codes under extensive local dephasing channels and analyze their error correctability in the thermodynamic limit. We show that (i) there is a finite decoding threshold if and only if the minimal nonzero scaling dimension in the fusion algebra generated by the jump operator of the channel is larger than 1/2 and (ii) the number of protected logical qubits k≥Ω(loglogn), where n is the number of physical qubits.
View Article and Find Full Text PDFCountering adversarial perturbations in graphs using error correcting codes.
Phys Rev E
October 2024
New York University Abu Dhabi, Saadiyat Island, P.O. Box 129188, Abu Dhabi, United Arab Emirates and New York University Tandon School of Engineering, Brooklyn, New York 11201, USA.
We consider the problem of a graph subjected to adversarial perturbations, such as those arising from cyber attacks, where edges are covertly added or removed. The adversarial perturbations occur during the transmission of the graph between a sender and a receiver. To counteract potential perturbations, this study explores a repetition coding scheme with sender-assigned noise and majority voting on the receiver's end to rectify the graph's structure.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!