Live briefing
Everything about AN codes
Error-correcting code in arithmetic applications
AN codes are error-correcting code that are used in arithmetic applications. Arithmetic codes were commonly used in computer processors to ensure the accuracy of its arithmetic operations when electronics were more unreliable. Arithmetic codes help the processor to detect when an error is made and correct it. Without these codes, processors would be unreliable since any errors would go undetected. AN codes are arithmetic codes that are named for the integers and that are used to encode and decode the codewords. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: AN codesA 5-minute orientation
- Skim a recent paper: Hidden codes in mRNA: Control of gene expression by m6AInfluential work since 2022
- Pick up a classic book: Le Coran révélé par la théorie des codesThe most-reprinted book on the subject
- Read the landmark paper: Compendium of Physical Activities: an update of activity codes and MET intensitiesCited 6,324 times
- Go sideways: Barrett reductionA closely related topic
- Go sideways: Decoding methodsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Compendium of Physical Activities: an update of activity codes and MET intensities
Low-density parity-check codes
Space-time codes for high data rate wireless communication: performance criterion and code construction
Space-time block codes from orthogonal designs
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Error Detecting and Error Correcting Codes
A Method for the Construction of Minimum-Redundancy Codes
🆕 Influential since 2022
Hidden codes in mRNA: Control of gene expression by m6A
The structures and functions of correlations in neural population codes
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching
Quantum LDPC Codes With Almost Linear Minimum Distance
📚 Books worth reading
- 📕Le Coran révélé par la théorie des codesJean-Jacques Walter · 2014
- 📕2a Reunión IFLA de Expertos sobre un Código Internacional de CatalogaciónIFLA Meeting of Experts on an International Cataloguing Code (2nd 2004 Buenos Aires, Argentina) · 2004
- 📕2a Reunión IFLA de Expertos sobre un Código Internacional de CatalogaciónAgeo García B. · 2004
Guide to AI & Agent ZeroC. Urious, τ (Tau) · 2026
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Barrett reduction In modular arithmetic, Barrett reduction is an algorithm designed to optimize the calculation of a mod n {\displaystyle a\,{\bmod {\,}}n\,} without needing…
- Decoding methods In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of mapping…
- Binary Goppa code In mathematics and computer science, the binary Goppa code is an error-correcting code that belongs to the class of general Goppa codes originally described…
- Plotkin bound In the mathematics of coding theory, the Plotkin bound, named after Morris Plotkin, is a limit (or bound) on the maximum possible number of codewords in…
- Ankeny–Artin–Chowla congruence In number theory, the Ankeny–Artin–Chowla congruence is a result published in 1953 by N. C. Ankeny, Emil Artin and S. Chowla. It concerns the class number h…
- Fermat quotient In number theory, the Fermat quotient of an integer a with respect to an odd prime p is defined as q p ( a ) = a p − 1 − 1 p , {\displaystyle q_{p}(a)={\frac…
- Beatty sequence In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of an…
- Cubic reciprocity Cubic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence x3 ≡ p (mod q)…