Here is a list of classical codes that have been realized in devices and/or that have practical real-world relevance.
Name Realization(s)
Alamouti code Wireless standards since: 3G, LTE, LTE-Advanced, and 5G.Wireless communication: IEEE 802.11n, IEEE 802.11ad, IEEE 802.11ay, etc.
Array-based LDPC (AB-LDPC) code Certain AB-LDPC codes have been proposed to be used for DSL transmission [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]
Binary PSK (BPSK) code Telephone-line modems throughout 1950s and 1960s: Bell 103 and 202, as well as international standards V.21 [4] and V.23 [5].
Bose–Chaudhuri–Hocquenghem (BCH) code DVDs, disk drives, and two-dimensional bar codes [6].
Constant-weight code Radio-network frequency hopping [7].
Convolutional code A type of convolutional code used in Real-time Application networks [8].Mobile and radio communications (3G networks) use convolutional codes concatenated with RS codes to obtain suitable performance [9].A convolutional code with rate 1/2 was used for deep-space and satellite communication [10]
Covering code Data compression both with or without compression [11].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 [12,13].
Cross-interleaved RS (CIRS) code Compact discs (CDs); see [15][14; Sec. 5.6][16; Ch. 4].
Cycle LDPC code Cycle LDPC codes have been proposed to be used for MIMO channels [17].
Cyclic redundancy check (CRC) code CRC-16 and CRC-32 are used in data transmission, e.g., IEEE 802.16e, IEEE 802.3 [18] and TCP/IP communication [19; Sec. 2.3.3].
Delsarte-Goethals (DG) code Space-time signaling [20].Compressed neighbor discovery in a network [21].
Error-correcting output code (ECOC) Multiclass problems in machine learning, relevant to facial recognition [22,23], text recognition [24], or digit classification [25].
Fountain code Designed for servers sending data to many recipients, such as during broadcasting or file distribution [26,27].DNA storage [28].
Frameproof (FP) code FP codes are utilized in digital fingerprinting and watermarking [29].
Gabidulin code Public-key cryptosystems [30,31].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 [32].
Generalized RS (GRS) code Commonly used in mass storage systems such as CDs, DVDs, QR codes etc.Various cloud storage systems [33].A variation of the McEliece public-key cryptosystem [34,35] by Niederreiter [36] replaced the generator matrix by the parity check matrix of a GRS code. This was proven to be insecure since the public key exposes the algebraic structure of code [37]. More recent works focus on methods to mask the algebraic structure using subcodes of GRS codes [30]. For example, a key-recovery attack was developed in Ref. [38] for a variant of masking method proposed in Ref. [39].
Golay code Extended Golay code used in the Voyager 1 and 2 spacecraft, transmitting hundreds of color pictures of Jupiter and Saturn in their 1979, 1980, and 1981 fly-bys [40].Extended Golay code used in American military standards for automatic link establishment in high frequency radio systems [41].Proofs of the quantum mechanical Kochen-Specker theorem [42].
Gold code Used in for synchronization purposes in telecommunication [43]GPS C/A for satellite navigation [44].
Goppa code The McEliece public-key cryptosystem [34,35]. The protocol relies on the assumptions that Goppa-code generator matrices are hard to distinguish from random linear codes. However, there is an algorithm distinguishing between the two code classes in a time subexponential in \(n\) [45].
Gray code Three-dimensional imaging [46].Broadcasting and communication [47].
Hessian polyhedron code Quantum mechanical SIC-POVMs [48].
Irregular LDPC code Satellite communication after concatenating with a modulation scheme [49].
Irregular repeat-accumulate (IRA) code LDPC codes are used for digital satellite video broadcasting per the DVB-S2 standard [50,51] utilize IRA code features and are subject to ongoing litigation; see Ref. [52].Apple and Broadcom Wi-Fi devices utilize IRA encoding and decoding code features and are subject to ongoing litigation; see Ref. [52].
Justesen code Generating small-bias sample spaces, i.e., probability distributions that parity functions cannot typically distinguish from the uniform distribution [53].
Linearized RS code Network coding [54].Code-based cryptography [55,56].
Locally recoverable code (LRC) An \((18,14,7)\) LRC has beed used in the Windows Azure cloud storage system [57]; see also [58; 31.3.1.2].Facebook f4 BLOB cloud storage system [59]
Low-rank parity-check (LRPC) code Cryptosystem [60] that is a rank-metric analogue of NTRU [61] and MDPC [62] cryptosystems.Post-quantum cryptography [63].
Maximally recoverable (MR) code RAID storage [64].
Maximum distance separable (MDS) code Automatic repeat request (ARQ) data transmission protocols ([16], Ch. 7).
Maximum-rank distance (MRD) code Useful for error and erasure correction in network coding [65,66].
Multi-edge LDPC code Quantum key distribution [67–69].
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 ([70], Ch. 27).Marking the state of a finite automaton [71].Encoding the output of the different classes of a classifier neural network [72]. One-hot codes are the primary codes used in multiclass classification [73–76].
Phase-shift keying (PSK) code Telephone-line modems: 1967 Milgo 4400/48 and international standard V.27 used 8-PSK [77].
Polar code Code control channels for the 5G NR (New Radio) interfaces [78].
Pulse-position modulation (PPM) code Greek hydraulic semaphore system [79,80].Telegraph time-division multiplexing.Radio-control, fiber-optic communications, and deep-space communications.
Quadrature PSK (QPSK) code Japanese and North American digital cellular and personal systems [81].Telephone-line modems: 1962 Bell 201 and international standard V.24 [82].
Quadrature-amplitude modulation (QAM) code Optical communication (e.g., Ref. [83]).Telephone-line modems: 1971 Codex 9600C and international standard V.29 used 16-QAM [84].
Quasi-cyclic LDPC (QC-LDPC) code 5G NR cellular communication for the traffic channel [85,86].Wireless communication: WiMAX (IEEE 802.16e) [87–89], WiFi 4 (IEEE 802.11n) [90], and WPAN (IEEE 802.15.3c) [91].
Random code Distributed storage systems [92].Classical and quantum cryptography based on the learning-with-errors problem, which is related to decoding a random linear code [93].Random codes can be used to realize secure computation [94].
Rank-metric code Identity-Based Encryption [95].Digital watermarking [96].Network coding and streaming media broadcasting [97].
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 [98].
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 [99,100].
Reed-Solomon (RS) code RS Product Code (RSPC) was used in DVDs (see Ref. [16], Ch. 4).DSL technologies and their variants against impluse noise [101].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 [102].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 telemetry channel coding standard issued by the Consultative Committee for Space Data Systems (see Ref. [16], Ch. 3).Automatic repeat request (ARQ) data transmission protocols (see Ref. [16], Ch. 7).Slow-frequency-hop spread-spectrum transmission (see Ref. [16], Chs. 8-9).RS codes over \(q=2^m\) are used in RAID 6 [103,104]; see [15].Coded sharding designs in blockchains to increase efficiency [105].Used in QR-Codes to retrieve damaged barcodes [106].Wireless communication systems such as 3G, DVB, and WiMAX [107].Correcting pooled testing results for SARS-CoV-2 [108].DNA storage [109].
Regular binary Tanner code First hardware implementation was done using a semi-systolic decoding architecture [110].
Repetition code Repetition codes, in conjunction with other codes, were used in magnetic disks [111].Communication protocols such as FlexRay [112].'
Residue AG code Improvements over the McEliece public-key cryptosystem to linear AG codes on curves of arbitrary genus [113]. Only the subfield subcode proposal remains resilient to attacks [114; Sec. 15.7.5.3].Algebraic geometric secret-sharing schemes [115].
Single parity-check (SPC) code Can be realized on almost every communication device. SPCs are some of the earliest error-correcting codes ([70], Ch. 27).
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–118].
Spherical code Spherical codes are relevant to modern Hopfield networks [119,120]
Subspace code Packet-based transmission over networks [121].
Tensor-product code Construction can be used in magnetic recording by taking the tensor product of an RS code and a parity-check code [122].
Ternary Golay code Code used in football pools with at least one good bet [13,123]. In fact, the code was originally constructed by Juhani Virtakallio and published in the Finnish football pool magazine Veikkaaja [13,124,125].Proofs of the quantum mechanical Kochen-Specker theorem [42].
Traceability code Broadcast messages, pay-per-view movies, and protecting copyrighted online material [126].
Turbo code Recommended by Consultative Committee on Space Data Systems (CCDJS) for telemetry and telecommand [127,128].Several standards related to wireless communication, including W-CDMA, DVB-RCS, TD-SCDMA, 802.16, and CDMA2000 [129].
Unary code Neural networks [130].Birdsong production [131].
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 [125,132].
Zetterberg code Code used to provide better protection of data transmission with its double error correcting capacity [133].
\(A_2\) hexagonal lattice Wireless communication [134,135].
\([2^m,m+1,2^{m-1}]\) First-order RM code The \([32, 6, 16]\) RM\((1,5)\) code was used for the 1971 Mariner 9 spacecraft [136].
\([2^r-1,2^r-r-1,3]\) Hamming code Commonly used when error rates are very low, for example, computer RAM or integrated circuits [137].Hamming-code based matrix embedding used in steganography [138,139].

References

[1]
E. Eleftheriou and S. Olcer, “Low-density parity-check codes for digital subscriber lines”, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333) DOI
[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]
International Telecommunication Union-T, Recommendation V.21: 300 bits per second duplex modem standardized for use in the general switched telephone network, 1984
[5]
International Telecommunication Union-T, Recommendation V.23: 600/1200-baud modem standardized for use in the general switched telephone network, 1988
[6]
S. Zhu, Z. Sun, and X. Kai, “A Class of Narrow-Sense BCH Codes”, IEEE Transactions on Information Theory 65, 4699 (2019) DOI
[7]
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
[8]
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
[9]
T. Halonen, J. Romero, and J. Melero, editors , “GSM, GPRS and EDGE Performance”, (2003) DOI
[10]
Butman, Deutsch, and Miller. Performance of concatenated codes for deep space missions. 1981.
[11]
G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes, Elsevier (1997).
[12]
H. Hamalainen, I. Honkala, S. Litsyn, and P. Ostergard, “Football Pools--A Game for Mathematicians”, The American Mathematical Monthly 102, 579 (1995) DOI
[13]
A. Barg, “At the Dawn of the Theory of Codes”, The Mathematical Intelligencer 15, 20 (1993) DOI
[14]
W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes (Cambridge University Press, 2003) DOI
[15]
M. Blaum, P. G. Farrell, H. C. A. van Tilborg, 1998. Array codes. Handbook of coding theory, 2 (Part 2), pp. 1855-1909.
[16]
S. B. Wicker and V. K. Bhargava, “Reed-Solomon Codes and Their Applications”, (1999) DOI
[17]
Ronghui Peng and Rong-Rong Chen, “Application of Nonbinary LDPC Cycle Codes to MIMO Channels”, IEEE Transactions on Wireless Communications 7, 2020 (2008) DOI
[18]
Borrelli, Chris. "IEEE 802.3 cyclic redundancy check." application note: Virtex Series and Virtex-II Family, XAPP209 (v1. 0) (2001).
[19]
M. Ergen, “Basics of Cellular Communication”, Mobile Broadband 19 (2008) DOI
[20]
A. R. Calderbank, S. N. Diggavi, and N. Al-Dhahir, “Space-time signaling based on Kerdock and Delsafte-Goethals codes”, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) (2004) DOI
[21]
A. Thompson and R. Calderbank, “Compressed Neighbour Discovery using Sparse Kerdock Matrices”, (2018) arXiv:1801.04537
[22]
T. Windeatt, “Boosted ECOC ensembles for face recognition”, International Conference on Visual Information Engineering (VIE 2003). Ideas, Applications, Experience (2003) DOI
[23]
J. Kittler, R. Ghaderi, T. Windeatt, and J. Matas, “Face verification using error correcting output codes”, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 DOI
[24]
R. Ghani, “Combining labeled and unlabeled data for text classification with a large number of categories”, Proceedings 2001 IEEE International Conference on Data Mining DOI
[25]
J. Zhou and C. Y. Suen, “Unconstrained numeral pair recognition using enhanced error correcting output coding: a holistic approach”, Eighth International Conference on Document Analysis and Recognition (ICDAR’05) (2005) DOI
[26]
A. Shokrollahi, “Raptor codes”, IEEE Transactions on Information Theory 52, 2551 (2006) DOI
[27]
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) 398 (2012) DOI
[28]
Y. Erlich and D. Zielinski, “DNA Fountain enables a robust and efficient storage architecture”, Science 355, 950 (2017) DOI
[29]
S. R. Blackburn, “Frameproof Codes”, SIAM Journal on Discrete Mathematics 16, 499 (2003) DOI
[30]
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
[31]
T. Lau and C. Tan, “A New Technique in Rank Metric Code-Based Encryption”, Cryptography 2, 32 (2018) DOI
[32]
P. Lefevre, P. Carre, and P. Gaborit, “Watermarking and Rank Metric Codes”, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2087 (2018) DOI
[33]
H. Dau, I. M. Duursma, H. M. Kiah, and O. Milenkovic, “Repairing Reed-Solomon Codes With Multiple Erasures”, IEEE Transactions on Information Theory 64, 6567 (2018) arXiv:1612.01361 DOI
[34]
R. J. McEliece, A public-key cryptosystem based on algebraic coding theory, Technical report, Jet Propulsion Lab. DSN Progress Report (1978).
[35]
H. Janwa and O. Moreno, “McEliece public key cryptosystems using algebraic-geometric codes”, Designs, Codes and Cryptography 8, (1996) DOI
[36]
H. Niederreiter (1986). Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory. Problemy Upravlenija I Teorii Informacii. 15: 159–166.
[37]
V. M. SIDELNIKOV and S. O. SHESTAKOV, “On insecurity of cryptosystems based on generalized Reed-Solomon codes”, Discrete Mathematics and Applications 2, (1992) DOI
[38]
A. Couvreur, P. Gaborit, V. Gauthier-Umaña, A. Otmani, and J.-P. Tillich, “Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes”, (2014) arXiv:1307.6458
[39]
M. Baldi, M. Bianchi, F. Chiaraluce, J. Rosenthal, and D. Schipani, “Enhanced public key security for the McEliece cryptosystem”, (2014) arXiv: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]
M. Waegell and P. K. Aravind, “Golay codes and quantum contextuality”, Physical Review A 106, (2022) arXiv:2206.04209 DOI
[43]
Mujtaba Hamid and Andy Miller, Gold Code Generators in Virtex Devices, (2000)
[44]
J. J. SPILKER Jr., “GPS Signal Structure and Performance Characteristics”, Navigation 25, 121 (1978) DOI
[45]
H. Randriambololona, “The syzygy distinguisher”, (2024) arXiv:2407.15740
[46]
G. Sansoni, S. Corini, S. Lazzari, R. Rodella, and F. Docchio, “Three-dimensional imaging based on Gray-code light projection: characterization of the measuring algorithm and development of a measuring system for industrial applications”, Applied Optics 36, 4463 (1997) DOI
[47]
S. L. Johnsson and C.-T. Ho, “Optimum broadcasting and personalized communication in hypercubes”, IEEE Transactions on Computers 38, 1249 (1989) DOI
[48]
B. C. Stacey, “Sporadic SICs and Exceptional Lie Algebras”, (2019) arXiv:1911.05809
[49]
S. ten Brink, G. Kramer, and A. Ashikhmin, “Design of Low-Density Parity-Check Codes for Modulation and Detection”, IEEE Transactions on Communications 52, 670 (2004) DOI
[50]
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 83 (2014) DOI
[51]
ETSI, ETSI. "Digital video broadcasting (dvb); second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications." Part II: S2-Extensions (DVB-S2X) (2005): 22-27.
[52]
Hui Jin, Aamod Khandekar, and Robert J. McEliece. "Serial concatenation of interleaved convolutional codes forming turbo-like codes." United States Patent Number 7116710B1 (2023).
[53]
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 213 (1990) DOI
[54]
U. Martinez-Penas and F. R. Kschischang, “Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes”, IEEE Transactions on Information Theory 65, 4785 (2019) arXiv:1805.03789 DOI
[55]
Hörmann, F., Bartz, H., & Horlemann, A. L. (2022). Security considerations for Mceliece-like cryptosystems based on linearized Reed-Solomon codes in the sum-rank metric.
[56]
F. Hörmann, H. Bartz, and A.-L. Horlemann, “Distinguishing and Recovering Generalized Linearized Reed–Solomon Codes”, Lecture Notes in Computer Science 1 (2023) arXiv:2304.00627 DOI
[57]
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.
[58]
V. Ramkumar, M. Vajha, S. B. Balaji, M. Nikhil Krishnan, B. Sasidharan, P. Vijay Kumar, "Codes for Distributed Storage." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
[59]
Muralidhar, S., Lloyd, W., Roy, S., Hill, C., Lin, E., Liu, W., Pan, S., Shankar, S., Sivakumar, V., Tang, L. and Kumar, S., 2014. f4: Facebook's warm BLOB storage system. In 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14) (pp. 383-398).
[60]
Gaborit, P., Murat, G., Ruatta, O., & Zemor, G. (2013, April). Low rank parity check codes and their application to cryptography. In Proceedings of the Workshop on Coding and Cryptography WCC (Vol. 2013).
[61]
J. Hoffstein, J. Pipher, and J. H. Silverman, “NTRU: A ring-based public key cryptosystem”, Lecture Notes in Computer Science 267 (1998) DOI
[62]
R. Misoczki, J.-P. Tillich, N. Sendrier, and P. S. L. M. Barreto, “MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes”, 2013 IEEE International Symposium on Information Theory (2013) DOI
[63]
P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, “RankSign: An Efficient Signature Algorithm Based on the Rank Metric”, Post-Quantum Cryptography 88 (2014) DOI
[64]
J. S. Plank and M. Blaum, “Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems”, ACM Transactions on Storage 10, 1 (2014) DOI
[65]
R. Koetter and F. Kschischang, “Coding for Errors and Erasures in Random Network Coding”, (2008) arXiv:cs/0703061
[66]
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) arXiv:0711.0708 DOI
[67]
M. Milicevic, C. Feng, L. M. Zhang, and P. G. Gulak, “Quasi-cyclic multi-edge LDPC codes for long-distance quantum cryptography”, npj Quantum Information 4, (2018) arXiv:1702.07740 DOI
[68]
H. Mani, T. Gehring, P. Grabenweger, B. Ömer, C. Pacher, and U. L. Andersen, “Multiedge-type low-density parity-check codes for continuous-variable quantum key distribution”, Physical Review A 103, (2021) DOI
[69]
A. A. E. Hajomer, I. Derkach, R. Filip, U. L. Andersen, V. C. Usenko, and T. Gehring, “Continuous-variable quantum passive optical network”, Light: Science & Applications 13, (2024) arXiv:2402.16044 DOI
[70]
Encyclopedia of Computer Science and Technology, Second Edition Volume I (CRC Press, 2017) DOI
[71]
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
[72]
Potdar, Kedar, Taher S. Pardawala, and Chinmay D. Pai. "A comparative study of categorical variable encoding techniques for neural network classifiers." International journal of computer applications 175.4 (2017): 7-9.
[73]
L. Rokach, Pattern Classification Using Ensemble Methods (WORLD SCIENTIFIC, 2009) DOI
[74]
G. Anthony, H. Gregg, and M. Tshilidzi, “Image Classification Using SVMs: One-against-One Vs One-against-All”, (2007) arXiv:0711.2914
[75]
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
[76]
W. Utschick and W. Weichselberger, “Stochastic Organization of Output Codes in Multiclass Learning Problems”, Neural Computation 13, 1065 (2001) DOI
[77]
International Telecommunication Union-T, Recommendation V.27ter: 4800/2400 Bits Per Second Modem Standardized For Use in the General Switched Telephone Network, 1984
[78]
3rd Generation Partnership Project (3GPP), Technical specification group radio access network, 3GPP TS 38.212 V.15.0.0, 2017.
[79]
Michael Lahanas. "Ancient Greek Communication Methods". https://web.archive.org/web/20141102224501/https://www.mlahanas.de/Greeks/Communication.htm. Archived from the original on 2014-11-02.
[80]
A. B. Raj and A. K. Majumder, “Historical perspective of free space optical communications: from the early dates to today’s developments”, IET Communications 13, 2405 (2019) DOI
[81]
K. Feher, “Modems for emerging digital cellular-mobile radio system”, IEEE Transactions on Vehicular Technology 40, 355 (1991) DOI
[82]
International Telecommunication Union-T, Recommendation V.24: List of definitions for interchange circuits between data terminal equipment (DTE) and data circuit-terminating equipment (DCE), 1988
[83]
F. Buchali, F. Steiner, G. Bocherer, L. Schmalen, P. Schulte, and W. Idler, “Rate Adaptation and Reach Increase by Probabilistically Shaped 64-QAM: An Experimental Demonstration”, Journal of Lightwave Technology 34, 1599 (2016) DOI
[84]
International Telecommunication Union-T, Recommendation V.29: 9600 Bits Per Second Modem Standardized For Use on Point-to-Point 4-Wire Leased Telephone-Tpe Circuits, 1993
[85]
T. Richardson and S. Kudekar, “Design of Low-Density Parity Check Codes for 5G New Radio”, IEEE Communications Magazine 56, 28 (2018) DOI
[86]
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) 208 (2020) DOI
[87]
LDPC coding for OFDMA PHY. 802.16REVe Sponsor Ballot Recirculation comment, July 2004. IEEE C802.16e04/141r2
[88]
T. Brack, M. Alles, F. Kienle, and N. Wehn, “A Synthesizable IP Core for WIMAX 802.16E LDPC Code Decoding”, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications (2006) DOI
[89]
G. Falcão, V. Silva, L. Sousa, and J. Marinho, “High coded data rate and multicodeword WiMAX LDPC decoding on Cell/BE”, Electronics Letters 44, 1415 (2008) DOI
[90]
Xiao Han, Kai Niu, and Zhiqiang He, “Implementation of IEEE 802.11n LDPC codes based on general purpose processors”, 2013 15th IEEE International Conference on Communication Technology (2013) DOI
[91]
W. Zhang, S. Chen, X. Bai, and D. Zhou, “A full layer parallel QC-LDPC decoder for WiMAX and Wi-Fi”, 2015 IEEE 11th International Conference on ASIC (ASICON) (2015) DOI
[92]
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
[93]
O. Regev, “On lattices, learning with errors, random linear codes, and cryptography”, Journal of the ACM 56, 1 (2009) DOI
[94]
H. Chen, R. Cramer, S. Goldwasser, R. de Haan, and V. Vaikuntanathan, “Secure Computation from Random Error Correcting Codes”, Advances in Cryptology - EUROCRYPT 2007 291 (2007) DOI
[95]
P. Gaborit, A. Hauteville, D. H. Phan, and J.-P. Tillich, “Identity-Based Encryption from Codes with Rank Metric”, Advances in Cryptology – CRYPTO 2017 194 (2017) DOI
[96]
P. Lefèvre, P. Carré, and P. Gaborit, “Application of rank metric codes in digital image watermarking”, Signal Processing: Image Communication 74, 119 (2019) DOI
[97]
D. Silva and F. R. Kschischang, “Rank-Metric Codes for Priority Encoding Transmission with Network Coding”, 2007 10th Canadian Workshop on Information Theory (CWIT) (2007) DOI
[98]
Anxiao Jiang, R. Mateescu, M. Schwartz, and J. Bruck, “Rank Modulation for Flash Memories”, IEEE Transactions on Information Theory 55, 2659 (2009) DOI
[99]
J. L. Massey, “Deep-space communications and coding: A marriage made in heaven”, Lecture Notes in Control and Information Sciences 1 DOI
[100]
E.C. Posner, Combinatorial Structures in Planetary Reconnaissance in Error Correcting Codes, ed. H.B. Mann, Wiley, NY 1968.
[101]
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) 3160 (2012) DOI
[102]
A. Kiayias and M. Yung, “Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes”, Lecture Notes in Computer Science 232 (2002) DOI
[103]
Anvin, H. Peter. "The mathematics of RAID-6." (2007).
[104]
S. T. Position. (2009) Common raid disk data format specification. [Online]. Available: https://www.snia.org/tech activities/standards/curr standards/ddf
[105]
S. Li, M. Yu, C.-S. Yang, A. S. Avestimehr, S. Kannan, and P. Viswanath, “PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously”, (2020) arXiv:1809.10361
[106]
International Organization for Standardization, Information Technology: Automatic Identification and Data Capture Techniques-QR Code 2005 Bar Code Symbology Specification, 2nd ed., IEC18004 (ISO, 2006).
[107]
I. Shakeel, M. O. Hasna, A. Abu-Dayya, and A. Ghrayeb, “Reed-Solomon coding for cooperative wireless communication”, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications 1021 (2010) DOI
[108]
N. Shental et al., “Efficient high-throughput SARS-CoV-2 testing to detect asymptomatic carriers”, Science Advances 6, (2020) DOI
[109]
R. N. Grass, R. Heckel, M. Puddu, D. Paunescu, and W. J. Stark, “Robust Chemical Preservation of Digital Information on DNA in Silica with Error‐Correcting Codes”, Angewandte Chemie International Edition 54, 2552 (2015) DOI
[110]
K. Karplus and H. Krit, “A semi-systolic decoder for the PDSC-73 error-correcting code”, Discrete Applied Mathematics 33, 109 (1991) DOI
[111]
T. Klove and M. Miller, “The Detection of Errors After Error-Correction Decoding”, IEEE Transactions on Communications 32, 511 (1984) DOI
[112]
“High-Performance Embedded Computing”, (2014) DOI
[113]
H. Janwa and O. Moreno, Designs, Codes and Cryptography 8, 293 (1996) DOI
[114]
A. Couvreur, H. Randriambololona, "Algebraic Geometry Codes and Some Applications." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
[115]
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
[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]
J. Y.-C. Hu, D. Wu, and H. Liu, “Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codes”, (2024) arXiv:2410.23126
[120]
S. Santos, V. Niculae, D. McNamee, and A. F. T. Martins, “Sparse and Structured Hopfield Networks”, (2024) arXiv:2402.13725
[121]
F. R. Kschischang, "Network Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
[122]
P. Chaichanavong and P. H. Siegel, “Tensor-product parity code for magnetic recording”, IEEE Transactions on Magnetics 42, 350 (2006) DOI
[123]
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
[124]
Veikkaus-Lotto (Veikkaaja) magazine, issues 27, 28, and 33, August-September 1947.
[125]
T. Thompson, From Error-Correcting Codes Through Sphere Packings to Simple Groups (American Mathematical Society, 1983) DOI
[126]
J. N. Staddon, D. R. Stinson, and Ruizhong Wei, “Combinatorial properties of frameproof and traceability codes”, IEEE Transactions on Information Theory 47, 1042 (2001) DOI
[127]
Divsalar, Dariush, and Fabrizio Pollara. "Turbo codes for deep-space communications." The Telecommunications and Data Acquisition Report 29-39 (SEE N95-21532 06-32) (1995).
[128]
T. Yamada, “CCSDS Telemetry/Tele-command Standards Restructured as Communications Protocols”, SpaceOps 2002 Conference (2002) DOI
[129]
K. Gracie and M.-H. Hamon, “Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications”, Proceedings of the IEEE 95, 1228 (2007) DOI
[130]
S. Kak, “Unary Coding for Neural Network Learning”, (2010) arXiv:1009.4495
[131]
Fiete, I. R., & Seung, H. S. (2007). Neural network models of birdsong production, learning, and coding. New Encyclopedia of Neuroscience. Eds. L. Squire, T. Albright, F. Bloom, F. Gage, and N. Spitzer. Elsevier.
[132]
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) 222 (1959) DOI
[133]
J. Meggitt, “Error correcting codes and their implementation for data transmission systems”, IEEE Transactions on Information Theory 7, 234 (1961) DOI
[134]
C. Campopiano and B. Glazer, “A Coherent Digital Amplitude and Phase Modulation Scheme”, IEEE Transactions on Communications 10, 90 (1962) DOI
[135]
G. Foschini, R. Gitlin, and S. Weinstein, “Optimization of Two-Dimensional Signal Constellations in the Presence of Gaussian Noise”, IEEE Transactions on Communications 22, 28 (1974) DOI
[136]
E. Arikan, “A survey of reed-muller codes from polar coding perspective”, IEEE Information Theory Workshop 2010 (ITW 2010) (2010) DOI
[137]
R. Hentschke, F. Marques, F. Lima, L. Carro, A. Susin, and R. Reis, “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 95 DOI
[138]
Crandall, Ron. "Some notes on steganography." Posted on steganography mailing list 1998 (1998): 1-6.
[139]
A. Westfeld, “F5—A Steganographic Algorithm”, Lecture Notes in Computer Science 289 (2001) DOI