Name | Realization(s) |
---|---|

Alamouti code | Wireless standards since: 3G, LTE, LTE-Advanced, and 5G.WiFi standards: 802.11n, 802.11ad, 802.11ay, etc. |

Bacon-Shor code | Trapped-ion qubits: state preparation, logical measurement, and stabilizer measurement for nine-qubit Bacon-Shor code demonstrated on a 13-qubit device by M. Cetina and C. Monroe groups [1]. |

Balanced code | Balanced length-eight code, known as a 6b/8b encoding, used for balancing direct current in a communications system [2] |

Binary BCH code | Satellite communication [3] |

Binomial code | Microwave cavities coupled to superconducting circuits: state transfer between a binomial codeword to another system [4], error-correction protocol nearly reaching break-even [5], and a teleported CNOT gate [6]. |

Bose–Chaudhuri–Hocquenghem (BCH) code | DVDs, disk drives, and two-dimensional bar codes [7]. |

Calderbank-Shor-Steane (CSS) stabilizer code | Fully homomorphic encryption [8].Entanglement purification protocols related to quantum key distribution (QKD) [9]. |

Cat code | Two-legged (\(S=0\)) Lindbladian-based [10][11] and Hamiltonian-based 'Kerr-cat' encoding [12] has been achieved in superconducting circuit devices by the Devoret group; Ref. [11] also demonstrated a displacement-based gate. The Lindbladian-based scheme has further achieved a suppression of bit-flip errors that is exponential in the average photon number [13] up to a bit-flip time of 1ms. A bit-flip time of 1s has been achieved in a similar system in the classical bit regime [14].Four-legged (\(S=1\)) cat code has been realized in a superconducting circuit device [15]. This paper is the first to reach break-even error-correction, where the lifetime of a logical qubit is on par with the lifetime of the noisiest constituent of the system.Approximate version of the \(S=0\) code realized in a superconducting circuit device by the Wang group [16]. |

Classical Goppa code | Initial version of the McEliece public-key cryptosystem [17][18] and its variation by Niederreiter [19] where the generator matrix is replaced by the parity check matrix. Some of these were proven to be insecure since the public key exposes algebraic structure of code [20]. |

Constant-weight code | Radio-network frequency hopping [21]. |

Convolutional code | A type of convolutional code used in Real-time Application networks [22].Mobile and radio communications (3G networks) use convolutional codes concatenated with Reed-Solomon codes to obtain suitable performance [23].A convolutional code with rate 1/2 was used for deep-space and satellite communication [24] |

Covering code | Data compression both with or without compression [25].Football-pool problem: finding the smallest number of bets on a set of matches needed to guarantee at least one bet has at most \(\rho\) errors [26][27]. |

Five-qubit perfect code | NMR: Implementation of perfect error correcting code on 5 spin subsystem of labeled crotonic acid for quantum network benchmarking [28]. Single-qubit logical gates [29].Superconducting qubits [30].Trapped-ion qubits: non-transversal CNOT gate between two logical qubits, including rounds of correction and fault-tolerant primitives such as flag qubits and pieceable fault tolerance, on a 12-qubit device by Quantinuum [31].Nitrogen-vacancy centers in diamond: fault-tolerant single-qubit Clifford operations [32]. |

Fountain code | Designed for servers sending data to many recipients, such as during broadcasting or file distribution [33][34]. |

Gabidulin code | Public-key cryptosystems [35].Digital watermarking. The Gabidulin code provides efficient correction against luminance tampering and image-slicing distortion due to the consistency of the rank against alterations such as column swapping [36]. |

Generalized RS (GRS) code | Commonly used in mass storage systems such as CDs, DVDs, QR codes etc.Various cloud storage systems [37].Public-key cryptosystems generalizing those that used Goppa codes [17][18][19], some of which were proven to be insecure [20]. More recent works focus on methods to mask the algebraic structure using subcodes of GRS codes [35]. For example, a key-recovery attack was developed in Ref. [38] for a variant of masking method proposed in Ref. [39]. |

Golay code | Used in the Voyager 1 and 2 spacecraft [40].Radio communications [41]. |

Gottesman-Kitaev-Preskill (GKP) code | Motional degree of freedom of a trapped ion: GKP encoding realized with the help of post-selection [42][43], followed by realization of reduced form of GKP error correction, where displacement error syndromes are measured to one bit of precision using an ion electronic state [44].Microwave cavity coupled to superconducting circuits: reduced form of GKP error correction, where displacement error syndromes are measured to one bit of precision using an ancillary transmon [45].In signal processing, where the conjugate variables are time and frequency instead of position and momentum, GKP state position-state wavefunctions correspond to Dirac combs [46]. |

Hamming code | Commonly used when error rates are very low, for example, computer RAM or integrated circuits [47].Hamming-code based matrix embedding used in steganography [48][49]. |

Heavy-hexagon code | Logical state preparation and flag-qubit error correction realized in superconducting-circuit devices (specifically, fixed-frequency transmon qubit architectures) by IBM for \(d=2\) [50][51] and \(d=3\) [52]. |

Interleaved RS (IRS) code | The cross-interleaved RS (CIRC), an IRS code using two shortened RS codes and two forms of interleaving, was used for compact discs (CDs) [53] (see Ref. [54], Sec. 5.6 and Ref. [55], Ch. 4). |

Justesen code | Generating small-bias sample spaces, i.e., probability distributions that parity functions cannot typically distinguish from the uniform distribution [56]. |

Kitaev surface code | One cycle of syndrome readout on 19-qubit planar and 24-qubit toric codes realized in two-dimensional Rydberg atomic arrays [57]. Signatures of corresponding topological phase of matter detected in superconducting circuits [58] and two-dimensional Rydberg atomic arrays [59]. |

Lloyd-Slotine nine-mode code | Optical network by the Furusawa group [60]. |

Locally recoverable code (LRC) | An \((18,14,7)\) LRC code has beed used in the Windows Azure cloud storage system [61]; see also Sec. 31.3.1.2 in Ref. [62]. |

Low-density parity-check (LDPC) code | 5G NR cellular communication for the traffic channel [63].WiMAX (IEEE 802.16e) [64].Satellite transmission of digital television [65]. |

Maximum distance separable (MDS) code | The McEliece Public Key Cryptosystem [66] uses algebraic coding theory to secure communications against eavesdropping attack, in which private keys are generator matrices of linear codes, i.e., \(G\). Public Keys shared to outside world are scrambled and permutated versions of \(G\), i.e., \(G^\prime=SGP\). Data to be encrypted, \(u\), is multiplied by public key and added intentional errors \(e\), i.e., \(x=uG^\prime+e\). Upon receiving encrypted data, private key owner can apply inverse permutation \(P^{-1}\) to \(x\), decode the scrambled message given the presence of \(e\) errors, and finally unscramble to obtain \(u\). Security parameters of the system are \(n\) and \(e\), hence MDS codes, such as GRS codes may provide the same security level for shorter key sizes, and the private key owner can decode arguably fast enough using known decoding algorithms.Automatic repeat request (ARQ) data transmission protocols ([55], Ch. 7). |

Maximum-rank distance (MRD) code | Useful for error and erasure correction in network coding [67][68]. |

Monitored random-circuit code | Measurement induced quantum phases have been realized in a trapped-ion processor [69]. |

Niset-Andersen-Cerf code | Realized in Ref. [70] in an optical system with 3 beam-splitters. The fidelity peaked around \(0.6\) for deterministic approach, and around \(0.77\) for the probabilistic approach (with a 25% chance of error). |

One-hot code | The bi-quinary code, a combination of one-hot 1-in-2 and 1-in-5 one-hot codes to encode decimal digits, was used in several early computers ([71], Ch. 27).Marking the state of a finite automaton [72].Used in machine-learning based classification tasks because one-hot encodings, as opposed to integer encodings, do not presume an order [73]. |

Pair-cat code | Microwave cavities coupled to superconducting circuits by the Wang group [74]. |

Parity-check code | Can be realized on almost every communication device. Parity-check codes are some of the earlier error-correcting codes ([71], Ch. 27). |

Polar code | Code control channels for the 5G NR (New Radio) interfaces [75]. |

Quantum Tanner code | Used to obtain explicit lower bounds in the sum-of-squares game [76].States that, on average, achieve small violations of check operators for quantum Tanner codes require a circuit of non-constant depth to make. They are used in the proof [77] of the No low-energy trivial states (NLTS) conjecture [78]. |

Quantum parity code (QPC) | The \([[m^2,1,m]]\) codes for \(m\leq 7\) have been realized in trapped-ion quantum devices [79]. |

Quantum repetition code | NMR: 3-qubit phase-flip code [80][81], with up to two rounds of error correction in liquid-state NMR [82].Superconducting circuits: 3-qubit phase-flip and bit-flip code by Schoelkopf group [83]; 3-qubit bit-flip code [84]; 3-qubit phase-flip code up to 3 cycles of error correction [85]; IBM 15-qubit device [86]; IBM Rochester device using 43-qubit code [87]; Google system performing up to 8 error-correction cycles on 5 and 9 qubits [88]; Google Quantum AI Sycamore utilizing up to 11 physical qubits and running 50 correction rounds [89]; Google Quantum AI Sycamore utilizing up to 25 qubits for comparison of logical error scaling with a quantum code [90]. Continuous error correction protocols have been implemented on a 3-qubit device [91].Semiconductor spin-qubit devices: 3-qubit devices at RIKEN [92] and Delft [93].Nitrogen-vacancy centers in diamond: 3-qubit phase-flip code [94][95] (see also Ref. [96]).Trapped-ion device: 3-qubit phase-flip algorithm implemented in 3 cycles on high fidelity gate operations [97]. |

Random code | Distributed storage systems [98]. |

Rank-modulation code | Electronic devices where charges can either increase in an individual cell or decrease in a block of adjacent cells, e.g., flash memories [99]. |

Raptor (RAPid TORnado) code | Two versions of Raptor codes have been standardized by IETF: R10 and the more recent RaptorQ. RaptorQ is used in mobile multimedia broadcasts as specified in ETSI technical specifications. It is also used in the mobile Next Gen TV standard.Raptor codes are useful in scenarios where erasure (i.e. weak signal or noisy channel) is common, such as in military or disaster scenarios. |

Reed-Muller (RM) code | Deep-space communication, including the Mariner 9 spacecraft [100][101]. |

Reed-Solomon (RS) code | RS Product Code (RSPC) was used in DVDs (see Ref. [55], Ch. 4).DSL technologies and their variants against impluse noise [102].Cryptographic primitives based on the hardness of decoding RS codes for more than \(1-\sqrt{k/n}+\epsilon\) errors. This is equivalent to the polynomial reconstruction problem [103].RS codes as outer codes concatenated with convolutional codes are used indirectly in space exploration programs such as Voyager and Galileo. RS codes were part of a temetry channel coding standard issued by the Consultative Committee for Space Data Systems (see Ref. [55], Ch. 3).The ubiquity of RS codes has yielded off-the-shelf VLSI intergrated-circuit decoding hardware [104] (see also Ref. [55], Ch. 5 and 10).Automatic repeat request (ARQ) data transmission protocols (see Ref. [55], Ch. 7).Slow-frequency-hop spread-spectrum transmission (see Ref. [55], Chs. 8-9).Coded sharding designs in blockchains to increase efficiency [105].Private Information Retrieval [106].Used in QR-Codes to retrieve damaged barcodes [107].Wireless communication systems such as 3G, DVB, and WiMAX [108].Correcting pooled testing results for SARS-CoV-2 [109]. |

Repetition code | Repetition codes, in conjunction with other codes, were used in magnetic disks [110]. |

Residue AG code | Improvements over the McEliece public-key cryptosystem to linear AG codes on curves of arbitrary genus [111]. Only the subfield subcode proposal remains resilient to attacks ([62], Sec. 15.7.5.3).Algebraic secret-sharing schemes [112]. |

Shor \([[9,1,3]]\) code | Trapped-ion qubits: state preparation with 98.8(1)% and 98.5(1)% fidelity for state \(|\overline{0}\rangle\) and \(|\overline{1}\rangle\), respectively, by N. Linke group [79]. Variants of the code to handle coherent noise studied and realized by K. Brown and C. Monroe groups [113].Optical systems: quantum teleportation of information implemented by J.-W. Pan group on maximally entangled pair of one physical and one logical qubit with fidelity rate of up to 78.6% [114]. All-photonic quantum repeater architecture tested on the same code [115]. |

Skew-cyclic code | Not directly implemented, but BCH codes form a subclass, and are used in DVD, solid state drive storage, etc. |

Spacetime block code (STBC) | High data-rate wireless communication, e.g., WiMAX (IEEE 802.16m) [116][117][118]. |

Steane \([[7,1,3]]\) code | Trapped-ion qubits: seven-qubit device in Blatt group [119], ten-qubit QCCD device by Quantinuum [120] (see APS Physics Synopsys [121]). Fault-tolerant universal two-qubit gate set by Monz group [122]. Logical CNOT gate between two logical qubits, including rounds of correction and fault-tolerant primitives such as flag qubits and pieceable fault tolerance, on a 20-qubit device by Quantinuum [31]; logical fidelity interval of the combined preparation-CNOT-measurement procedure was higher than that of the unencoded physical qubits.Rydberg atom arrays: Lukin group [57]. |

Surface-17 code | Implemented at ETH Zurich by the Wallraff group [123] and on the Zuchongzhi 2.1 superconducting quantum processor [124]. Both experimental error rates are above the pseudothreshold for this code relative to a single qubit. See Physics viewpoint for a summary [125]. |

Tensor-product code | Construction can be used in magnetic recording by taking the tensor product of a Reed-Solomon code and a parity-check code [126]. |

Ternary Golay Code | Code used in football pools with at least one good bet [127][27]. In fact, the code was originally constructed by Juhani Virtakallio and published in the Finnish football pool magazine Veikkaaja [27][128]. |

Weight-two code | Two-in-five, also known as the two-out-of-five code, was used in the United States Postal Service's POSTNET barcode system as well as the Postal Alpha-numeric Encoding Technique (PLANET).Two-in-five code forms the numerical part of the Code 39 barcode encoding.Two-in-five code was used on early IBM computers [129][128]. |

XZZX surface code | Distance-five 25-qubit code implemented on a superconducting quantum processor by Google Quantum AI [90]. This code outperformed the average of several instances of the smaller distance-three 9-qubit \(XZZX\) variant of the surface-17 code realized on the same device, both in terms of logical error probability over 25 cycles and in terms of logical error per cycle. This increase in error-correcting capabilities while using more physical qubits supports the notion of an error threshold. |

Zetterberg code | Code used to provide better protection of data transmission with its double error correcting capacity [130]. |

\([[4,2,2]]\) CSS code | \([[4,1,2]]\) subcode implemented using four-qubit graph state of photons [131]. Trapped-ion device by IonQ [132].Logical state preparation and flag-qubit error correction realized in superconducting-circuit devices by IBM [50][51].The subcode \(\{|\overline{00}\rangle,|\overline{10}\rangle\}\) [133] and \(\{|\overline{00}\rangle,|\overline{01}\rangle\}\) [89], treated as a planar surface code, has been realized in superconducting-circuit devices.Logical gates between two copies of the subcode \(\{|\overline{10}\rangle,|\overline{11}\rangle\}\), interpreted as lattice surgery between planar surface codes, realized in superconducting circuits [134].Logical gates for the \(\{|\overline{00}\rangle,|\overline{11}\rangle\}\) subcode, treated as a planar code, realized in superconducting circuits [135]. |

## References

- [1]
- Laird Egan et al., “Fault-Tolerant Operation of a Quantum Error-Correction Code”. 2009.11482
- [2]
- K. A. S. Immink. Codes for mass data storage systems. Shannon Foundation Publisher, 2004.
- [3]
- Cheung, K-M., and F. Pollara. "Phobos lander coding system: Software and analysis." The Telecommunications and Data Acquisition Report (1988).
- [4]
- C. J. Axline et al., “On-demand quantum state transfer and entanglement between remote microwave cavity memories”, Nature Physics 14, 705 (2018). DOI; 1712.05832
- [5]
- L. Hu et al., “Quantum error correction and universal gate set operation on a binomial bosonic logical qubit”, Nature Physics 15, 503 (2019). DOI; 1805.09072
- [6]
- Y. Xu et al., “Demonstration of Controlled-Phase Gates between Two Error-Correctable Photonic Qubits”, Physical Review Letters 124, (2020). DOI; 1810.04690
- [7]
- S. Zhu, Z. Sun, and X. Kai, “A Class of Narrow-Sense BCH Codes”, IEEE Transactions on Information Theory 65, 4699 (2019). DOI
- [8]
- G. Alagic et al., “Quantum Fully Homomorphic Encryption with Verification”, Advances in Cryptology – ASIACRYPT 2017 438 (2017). DOI; 1708.09156
- [9]
- P. W. Shor and J. Preskill, “Simple Proof of Security of the BB84 Quantum Key Distribution Protocol”, Physical Review Letters 85, 441 (2000). DOI; quant-ph/0003004
- [10]
- Z. Leghtas et al., “Confining the state of light to a quantum manifold by engineered two-photon loss”, Science 347, 853 (2015). DOI; 1412.4633
- [11]
- S. Touzard et al., “Coherent Oscillations inside a Quantum Manifold Stabilized by Dissipation”, Physical Review X 8, (2018). DOI; 1705.02401
- [12]
- A. Grimm et al., “Stabilization and operation of a Kerr-cat qubit”, Nature 584, 205 (2020). DOI; 1907.12131
- [13]
- R. Lescanne et al., “Exponential suppression of bit-flips in a qubit encoded in an oscillator”, Nature Physics 16, 509 (2020). DOI; 1907.11729
- [14]
- C. Berdou et al., “One hundred second bit-flip time in a two-photon dissipative oscillator”. 2204.09128
- [15]
- Nissim Ofek et al., “Demonstrating Quantum Error Correction that Extends the Lifetime of Quantum Information”. 1602.04768
- [16]
- J. M. Gertler et al., “Protecting a bosonic qubit with autonomous quantum error correction”, Nature 590, 243 (2021). DOI; 2004.09322
- [17]
- R. J. McEliece, A public-key cryptosystem based on algebraic coding theory, Technical report, Jet Propulsion Lab. DSN Progress Report (1978).
- [18]
- H. Janwa and O. Moreno, “McEliece public key cryptosystems using algebraic-geometric codes”, Designs, Codes and Cryptography 8, (1996). DOI
- [19]
- H. Niederreiter (1986). Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory. Problemy Upravlenija I Teorii Informacii. 15: 159–166.
- [20]
- V. M. SIDELNIKOV and S. O. SHESTAKOV, “On insecurity of cryptosystems based on generalized Reed-Solomon codes”, Discrete Mathematics and Applications 2, (1992). DOI
- [21]
- D. H. Smith, L. A. Hughes, and S. Perkins, “A New Table of Constant Weight Codes of Length Greater than 28”, The Electronic Journal of Combinatorics 13, (2006). DOI
- [22]
- S. I. Mrutu, A. Sam, and N. H. Mvungi, “Forward Error Correction Convolutional Codes for RTAs' Networks: An Overview”, International Journal of Computer Network and Information Security 6, 19 (2014). DOI
- [23]
- T. Halonen, J. Romero, and J. Melero, editors , GSM, GPRS and EDGE Performance (Wiley, 2003). DOI
- [24]
- Butman, Deutsch, and Miller. Performance of concatenated codes for deep space missions. 1981.
- [25]
- G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes, Elsevier (1997).
- [26]
- H. Hamalainen et al., “Football Pools--A Game for Mathematicians”, The American Mathematical Monthly 102, 579 (1995). DOI
- [27]
- A. Barg, “At the Dawn of the Theory of Codes”, The Mathematical Intelligencer 15, 20 (1993). DOI
- [28]
- E. Knill et al., “Benchmarking Quantum Computers: The Five-Qubit Error Correcting Code”, Physical Review Letters 86, 5811 (2001). DOI; quant-ph/0101034
- [29]
- J. Zhang, R. Laflamme, and D. Suter, “Experimental Implementation of Encoded Logical Qubit Operations in a Perfect Quantum Error Correcting Code”, Physical Review Letters 109, (2012). DOI; 1208.4797
- [30]
- M. Gong et al., “Experimental exploration of five-qubit quantum error-correcting code with superconducting qubits”, National Science Review 9, (2021). DOI; 1907.04507
- [31]
- C. Ryan-Anderson et al., “Implementing Fault-tolerant Entangling Gates on the Five-qubit Code and the Color Code”. 2208.01863
- [32]
- M. H. Abobeih et al., “Fault-tolerant operation of a logical qubit in a diamond quantum processor”, Nature 606, 884 (2022). DOI; 2108.01646
- [33]
- A. Shokrollahi, “Raptor codes”, IEEE Transactions on Information Theory 52, 2551 (2006). DOI
- [34]
- E. Baik, A. Pande, and P. Mohapatra, “Cross-layer coordination for efficient contents delivery in LTE eMBMS traffic”, 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS 2012) (2012). DOI
- [35]
- T. P. Berger and P. Loidreau, “How to Mask the Structure of Codes for a Cryptographic Use”, Designs, Codes and Cryptography 35, 63 (2005). DOI
- [36]
- P. Lefevre, P. Carre, and P. Gaborit, “Watermarking and Rank Metric Codes”, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2018). DOI
- [37]
- H. Dau et al., “Repairing Reed-Solomon Codes With Multiple Erasures”, IEEE Transactions on Information Theory 64, 6567 (2018). DOI; 1612.01361
- [38]
- Alain Couvreur et al., “Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes”. 1307.6458
- [39]
- Marco Baldi et al., “Enhanced public key security for the McEliece cryptosystem”. 1108.2462
- [40]
- E. C. Stone, “The Voyager 2 encounter with Uranus”, Journal of Geophysical Research: Space Physics 92, 14873 (1987). DOI
- [41]
- E. E. Johnson. An Efficient Golay Codec For MIL-STD-188-141A and FED-STD-1045. Department of Electrical and Computer Engineering, New Mexico State University, 1991.
- [42]
- C. Flühmann et al., “Encoding a qubit in a trapped-ion mechanical oscillator”, Nature 566, 513 (2019). DOI; 1807.01033
- [43]
- C. Flühmann and J. P. Home, “Direct Characteristic-Function Tomography of Quantum States of the Trapped-Ion Motional Oscillator”, Physical Review Letters 125, (2020). DOI; 1907.06478
- [44]
- Brennan de Neeve et al., “Error correction of a logical grid state qubit by dissipative pumping”. 2010.09681
- [45]
- P. Campagne-Ibarcq et al., “Quantum error correction of a qubit encoded in grid states of an oscillator”. 1907.12487
- [46]
- H. G. Feichtinger and T. Strohmer, editors , Gabor Analysis and Algorithms (Birkhäuser Boston, 1998). DOI
- [47]
- R. Hentschke et al., “Analyzing area and performance penalty of protecting different digital modules with Hamming code and triple modular redundancy”, Proceedings. 15th Symposium on Integrated Circuits and Systems Design. DOI
- [48]
- Crandall, Ron. "Some notes on steganography." Posted on steganography mailing list 1998 (1998): 1-6.
- [49]
- A. Westfeld, “F5—A Steganographic Algorithm”, Information Hiding 289 (2001). DOI
- [50]
- M. Takita et al., “Experimental Demonstration of Fault-Tolerant State Preparation with Superconducting Qubits”, Physical Review Letters 119, (2017). DOI; 1705.09259
- [51]
- E. H. Chen et al., “Calibrated Decoders for Experimental Quantum Error Correction”, Physical Review Letters 128, (2022). DOI; 2110.04285
- [52]
- Neereja Sundaresan et al., “Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment”. 2203.07205
- [53]
- Odaka K., Sako Y., Iwamoto I., Doi T.; Vries L.B.; SONY: Error correctable data transmission method (Patent US4413340) filing date May 21, 1980.
- [54]
- W. C. Huffman and V. Pless, Fundamentals of Error-correcting Codes (Cambridge University Press, 2003). DOI
- [55]
- S. B. Wicker and V. K. Bhargava, Reed-solomon Codes and Their Applications (IEEE, 1999). DOI
- [56]
- J. Naor and M. Naor, “Small-bias probability spaces: efficient constructions and applications”, Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 (1990). DOI
- [57]
- D. Bluvstein et al., “A quantum processor based on coherent transport of entangled atom arrays”, Nature 604, 451 (2022). DOI; 2112.03923
- [58]
- K. J. Satzinger et al., “Realizing topologically ordered states on a quantum processor”, Science 374, 1237 (2021). DOI; 2104.01180
- [59]
- G. Semeghini et al., “Probing topological spin liquids on a programmable quantum simulator”, Science 374, 1242 (2021). DOI; 2104.04119
- [60]
- Takao Aoki et al., “Quantum error correction beyond qubits”. 0811.3734
- [61]
- C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin. Erasure coding in Windows Azure Storage. In Proc. USENIX Annual Technical Conference (ATC), pgs. 15-26, Boston, Massachusetts, June 2012.
- [62]
- W. C. Huffman, J.-L. Kim, and P. Solé, Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021). DOI
- [63]
- M. V. Patil, S. Pawar, and Z. Saquib, “Coding Techniques for 5G Networks: A Review”, 2020 3rd International Conference on Communication System, Computing and IT Applications (CSCITA) (2020). DOI
- [64]
- LDPC coding for OFDMA PHY. 802.16REVe Sponsor Ballot Recirculation comment, July 2004. IEEE C802.16e04/141r2
- [65]
- R. Purnamasari, H. Wijanto, and I. Hidayat, “Design and implementation of LDPC(Low Density Parity Check) coding technique on FPGA (Field Programmable Gate Array) for DVB-S2 (Digital Video Broadcasting-Satellite)”, 2014 IEEE International Conference on Aerospace Electronics and Remote Sensing Technology (2014). DOI
- [66]
- McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report pp. 114–116 (1978).
- [67]
- Ralf Koetter and Frank Kschischang, “Coding for Errors and Erasures in Random Network Coding”. cs/0703061
- [68]
- D. Silva, F. R. Kschischang, and R. Koetter, “A Rank-Metric Approach to Error Control in Random Network Coding”, IEEE Transactions on Information Theory 54, 3951 (2008). DOI; 0711.0708
- [69]
- C. Noel et al., “Measurement-induced quantum phases realized in a trapped-ion quantum computer”, Nature Physics 18, 760 (2022). DOI; 2106.05881
- [70]
- M. Lassen et al., “Quantum optical coherence can survive photon losses using a continuous-variable quantum erasure-correcting code”, Nature Photonics 4, 700 (2010). DOI
- [71]
- Encyclopedia of Computer Science and Technology, Second Edition Volume I (CRC Press, 2017). DOI
- [72]
- S. Devadas and A. R. Newton, “Decomposition and factorization of sequential finite state machines”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 8, 1206 (1989). DOI
- [73]
- K. Potdar, T. S., and C. D., “A Comparative Study of Categorical Variable Encoding Techniques for Neural Network Classifiers”, International Journal of Computer Applications 175, 7 (2017). DOI
- [74]
- Jeffrey M. Gertler et al., “Experimental Realization and Characterization of Stabilized Pair Coherent States”. 2209.11643
- [75]
- 3rd Generation Partnership Project (3GPP), Technical specification group radio access network, 3GPP TS 38.212 V.15.0.0, 2017.
- [76]
- Max Hopkins and Ting-Chun Lin, “Explicit Lower Bounds Against $Ω(n)$-Rounds of Sum-of-Squares”. 2204.11469
- [77]
- Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe, “NLTS Hamiltonians from good quantum codes”. 2206.13228
- [78]
- M. H. Freedman and M. B. Hastings, “Quantum Systems on Non-$k$-Hyperfinite Complexes: A Generalization of Classical Statistical Mechanics on Expander Graphs”. 1301.1363
- [79]
- N. H. Nguyen et al., “Demonstration of Shor Encoding on a Trapped-Ion Quantum Computer”, Physical Review Applied 16, (2021). DOI; 2104.01205
- [80]
- D. G. Cory et al., “Experimental Quantum Error Correction”, Physical Review Letters 81, 2152 (1998). DOI; quant-ph/9802018
- [81]
- O. Moussa et al., “Demonstration of Sufficient Control for Two Rounds of Quantum Error Correction in a Solid State Ensemble Quantum Information Processor”, Physical Review Letters 107, (2011). DOI; 1108.4842
- [82]
- J. Zhang et al., “Experimental quantum error correction with high fidelity”, Physical Review A 84, (2011). DOI; 1109.4821
- [83]
- M. D. Reed et al., “Realization of three-qubit quantum error correction with superconducting circuits”, Nature 482, 382 (2012). DOI; 1109.4948
- [84]
- D. Ristè et al., “Detecting bit-flip errors in a logical qubit using stabilizer measurements”, Nature Communications 6, (2015). DOI; 1411.5542
- [85]
- J. Cramer et al., “Repeated quantum error correction on a continuously encoded qubit by real-time feedback”, Nature Communications 7, (2016). DOI; 1508.01388
- [86]
- J. R. Wootton and D. Loss, “Repetition code of 15 qubits”, Physical Review A 97, (2018). DOI; 1709.00990
- [87]
- J. R. Wootton, “Benchmarking near-term devices with quantum error correction”, Quantum Science and Technology 5, 044004 (2020). DOI; 2004.11037
- [88]
- J. Kelly et al., “State preservation by repetitive error detection in a superconducting quantum circuit”, Nature 519, 66 (2015). DOI; 1411.7403
- [89]
- Google Quantum AI et al., “Exponential suppression of bit or phase errors with cyclic error correction”, Nature 595, 383 (2021). DOI; 2102.06132
- [90]
- Rajeev Acharya et al., “Suppressing quantum errors by scaling a surface code logical qubit”. 2207.06431
- [91]
- W. P. Livingston et al., “Experimental demonstration of continuous quantum error correction”, Nature Communications 13, (2022). DOI; 2107.11398
- [92]
- K. Takeda et al., “Quantum error correction with silicon spin qubits”, Nature 608, 682 (2022). DOI; 2201.08581
- [93]
- F. van Riggelen et al., “Phase flip code with semiconductor spin qubits”. 2202.11530
- [94]
- G. Waldherr et al., “Quantum error correction in a solid-state hybrid spin register”, Nature 506, 204 (2014). DOI; 1309.6424
- [95]
- T. Nakazato et al., “Quantum error correction of spin quantum memories in diamond under a zero magnetic field”, Communications Physics 5, (2022). DOI
- [96]
- T. H. Taminiau et al., “Universal control and error correction in multi-qubit spin registers in diamond”, Nature Nanotechnology 9, 171 (2014). DOI; 1309.5452
- [97]
- P. Schindler et al., “Experimental Repetitive Quantum Error Correction”, Science 332, 1059 (2011). DOI
- [98]
- Yunfeng Lin, Ben Liang, and Baochun Li, “Priority Random Linear Codes in Distributed Storage Systems”, IEEE Transactions on Parallel and Distributed Systems 20, 1653 (2009). DOI
- [99]
- Anxiao Jiang et al., “Rank Modulation for Flash Memories”, IEEE Transactions on Information Theory 55, 2659 (2009). DOI
- [100]
- J. L. Massey, “Deep-space communications and coding: A marriage made in heaven”, Advanced Methods for Satellite and Deep Space Communications 1. DOI
- [101]
- E.C. Posner, Combinatorial Structures in Planetary Reconnaissance in Error Correcting Codes, ed. H.B. Mann, Wiley, NY 1968.
- [102]
- D. Zhang, K. Ho-Van, and T. Le-Ngoc, “Impulse noise detection techniques for retransmission to reduce delay in DSL systems”, 2012 IEEE International Conference on Communications (ICC) (2012). DOI
- [103]
- A. Kiayias and M. Yung, “Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes”, Automata, Languages and Programming 232 (2002). DOI
- [104]
- D. V. Sarwate and N. R. Shanbhag, “High-speed architectures for Reed-Solomon decoders”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems 9, 641 (2001). DOI
- [105]
- Songze Li et al., “PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously”. 1809.10361
- [106]
- B. Sasidharan and E. Viterbo, “Private Data Access in Blockchain Systems Employing Coded Sharding”, 2021 IEEE International Symposium on Information Theory (ISIT) (2021). DOI
- [107]
- International Organization for Standardization, Information Technology: Automatic Identification and Data Capture Techniques-QR Code 2005 Bar Code Symbology Specification, 2nd ed., IEC18004 (ISO, 2006).
- [108]
- I. Shakeel et al., “Reed-Solomon coding for cooperative wireless communication”, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (2010). DOI
- [109]
- N. Shental et al., “Efficient high-throughput SARS-CoV-2 testing to detect asymptomatic carriers”, Science Advances 6, (2020). DOI
- [110]
- T. Klove and M. Miller, “The Detection of Errors After Error-Correction Decoding”, IEEE Transactions on Communications 32, 511 (1984). DOI
- [111]
- H. Janwa and O. Moreno, “[]”, Designs, Codes and Cryptography 8, 293 (1996). DOI
- [112]
- H. Chen and R. Cramer, “Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields”, Lecture Notes in Computer Science 521 (2006). DOI
- [113]
- D. M. Debroy et al., “Optimizing Stabilizer Parities for Improved Logical Qubit Memories”, Physical Review Letters 127, (2021). DOI; 2105.05068
- [114]
- Y.-H. Luo et al., “Quantum teleportation of physical qubits into logical code spaces”, Proceedings of the National Academy of Sciences 118, (2021). DOI; 2009.06242
- [115]
- R. Zhang et al., “Loss-tolerant all-photonic quantum repeater with generalized Shor code”, Optica 9, 152 (2022). DOI; 2203.07979
- [116]
- R. Vidhya Lavanya and M. Madheswaran, “Wimax (IEEE 802.16 m) system based on space time block code and discrete multiwavelet transform and implementation in FPGA”, Telecommunication Systems 56, 327 (2013). DOI
- [117]
- S. P. Alex and L. M. A. Jalloul, “Performance Evaluation of MIMO in IEEE802.16e/WiMAX”, IEEE Journal of Selected Topics in Signal Processing 2, 181 (2008). DOI
- [118]
- “Advances in smart antennas - MIMO-OFDM wireless systems: basics, perspectives, and challenges”, IEEE Wireless Communications 13, 31 (2006). DOI
- [119]
- D. Nigg et al., “Quantum computations on a topologically encoded qubit”, Science 345, 302 (2014). DOI; 1403.5426
- [120]
- C. Ryan-Anderson et al., “Realization of real-time fault-tolerant quantum error correction”. 2107.07505
- [121]
- P. Ball, “Real-Time Error Correction for Quantum Computing”, Physics 14, (2021). DOI
- [122]
- L. Postler et al., “Demonstration of fault-tolerant universal quantum gate operations”, Nature 605, 675 (2022). DOI; 2111.12654
- [123]
- S. Krinner et al., “Realizing repeated quantum error correction in a distance-three surface code”, Nature 605, 669 (2022). DOI; 2112.03708
- [124]
- Y. Zhao et al., “Realization of an Error-Correcting Surface Code with Superconducting Qubits”, Physical Review Letters 129, (2022). DOI; 2112.13505
- [125]
- L. Frunzio and S. Singh, “Error-Correcting Surface Codes Get Experimental Vetting”, Physics 15, (2022). DOI
- [126]
- P. Chaichanavong and P. H. Siegel, “Tensor-product parity code for magnetic recording”, IEEE Transactions on Magnetics 42, 350 (2006). DOI
- [127]
- H. Hämäläinen and S. Rankinen, “Upper bounds for football pool problems and mixed covering codes”, Journal of Combinatorial Theory, Series A 56, 84 (1991). DOI
- [128]
- T. M. Thompson, From Error-Correcting Codes Through Sphere Packings To Simple Groups, Mathematical Association of America, 1983.
- [129]
- J. Svigals, “IBM 7070 data processing system”, Papers presented at the the March 3-5, 1959, western joint computer conference on XX - IRE-AIEE-ACM '59 (Western) (1959). DOI
- [130]
- J. Meggitt, “Error correcting codes and their implementation for data transmission systems”, IEEE Transactions on Information Theory 7, 234 (1961). DOI
- [131]
- B. A. Bell et al., “Experimental demonstration of a graph state quantum error-correction code”, Nature Communications 5, (2014). DOI; 1404.5498
- [132]
- N. M. Linke et al., “Fault-tolerant quantum error detection”, Science Advances 3, (2017). DOI; 1611.06946
- [133]
- C. K. Andersen et al., “Repeated quantum error detection in a surface code”, Nature Physics 16, 875 (2020). DOI; 1912.09410
- [134]
- A. Erhard et al., “Entangling logical qubits with lattice surgery”, Nature 589, 220 (2021). DOI; 2006.03071
- [135]
- J. F. Marques et al., “Logical-qubit operations in an error-detecting surface code”, Nature Physics 18, 80 (2021). DOI; 2102.13071