|
|
| Line 1: |
Line 1: |
| {{more footnotes|date=March 2013}}
| |
| {{infobox code
| |
| | name = Binary Hamming Codes
| |
| | image = [[File:Hamming(7,4).svg|160px]]
| |
| | image_caption = The Hamming(7,4)-code (with <math>r=3</math>)
| |
| | namesake = [[Richard W. Hamming]]
| |
| | type = [[Linear block code]]
| |
| | block_length = <math>2^r-1</math> where <math>r \geq 2</math>
| |
| | message_length = <math>2^r-r-1</math>
| |
| | rate = <math>1 - r / (2^r-1)</math>
| |
| | distance = <math>3</math>
| |
| | alphabet_size = 2
| |
| | notation = <math>\left[2^r-1, 2^r-r-1,3 \right]_2</math>-code
| |
| | properties = [[perfect code]]
| |
| }}
| |
|
| |
|
| In [[telecommunication]], '''Hamming codes''' are a family of [[linear code|linear error-correcting codes]] that generalize the [[Hamming(7,4)|Hamming(7,4)-code]] invented by [[Richard Hamming]] in 1950. Hamming codes can ''detect up to two-bit errors'' or ''correct one-bit errors without detection of uncorrected errors''. By contrast, the simple [[parity bit|parity code]] cannot correct errors, and can detect only an odd number of bits in error. Hamming codes are [[perfect code]]s, that is, they achieve the highest possible [[Block_code#The_rate_R|rate]] for codes with their [[block_code#The_block_length_n|block length]] and [[Block_code#The_distance_d|minimum distance]] 3.<ref>[http://www.cs.cmu.edu/~venkatg/teaching/codingtheory/notes/notes1.pdf See Lemma 12 of]</ref>
| |
|
| |
|
| In [[mathematics|mathematical]] terms, Hamming codes are a class of binary linear codes. For each integer <math>r \ge 2</math> there is a code with [[Block_code#The_block_length_n|block length]] <math>n=2^r-1</math> and [[Block_code#The_message_length_k|message length]] <math>k=2^r-r-1</math>.
| | They give a range of covert and overt CCTV cameras for you to choose from depending on whether you would like [http://Www.gratisplay.it/giochi_gratis_download.asp?titolo=cctvdvrreviews.com&server=cctvdvrreviews.com&url=http://cctvdvrreviews.com samsung sde-3004n 4-ch cctv 500gb dvr system reviews] your security to act as a detection method or deterrent. [http://www.guys-on-fire.com/cgi/frame.cgi?url==http://cctvdvrreviews.com wireless Security camera] If you've security camera dvr brands got [http://www.haberler.com/kredir.asp?kutu=25852&URL=http%3A//cctvdvrreviews.com cctv dvr software freeware] made the choice to install a CCTV system in your house, below are a few points to consider when you buy. samsung cctv dvr Samsung sde-3004n 4-ch cctv 500gb dvr system reviews Home CCTV cameras are highly advantageous for folks who are working and need to keep our eye on their children.<br><br>The minute details with the event will likely be recorded for the memory of cctv small cctv monitors dvr software for pc free [http://www.Hvidesande.de/index.php/What_Warren_Buffett_Can_Teach_You_About_Dvr_Recorder_Without_Subscription download] the DVR. It can be done ([http://shizu.0000.jp/sweep/?http://cctvdvrreviews.com/ http://shizu.0000.jp]) to also encourage the masking system for 16 channel DVR and entry the display. |
| Hence the rate of Hamming codes is <math>R=k/n=1-r / (2^r-1)</math>, which is highest possible for codes with minimum distance <math>3</math> (i.e. the minimal number of bit changes needed to go from any code word to any other code word is 3) and block length <math>2^r-1</math>.
| |
| The [[parity-check matrix]] of a Hamming code is constructed by listing all columns of length <math>r</math> that are non-zero, which means that the [[dual code]] of the Hamming code is the [[Hadamard code|punctured Hadamard code]]. The parity-check matrix has the property that any two columns are pairwise [[Linear Independence|linearly independent]].
| |
| | |
| Due to the limited redundancy that Hamming codes add to the data, they can only detect and correct errors when the error rate is low. This is the case in computer memory ([[ECC memory]]), where bit errors are extremely rare and Hamming codes are widely used. In this context, an extended Hamming code having one extra parity bit is often used. Extended Hamming codes achieve a Hamming distance of <math>4</math>, which allows the decoder to distinguish between when at most one bit error occurred and when two bit errors occurred. In this sense, extended Hamming codes are single-error correcting and double-error detecting, abbreviated as '''SECDED'''.
| |
| | |
| == History ==
| |
| Hamming worked at [[Bell Labs]] in the 1940s on the [[Bell Model V]] computer, an [[electromechanical]] relay-based machine with cycle times in seconds. Input was fed in on [[punched card]]s, which would invariably have read errors. During weekdays, special code would find errors and flash lights so the operators could correct the problem. During after-hours periods and on weekends, when there were no operators, the machine simply moved on to the next job.
| |
| | |
| Hamming worked on weekends, and grew increasingly frustrated with having to restart his programs from scratch due to the unreliability of the card reader. Over the next few years, he worked on the problem of error-correction, developing an increasingly powerful array of algorithms. In 1950, he published what is now known as Hamming Code, which remains in use today in applications such as [[Dynamic random access memory#Error detection and correction|ECC memory]].
| |
| | |
| === Codes predating Hamming ===
| |
| A number of simple error-detecting codes were used before Hamming codes, but none were as effective as Hamming codes in the same overhead of space.
| |
| | |
| ==== Parity ====
| |
| {{main|Parity bit}}
| |
| | |
| Parity adds a single [[binary digit|bit]] that indicates whether the number of [[1 (number)|1]] bits in the preceding data was [[even number|even]] or [[odd number|odd]]. If an odd number of bits is changed in transmission, the message will change parity and the error can be detected at this point. (Note that the bit that changed may have been the parity bit itself!) The most common convention is that a parity value of '''1''' indicates that there is an '''odd''' number of ones in the data, and a parity value of '''0''' indicates that there is an '''even''' number of ones. If the number of bits changed is even, the check bit will be valid and the error will not be detected. Moreover, parity does not indicate which bit contained the error, even when it can detect it. The data must be discarded entirely and re-transmitted from scratch. On a noisy transmission medium, a successful transmission could take a long time or may never occur. However, while the quality of parity checking is poor, since it uses only a single bit, this method results in the least overhead.
| |
| | |
| ====Two-out-of-five code====
| |
| {{main|Two-out-of-five code}}
| |
| | |
| A two-out-of-five code is an encoding scheme which uses five digits consisting of exactly three 0s and two 1s. This provides ten possible combinations, enough to represent the digits 0–9. This scheme can detect all single bit-errors and all odd numbered bit-errors. However it still cannot correct for these errors.
| |
| | |
| ====Repetition==== | |
| {{main|triple modular redundancy}}
| |
| | |
| Another code in use at the time repeated every data bit several times in order to ensure that it got through. For instance, if the data bit to be sent was a 1, an {{nowrap|1=''n'' = 3}} ''[[repetition code]]'' would send "111". If the three bits received were not identical, an error occurred. If the channel is clean enough, most of the time only one bit will change in each triple. Therefore, 001, 010, and 100 each correspond to a 0 bit, while 110, 101, and 011 correspond to a 1 bit, as though the bits counted as "votes" towards what the original bit was. A code with this ability to reconstruct the original message in the presence of errors is known as an ''error-correcting'' code. This triple repetition code is a Hamming code with <math>m = 2</math>, since there are 2 parity bits, and <math>2^2 - 2 - 1 = 1</math> data bit.
| |
| | |
| Such codes cannot correctly repair all errors, however. In our example, if the channel flipped two bits and the receiver got "001", the system would detect the error, but conclude that the original bit was 0, which is incorrect. If we increase the number of times we duplicate each bit to four, we can detect all two-bit errors but can't correct them (the votes "tie"); at five, we can correct all two-bit errors, but not all three-bit errors.
| |
| | |
| Moreover, the repetition code is extremely inefficient, reducing throughput by three times in our original case, and the efficiency drops drastically as we increase the number of times each bit is duplicated in order to detect and correct more errors.
| |
| | |
| ==Hamming codes==
| |
| If more error-correcting bits are included with a message, and if those bits can be arranged such that different incorrect bits produce different error results, then bad bits could be identified. In a 7-bit message, there are seven possible single bit errors, so three error control bits could potentially specify not only that an error occurred but also which bit caused the error.
| |
| | |
| Hamming studied the existing coding schemes, including two-of-five, and generalized their concepts. To start with, he developed a [[wikt:nomenclature|nomenclature]] to describe the system, including the number of data bits and error-correction bits in a block. For instance, parity includes a single bit for any data word, so assuming [[ASCII]] words with 7-bits, Hamming described this as an ''(8,7)'' code, with eight bits in total, of which 7 are data. The repetition example would be ''(3,1)'', following the same logic. The [[code rate]] is the second number divided by the first, for our repetition example, 1/3.
| |
| | |
| Hamming also noticed the problems with flipping two or more bits, and described this as the "distance" (it is now called the ''[[Hamming distance]]'', after him). Parity has a distance of 2, so one bit flip can be detected, but not corrected and any two bit flips will be invisible. The (3,1) repetition has a distance of 3, as three bits need to be flipped in the same triple to obtain another code word with no visible errors. It can correct one bit errors or detect but not correct two bit errors. A (4,1) repetition (each bit is repeated four times) has a distance of 4, so flipping three bits can be detected, but not corrected. When three bits flip in the same group there can be situations where attempting to correct will produce the wrong code word. In general, a code with distance ''k'' can detect but not correct {{nowrap|''k'' − 1}} errors.
| |
| | |
| Hamming was interested in two problems at once; increasing the distance as much as possible, while at the same time increasing the code rate as much as possible. During the 1940s he developed several encoding schemes that were dramatic improvements on existing codes. The key to all of his systems was to have the parity bits overlap, such that they managed to check each other as well as the data.
| |
| | |
| ===General algorithm===
| |
| The following general algorithm generates a single-error correcting (SEC) code for any number of bits.
| |
| | |
| # Number the bits starting from 1: bit 1, 2, 3, 4, 5, etc.
| |
| # Write the bit numbers in binary: 1, 10, 11, 100, 101, etc.
| |
| # All bit positions that are powers of two (have only one 1 bit in the binary form of their position) are parity bits: 1, 2, 4, 8, etc. (1, 10, 100, 1000)
| |
| # All other bit positions, with two or more 1 bits in the binary form of their position, are data bits.
| |
| # Each data bit is included in a unique set of 2 or more parity bits, as determined by the binary form of its bit position.
| |
| ## Parity bit 1 covers all bit positions which have the least significant bit set: bit 1 (the parity bit itself), 3, 5, 7, 9, etc.
| |
| ## Parity bit 2 covers all bit positions which have the second least significant bit set: bit 2 (the parity bit itself), 3, 6, 7, 10, 11, etc.
| |
| ## Parity bit 4 covers all bit positions which have the third least significant bit set: bits 4–7, 12–15, 20–23, etc.
| |
| ## Parity bit 8 covers all bit positions which have the fourth least significant bit set: bits 8–15, 24–31, 40–47, etc.
| |
| ## In general each parity bit covers all bits where the bitwise AND of the parity position and the bit position is non-zero.
| |
| | |
| The form of the parity is irrelevant. Even parity is simpler from the perspective of theoretical mathematics, but there is no difference in practice.
| |
| | |
| This general rule can be shown visually:
| |
| | |
| :{| class="wikitable" style="text-align:center;"
| |
| |-
| |
| !colspan="2"| Bit position
| |
| ! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7 !! 8 !! 9 !! 10 !! 11 !! 12 !! 13 !! 14 !! 15 !! 16 !! 17 !! 18 !! 19 !! 20
| |
| |rowspan="7"| ...
| |
| |-
| |
| !colspan="2"| Encoded data bits
| |
| !style="background-color: #90FF90;"| p1
| |
| !style="background-color: #90FF90;"| p2 !! d1
| |
| !style="background-color: #90FF90;"| p4 !! d2 !! d3 !! d4
| |
| !style="background-color: #90FF90;"| p8 !! d5 !! d6 !! d7 !! d8 !! d9 !! d10 !! d11
| |
| !style="background-color: #90FF90;"| p16 !! d12 !! d13 !! d14 !! d15
| |
| |-
| |
| !rowspan="5"|Parity<br />bit<br />coverage
| |
| !style="background-color: #90FF90;"| p1
| |
| | X || || X || || X || || X || || X || || X || || X || || X || || X || || X ||
| |
| |-
| |
| !style="background-color: #90FF90;"| p2
| |
| | || X || X || || || X || X || || || X || X || || || X || X || || || X || X ||
| |
| |-
| |
| !style="background-color: #90FF90;"| p4
| |
| | || || || X || X || X || X || || || || || X || X || X || X || || || || || X
| |
| |-
| |
| !style="background-color: #90FF90;"| p8
| |
| | || || || || || || || X || X || X || X || X || X || X || X || || || || ||
| |
| |-
| |
| !style="background-color: #90FF90;"| p16
| |
| | || || || || || || || || || || || || || || || X || X || X || X || X
| |
| |}
| |
| | |
| Shown are only 20 encoded bits (5 parity, 15 data) but the pattern continues indefinitely. The key thing about Hamming Codes that can be seen from visual inspection is that any given bit is included in a unique set of parity bits. To check for errors, check all of the parity bits. The pattern of errors, called the [[Syndrome decoding|error syndrome]], identifies the bit in error. If all parity bits are correct, there is no error. Otherwise, the sum of the positions of the erroneous parity bits identifies the erroneous bit. For example, if the parity bits in positions 1, 2 and 8 indicate an error, then bit 1+2+8=11 is in error. If only one parity bit indicates an error, the parity bit itself is in error.
| |
| | |
| As you can see, if you have <math>m</math> parity bits, it can cover bits from 1 up to <math>2^m-1</math>. If we subtract out the parity bits, we are left with <math>2^m-m-1</math> bits we can use for the data. As <math>m</math> varies, we get all the possible Hamming codes:
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| ! Parity bits !! [[Block_code#The_block_length_n|Total bits]] !! [[Block_code#The_message_length_k|Data bits]] !! Name !! [[Block_code#The_rate_R|Rate]]
| |
| |-
| |
| | 2 || 3 || 1|| Hamming(3,1) (Triple [[repetition code]]) || 1/3 ≈ 0.333
| |
| |-
| |
| | 3 || 7 || 4 || [[Hamming(7,4)]] || 4/7 ≈ 0.571
| |
| |-
| |
| | 4 || 15 || 11 || Hamming(15,11) || 11/15 ≈ 0.733
| |
| |-
| |
| | 5 || 31 || 26 ||Hamming(31,26) || 26/31 ≈ 0.839
| |
| |-
| |
| | colspan=5 align=center | ...
| |
| |-
| |
| | <math>m</math> || <math>2^m-1</math> || <math>2^m-m-1</math> || Hamming<math>(2^m-1,2^m-m-1)</math> || <math>(2^m - m - 1)/(2^m-1)</math>
| |
| |}
| |
| | |
| If, in addition, an overall parity bit (bit 0) is included, the code can detect (but not correct) any two-bit error, making a SECDED code. The overall parity indicates whether the total number of errors is even or odd. If the basic Hamming code detects an error, but the overall parity says that there are an even number of errors, an uncorrectable 2-bit error has occurred.
| |
| | |
| ==Hamming codes with additional parity (SECDED)==
| |
| Hamming codes have a minimum distance of 3, which means that the decoder can detect and correct a single error, but it cannot distinguish a double bit error of some codeword from a single bit error of a different codeword. Thus, they can detect double-bit errors only if correction is not attempted.
| |
| | |
| To remedy this shortcoming, Hamming codes can be extended by an extra parity bit. This way, it is possible to increase the minimum distance of the Hamming code to 4, which allows the decoder to distinguish between single bit errors and two-bit errors. Thus the decoder can detect and correct a single error and at the same time detect (but not correct) a double error. If the decoder does not attempt to correct errors, it can detect up to 3 errors.
| |
| | |
| This extended Hamming code is popular in computer memory systems, where it is known as SECDED ("single error correction, double error detection"). Particularly popular is the (72,64) code, a truncated (127,120) Hamming code plus an additional parity bit, which has the same space overhead as a (9,8) parity code.
| |
| | |
| ==[7,4] Hamming code==
| |
| [[Image:Hamming(7,4).svg|thumb|300px|Graphical depiction of the 4 data bits and 3 parity bits and which parity bits apply to which data bits]]
| |
| | |
| {{main|Hamming(7,4)}}
| |
| | |
| In 1950, Hamming introduced the [7,4] Hamming code. It encodes 4 data bits into 7 bits by adding three parity bits. It can detect and correct single-bit errors. With the addition of an overall parity bit, it can also detect (but not correct) double-bit errors.
| |
| | |
| ===Construction of G and H===
| |
| The matrix
| |
| <math>\mathbf{G} := \begin{pmatrix}
| |
| I_k | -A^T \\
| |
| \end{pmatrix}</math> is called a (Canonical) generator matrix of a linear (n,k) code,
| |
| | |
| and <math>\mathbf{H} := \begin{pmatrix}
| |
| A | I_{n-k} \\
| |
| \end{pmatrix}</math> is called a [[parity-check matrix]].
| |
| | |
| This is the construction of '''G''' and '''H''' in standard (or systematic) form. Regardless of form, '''G''' and '''H''' for linear block codes must satisfy
| |
| | |
| <math>\mathbf{H}\,\mathbf{G}^T = \mathbf{0}</math>, an all-zeros matrix.<ref name=Moon>Moon T. Error correction coding: Mathematical Methods and
| |
| Algorithms. John Wiley and Sons, 2005.(Cap. 3) ISBN 978-0-471-64800-0</ref>
| |
| | |
| Since [7,4,3]=[n,k,d]=[2<sup>m</sup> − 1, 2<sup>m</sup>−1-m, m]. The [[parity-check matrix]] '''H''' of a Hamming code is constructed by listing all columns of length m that are pair-wise independent.
| |
| | |
| Thus '''H''' is a matrix whose left side is all of the nonzero n-tuples where order of the n-tuples in the columns of matrix does not matter. The right hand side is just the (n-k)-[[identity matrix]].
| |
| | |
| So '''G''' can be obtained from '''H''' by taking the transpose of the left hand side of '''H''' with the identity k-[[identity matrix]] on the left hand side of '''G'''.
| |
| | |
| The code [[generator matrix]] <math>\mathbf{G}</math> and the [[parity-check matrix]] <math>\mathbf{H}</math> are:
| |
| | |
| <math>\mathbf{G} := \begin{pmatrix}
| |
| 1 & 0 & 0 & 0 & 1 & 1 & 0 \\
| |
| 0 & 1 & 0 & 0 & 1 & 0 & 1 \\
| |
| 0 & 0 & 1 & 0 & 0 & 1 & 1 \\
| |
| 0 & 0 & 0 & 1 & 1 & 1 & 1 \\
| |
| \end{pmatrix}_{4,7}</math>
| |
| | |
| and
| |
| | |
| <math>\mathbf{H} := \begin{pmatrix}
| |
| 1 & 1 & 0 & 1 & 1 & 0 & 0 \\
| |
| 1 & 0 & 1 & 1 & 0 & 1 & 0 \\
| |
| 0 & 1 & 1 & 1 & 0 & 0 & 1 \\
| |
| \end{pmatrix}_{3,7}.</math>
| |
| | |
| Finally, these matrices can be mutated into equivalent non-systematic codes by the following operations:<ref name=Moon/>
| |
| | |
| * Column permutations (swapping columns)
| |
| * Elementary row operations (replacing a row with a linear combination of rows)
| |
| | |
| ===Encoding===
| |
| Example
| |
| | |
| From the above matrix we have 2<sup>k</sup>=2<sup>4</sup>=16 codewords.
| |
| The codewords <math> \vec{x}</math> of this binary code can be obtained from <math>\vec{x}=\vec{a}G </math>. With <math>\vec{a}=a_1a_2a_3a_4 </math> with <math> a_i </math> exist in <math> F_2 </math> ( A field with two elements namely 0 and 1).
| |
| | |
| Thus the codewords are all the 4-tuples (k-tuples).
| |
| | |
| Therefore,
| |
| | |
| (1,0,1,1) gets encoded as (1,0,1,1,0,1,0).
| |
| | |
| ===[7,4] Hamming code with an additional parity bit===
| |
| [[Image:Hamming(8,4).svg|thumb|300px|The same [7,4] example from above with an extra parity bit. This diagram is not meant to correspond to the matrix H for this example.]]
| |
| | |
| The [7,4] Hamming code can easily be extended to an [8,4] code by adding an extra parity bit on top of the (7,4) encoded word (''see [[Hamming(7,4)]]'').
| |
| This can be summed up with the revised matrices:
| |
| | |
| :<math>\mathbf{G} := \begin{pmatrix} | |
| 1 & 1 & 1 & 0 & 0 & 0 & 0 & 1\\
| |
| 1 & 0 & 0 & 1 & 1 & 0 & 0 & 1\\
| |
| 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1\\
| |
| 1 & 1 & 0 & 1 & 0 & 0 & 1 & 0
| |
| \end{pmatrix}_{4,8}</math>
| |
| | |
| and
| |
| | |
| :<math>
| |
| \mathbf{H} :=
| |
| \begin{pmatrix}
| |
| 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0\\
| |
| 0 & 1 & 1 & 0 & 0 & 1 & 1 & 0\\
| |
| 0 & 0 & 0 & 1 & 1 & 1 & 1 & 0\\
| |
| 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1
| |
| \end{pmatrix}_{4,8}
| |
| .</math>
| |
| | |
| <!-- the equations here before had two (2) errors--these satisfy G*H^T=0 -->
| |
| | |
| <!-- I don't have the time to fix it myself right now, but in the format G is in after row-reduction, it changes the order -->
| |
| <!-- of the bits in the message being delivered... i.e., any of the columns of G with one hi bit will pass the data directly -->
| |
| <!-- Ex. [d1 d2 d3 d4] * G = [d1 d2 d3 d4 p1 p2 p3 p4], this is not the same as the format described immediately below it -->
| |
| <!-- where the message should be in the format [p1 p2 d1 p3 d2 d3 d4 p4] -->
| |
| | |
| Note that H is not in standard form. To obtain G, elementary row operations can be used to obtain an equivalent matrix to H in systematic form:
| |
| | |
| :<math>
| |
| \mathbf{H} =
| |
| \left(\left.\begin{array}{cccc}
| |
| 0 & 1 & 1 & 1\\
| |
| 1 & 0 & 1 & 1\\
| |
| 1 & 1 & 0 & 1\\
| |
| 1 & 1 & 1 & 0\end{array}\right|\begin{array}{cccc}
| |
| 1 & 0 & 0 & 0\\
| |
| 0 & 1 & 0 & 0\\
| |
| 0 & 0 & 1 & 0\\
| |
| 0 & 0 & 0 & 1\end{array}\right)_{4,8}
| |
| .</math>
| |
| | |
| For example, the first row in this matrix is the sum of the second and third rows of H in non-systematic form. Using the systematic construction for Hamming codes from above, the matrix A is apparent and the systematic form of G is written as
| |
| | |
| :<math>
| |
| \mathbf{G} =
| |
| \left(\left.\begin{array}{cccc}
| |
| 1 & 0 & 0 & 0\\
| |
| 0 & 1 & 0 & 0\\
| |
| 0 & 0 & 1 & 0\\
| |
| 0 & 0 & 0 & 1\end{array}\right|\begin{array}{cccc}
| |
| 0 & 1 & 1 & 1\\
| |
| 1 & 0 & 1 & 1\\
| |
| 1 & 1 & 0 & 1\\
| |
| 1 & 1 & 1 & 0\end{array}\right)_{4,8}
| |
| .</math>
| |
| | |
| The non-systematic form of G can be row reduced (using elementary row operations) to match this matrix.
| |
| | |
| The addition of the fourth row effectively computes the sum of all the codeword bits (data and parity) as the fourth parity bit.
| |
| | |
| For example, <span style="color:blue;">1011</span> is encoded into <span style="color:red;">01</span><span style="color:blue;">1</span><span style="color:red;">0</span><span style="color:blue;">011</span><span style="color:green;">0</span> where blue digits are data; red digits are parity from the [7,4] Hamming code; and the green digit is the parity added by [8,4] code.
| |
| The green digit makes the parity of the [7,4] code even.
| |
| | |
| Finally, it can be shown that the minimum distance has increased from 3, as with the [7,4] code, to 4 with the [8,4] code. Therefore, the code can be defined as [8,4] Hamming code. <!-- if we need more proof, or a citation, let me know -->
| |
| | |
| ==See also==
| |
| * [[Coding theory]]
| |
| * [[Golay code]]
| |
| * [[Reed–Muller code]]
| |
| * [[Reed–Solomon error correction]]
| |
| * [[Turbo code]]
| |
| * [[Low-density parity-check code]]
| |
| * [[Hamming bound]]
| |
| * [[Hamming distance]]
| |
| | |
| == Notes ==
| |
| {{Reflist}}
| |
| | |
| == References ==
| |
| * {{cite book
| |
| |last=Moon
| |
| |first=Todd K.
| |
| |coauthors =
| |
| |title=Error Correction Coding
| |
| |publisher=[[John Wiley & Sons]]
| |
| |year=2005
| |
| |location=[[New Jersey]]
| |
| |url=http://www.neng.usu.edu/ece/faculty/tmoon/eccbook/book.html
| |
| |isbn= 978-0-471-64800-0
| |
| }}
| |
| * {{cite book
| |
| |last=MacKay
| |
| |first=David J.C.
| |
| |authorlink=David MacKay (scientist)
| |
| |coauthors =
| |
| |title=Information Theory, Inference and Learning Algorithms
| |
| |publisher=[[Cambridge University Press]]
| |
| |date=September 2003
| |
| |location=[[Cambridge]]
| |
| |url=http://www.inference.phy.cam.ac.uk/mackay/itila/book.html
| |
| |isbn= 0-521-64298-1}}
| |
| * {{cite conference
| |
| |author=D.K. Bhattacharryya, S. Nandi
| |
| |title=An efficient class of SEC-DED-AUED codes
| |
| |pages=410–415
| |
| |booktitle=1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97)
| |
| |doi=10.1109/ISPAN.1997.645128
| |
| | |
| }}
| |
| | |
| * {{cite website
| |
| |title=Mathematical Challenge April 2013 Error-correcting codes
| |
| |publisher=[[swissQuant Group Leadership Team]]
| |
| |date=April 2013
| |
| |url=http://www.swissquant.com/data/docs/en/1463/Mathematical-Challenge-April-2013.pdf
| |
| }}
| |
| | |
| == External links ==
| |
| * [http://www.ee.unb.ca/cgi-bin/tervo/hamming.pl CGI script for calculating Hamming distances (from R. Tervo, UNB, Canada)]
| |
| | |
| {{DEFAULTSORT:Hamming Code}}
| |
| [[Category:American inventions]]
| |
| [[Category:Coding theory]]
| |
| [[Category:Error detection and correction]]
| |
| [[Category:Computer arithmetic]]
| |
| | |
| {{Link GA|de}}
| |