Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Advanced digital and analog error correction codes

Lehigh Preserve

Published Jan 1, 2011• 0 citations
OpenAlex

Related papers

Advanced digital and analog error correction codes

•May 1, 2011•0 citations

On the Height Profile of Analog Error-Correcting Codes

Ron M. Roth, Ziyuan Zhu, Changcheng Yuan +2 more

IEEE Transactions on Information Theory•Jan 1, 2026•0 citations

Considerations for incorporating small logical qubits in digital error correction codes

David Rodríguez Pérez, Eliot Kapit

Bulletin of the American Physical Society•Mar 4, 2020•0 citations

Error-correcting codes for optical matrix processors

Scott A. Ellett

Many disciplines, such as antenna beam-forming and \nadaptive optics, require the ability to perform high \nspeed matrix operations, which often can be reduced to a \nseries of matrix-vector products. Analog optical matrixvector \nprocessors (OMVP's) take advantage of the high \nspeed and parallelism of optics to rapidly compute \nmatrix-vector products. However, OMVP's suffer from a \nlow accuracy which currently hinders their widespread \napplication. Over the past decade, various techniques \nhave been introduced to achieve high accuracy computation \nwith OMVP's. This dissertation studies the application \nof error-correcting codes (ECC's) and the union of ECC's \nwith digital partitioning to achieve high accuracy computation. \nThe ability of ECC's to improve the performance \nof OMVP's is studied through the use of computer simulations. \nThe effect ECC's have on system throughput is \nalso studied. Digital partitioning is a new technique \nfor achieving high accuracy computations on analog \nOMVP's. One potential drawback of digital partitioning \nis its sensitivity to errors. Error-correcting codes can \nenhance the performance of the digital partitioning algorithm \nby reducing this sensitivity to errors. Computer \nsimulation results are presented showing the benefits of \nusing ECC's with digital partitioning. In addition, an \nanalysis of the time requirements for encoding and decoding \nthe ECC's and the effect on system throughput is \npresented.

•Aug 1, 1994•0 citations

Error Correction Code for Future Communication Systems

Takahiko Nakamura, Hideo Yoshida, Takashi Sugihara

IEICE Technical Report; IEICE Tech. Rep.•Aug 10, 2017•0 citations

Classical Error Correcting Codes

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2012•0 citations
Many disciplines, such as antenna beam-forming and \nadaptive optics, require the ability to perform high \nspeed matrix operations, which often can be reduced to a \nseries of matrix-vector products. Analog optical matrixvector \nprocessors (OMVP's) take advantage of the high \nspeed and parallelism of optics to rapidly compute \nmatrix-vector products. However, OMVP's suffer from a \nlow accuracy which currently hinders their widespread \napplication. Over the past decade, various techniques \nhave been introduced to achieve high accuracy computation \nwith OMVP's. This dissertation studies the application \nof error-correcting codes (ECC's) and the union of ECC's \nwith digital partitioning to achieve high accuracy computation. \nThe ability of ECC's to improve the performance \nof OMVP's is studied through the use of computer simulations. \nThe effect ECC's have on system throughput is \nalso studied. Digital partitioning is a new technique \nfor achieving high accuracy computations on analog \nOMVP's. One potential drawback of digital partitioning \nis its sensitivity to errors. Error-correcting codes can \nenhance the performance of the digital partitioning algorithm \nby reducing this sensitivity to errors. Computer \nsimulation results are presented showing the benefits of \nusing ECC's with digital partitioning. In addition, an \nanalysis of the time requirements for encoding and decoding \nthe ECC's and the effect on system throughput is \npresented.