Questions tagged [hamming-code]

Refers to a class of linear error-correcting data encoding schemes, but is often used to refer to the specific scheme Hamming(7,4) invented in 1950 by Richard W. Hamming.

In telecommunication theory, Hamming codes refer to a family of linear error-correcting codes that generalize the 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 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 3.1


  1. I basically ripped this out of the wikipedia page.
96 questions
2
votes
2 answers

Computing Hamming code

I'm a bit confused about computing Hamming code. In Wikipedia article it is written: 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. How does that possible to…
Vladimir Keleshev
  • 13,753
  • 17
  • 64
  • 93
2
votes
0 answers

Creating a simple SECEncoder and SECDecoder in scala

I've been assigned a task where I have to create a SECEncoder in scala that encodes a 32-bit word into a 40-bit word where the least significant digits of the 40-bit word is the 32-bit word. The SECDecoder should be able to return the same 32-bit…
Cookie
  • 21
  • 2
2
votes
2 answers

When should hamming codes be used and when is crc better?

Following are the things that I already know about these: Hamming codes can be used both to detect and correct errors, while in crc errors can only be detected. CRC is used in communication while Hamming code is used to detect errors in memory…
user5951764
  • 33
  • 1
  • 7
2
votes
1 answer

Bit Sequence to ASCII to String

I'm trying to simulate a Hamming-Code 4,7 which is working properly. I'm working with boolean arrays insted of really bits to simplify it a bit logically. I input some Characters, there converted to ASCII and the Simulation goes on. After all I end…
user5544265
2
votes
2 answers

Hamming Code: Number of parity bits

I'm trying to write a method in java that will take an input of any number of 0 or 1 digits and output that line after being encoded with Hamming Code. I have managed to write the code when knowing the number of digits the input will have (in this…
Dimebag
  • 833
  • 2
  • 9
  • 29
2
votes
1 answer

Even/odd parity in hamming code

If a message, say two bytes, has been received, and it's known to have been encoded using Hamming code, but the parity used for encoding (even / odd) is not known, would the application of both Hamming code with odd and even parity work to identify…
Rubens
  • 14,478
  • 11
  • 63
  • 92
2
votes
1 answer

Hamming Code Confusion

I am having difficulty answering this problem. Here is the original question: A word is encoded with check bits 0111 (c8, c4, c2, and c1). The word is read back as 11101011 (data). What is the original data word? I thought that since there are 4…
Wh1t3gh0st
  • 23
  • 4
1
vote
4 answers

Generation of a Hamming Series

I have been trying to solve a programming problem, one of the modules of which requires me to generate Hamming sequences. The function takes input two numbers first a binary number N and another a decimal number K. It should now generate all…
uyetch
  • 2,150
  • 3
  • 28
  • 33
1
vote
3 answers

How to correct a message using Hamming Code

So I want to work on this summer project to correct errors in a message transmission using Hamming Code, but I cannot figure out how it really works. I've read many articles online, but I don't really understand the algorithm. Can anybody explain…
user69514
  • 26,935
  • 59
  • 154
  • 188
1
vote
0 answers

base32 with included forward error correction (FEC)?

I am trying to find (or pipe together) a way to encrypt text so that the output is base32 encoded and protected by forward error correction against lost characters. Having some some base32 output like NBSWY3DPEB3W64TMMQXAU=== I would like to…
Christian
  • 1,212
  • 1
  • 15
  • 30
1
vote
0 answers

Is there a function that determins the minimum distance of the code

is there mathlabs functions that when given (n,k) of a generalized array code it is able to generate all non-zero code words using (n,k) then find the minimum distance of the code, and determine the error detection capability td and error correction…
Swag lord
  • 19
  • 1
1
vote
0 answers

How does encoding algorithm handle separate bit blocks

I am learning about how Hamming code works. In low level encoding/decoding what are the protocols to separate code blocks? Let's say you have a (15, 11) Hamming code block, do you add extra bits in-between to separate them? Also what if on the last…
wileypoots
  • 31
  • 2
1
vote
0 answers

How can I rewrite hamming code (7, 4) to (63, 57)

I have found hamming code (7, 4) I guess... but how to rewrite it to (63, 57). If I have (7, 4) I enter 4 bits (3 redundant bits). So in (63, 57) I have to enter 57 bits?(from keyboard?) (6 redundant bits) The code that I…
Lex
  • 137
  • 1
  • 10
1
vote
2 answers

Hamming Window, python 2.7

Hi I have a FFT which is quite noisy. How to apply to my code Hamming window to make it less noisy. Look at my code: plt.subplot(212) plt.title('Fast Fourier Transform') plt.ylabel('Power [a.u.]') plt.xlabel('Frequency Hz') fft1 = (Bx[51:-14]) fft2…
Hiddenguy
  • 547
  • 13
  • 33
1
vote
0 answers

How to compute hamming code for 10 bits?

I have seen examples of hamming code detection and correction with 8 bits or 12 bits. Suppose I had the bit string: 1101 0110 11 which contains 10 bits. Do I need to add two additional bits to that bit string to complete the nibble? If so do I add…
John
  • 93
  • 2
  • 8