Everything about Hamming code
Family of linear error-correcting codes
In computer science and telecommunications, Hamming codes are a family of linear error-correcting codes. Hamming codes can detect one-bit and two-bit errors, or correct one-bit errors without detection of uncorrected errors. By contrast, the simple parity code cannot correct errors, and can detect only an odd number of bits in error. Hamming codes are perfect codes, that is, they achieve the highest possible rate for codes with their block length and minimum distance of three. Richard W. Hamming invented Hamming codes in 1950 as a way of automatically correcting errors introduced by punched card readers. In his original paper, Hamming elaborated his general idea, but specifically focused on the Hamming(7,4) code which adds three parity bits to four bits of data. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Hamming codeA 5-minute orientation
- Skim a recent paper: High performance image steganography integrating IWT and Hamming code within secret sharingInfluential work since 2022
- Pick up a classic book: Diabetes Log BookThe most-reprinted book on the subject
- Read the landmark paper: CMOS Analog MAP Decoder for (8,4) Hamming CodeCited 59 times
- Go sideways: Hamming(7,4)A closely related topic
- Go sideways: Linear codeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
CMOS Analog MAP Decoder for (8,4) Hamming Code
High-capacity adaptive steganography based on LSB and Hamming code
An efficient image authentication method based on Hamming code
A built-in Hamming code ECC circuit for DRAMs
Genetic code, hamming distance and stochastic matrices
The triply shortened binary Hamming code is optimal
Efficient QR Code Secret Embedding Mechanism Based on Hamming Code
Rich QR Codes With Three-Layer Information Using Hamming Code
🆕 Influential since 2022
High performance image steganography integrating IWT and Hamming code within secret sharing
Robust data hiding scheme for highly compressed image exploiting btc with hamming code
In-Memory Hamming Error-Correcting Code in Memristor Crossbar
An efficient IDMA-OFDM underwater wireless communication with Reed Solomon and Hamming code
Dual Reversible Data Hiding Based on AMBTC Using Hamming Code and LSB Replacement
📚 Books worth reading
- 📕Diabetes Log BookCarl Simpson · 2020
Discrete and combinatorial mathematicsRalph P. Grimaldi · 1985
Data Communications and NetworkingBehrouz A. Forouzan, Catherine Ann Coombs · 2000
The art of doing science and engineeringRichard Hamming, Bret Victor · 1996
A student's guide to coding and information theoryStefan M. Moser · 2012
Treaty Occupationay ToxicologySuelen Queiroz · 2010
Information Security and PrivacyColin Boyd · 2005
Machine learning for hackersDrew Conway · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Hamming(7,4) In coding theory, Hamming(7,4) is a linear error-correcting code that encodes four bits of data into seven bits by adding three parity bits. It is a member…
- Linear code In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally…
- Hadamard code The Hadamard code is an error-correcting code named after the French mathematician Jacques Hadamard that is used for error detection and correction when…
- Block code In coding theory, block codes are a large and important family of error-correcting codes that encode data in blocks. There is a vast number of examples…
- Generator matrix In coding theory, a generator matrix is a matrix whose rows form a basis for a linear code. The codewords are all of the linear combinations of the rows…
- Error correction code In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling…
- Low-density parity-check code Low-density parity-check (LDPC) codes, also known as Gallager codes, are a class of error-correction codes first proposed in 1960. Together with the closely…
- Burst error-correcting code In coding theory, burst error-correcting codes employ methods of correcting burst errors, which are errors that occur in many consecutive bits rather than…