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

The MIT Press eBooks

Error-Correcting Codes, 2nd ed

W. W. Peterson

Published Jan 1, 1972• 440 citations
OpenAlex

Related papers

Introduction to Error-Correcting Codes

Discrete mathematics and its applications•Jun 12, 2013•2 citations

Griffiths D.J. Introduction to quantum mechanics 2nd ed. - Solutions (Pearson, 2005)(303s)(2)

Artur Gomes

•Jan 1, 2012•0 citations

Error-correcting codes: an introduction

Sueli I. R. Costa, CÉsar Augusto Watanabe Dainezi

Anais do Congresso de Iniciação Científica da Unicamp•Nov 13, 2015•0 citations

The Effects of Quantum Error Correction on Noisy Systems

Stefanie J. Beale

Full accuracy simulations of quantum systems are very costly, and as a result most studies \nof quantum error correction assume a probabilistic Pauli error model, largely because such \nerrors can be e ciently simulated. Therefore, the behaviour of more general noise in a \nquantum error correcting code is poorly characterized. In this thesis, we present results which \ndemonstrate the scaling of the logical noise with respect to the physical delity, and argue \nthat the e ective logical noise approaches a Pauli channel as the code distance increases, \neven when no recovery operations are applied. As a result, we argue that the average logical \n delity can be used to accurately quantify the e ective logical noise, and to select recovery \noperations appropriate to the system. We further demonstrate that when physical noise \nacts on fewer than d qubits in an [[n; k; d]] code, the resultant noise is Pauli, and develop \na method for approximating the dominant contributions to the e ective logical noise up to \na speci ed precision in terms of the physical in delity. We derive conditions under which \nsets of recovery operations will produce equivalent logical noise channels, with examples of \nequivalencies in the 3 qubit repetition code, the 5 qubit code, the Steane code, and the Shor \ncode. We also provide a general expression for the e ective logical noise when the physical \nqubits undergo depolarizing or Pauli noise in a quantum error correcting code, examine the \nbehaviour of depolarizing noise under concatenation of the 5 qubit and Steane codes, and \npresent an algorithm for soft decoding which is not subject to statistical sampling, with an \nemphasis on the e ective behaviour of a concatenated 5 qubit code undergoing depolarizing \nnoise after applying a specialized version our soft decoding algorithm.

•Aug 23, 2018•0 citations

Dynamically reconfigurable architecture for multi-rate compatible regular LDPC decoding

Akiyuki Nagashima, Yuta Imai, Nozomu Togawa +2 more

Recently a demand for high-speed wireless network service on mobile devices is rapidly increasing. Error correcting codes are used to enhance network communication quality. Particularly, LDPC (low density parity check) codes show high throughput and achieve information rates very close to the Shannon limit. In this paper, we propose a dynamically reconfigurable architecture for multi-rate compatible regular LDPC decoding. Our proposed decoder deals with multi-rate codes by introducing a multi-rate compatible 1st-2nd minimum searching unit. The proposed decoder shows the better throughput over the wide range of S/N ratio compared to conventional rate-fixed LDPC decoders.

IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)•Nov 1, 2008•2 citations

A Short Course on Error Correcting Codes

Neil J.A. Sloane

Springer eBooks•Jan 1, 1975•21 citations
Full accuracy simulations of quantum systems are very costly, and as a result most studies \nof quantum error correction assume a probabilistic Pauli error model, largely because such \nerrors can be e ciently simulated. Therefore, the behaviour of more general noise in a \nquantum error correcting code is poorly characterized. In this thesis, we present results which \ndemonstrate the scaling of the logical noise with respect to the physical delity, and argue \nthat the e ective logical noise approaches a Pauli channel as the code distance increases, \neven when no recovery operations are applied. As a result, we argue that the average logical \n delity can be used to accurately quantify the e ective logical noise, and to select recovery \noperations appropriate to the system. We further demonstrate that when physical noise \nacts on fewer than d qubits in an [[n; k; d]] code, the resultant noise is Pauli, and develop \na method for approximating the dominant contributions to the e ective logical noise up to \na speci ed precision in terms of the physical in delity. We derive conditions under which \nsets of recovery operations will produce equivalent logical noise channels, with examples of \nequivalencies in the 3 qubit repetition code, the 5 qubit code, the Steane code, and the Shor \ncode. We also provide a general expression for the e ective logical noise when the physical \nqubits undergo depolarizing or Pauli noise in a quantum error correcting code, examine the \nbehaviour of depolarizing noise under concatenation of the 5 qubit and Steane codes, and \npresent an algorithm for soft decoding which is not subject to statistical sampling, with an \nemphasis on the e ective behaviour of a concatenated 5 qubit code undergoing depolarizing \nnoise after applying a specialized version our soft decoding algorithm.
Recently a demand for high-speed wireless network service on mobile devices is rapidly increasing. Error correcting codes are used to enhance network communication quality. Particularly, LDPC (low density parity check) codes show high throughput and achieve information rates very close to the Shannon limit. In this paper, we propose a dynamically reconfigurable architecture for multi-rate compatible regular LDPC decoding. Our proposed decoder deals with multi-rate codes by introducing a multi-rate compatible 1st-2nd minimum searching unit. The proposed decoder shows the better throughput over the wide range of S/N ratio compared to conventional rate-fixed LDPC decoders.