(15,11) Hamming Code, too work out how to calculate check digits

  • Thread starter jackscholar
  • Start date
  • Tags
    Code Work
To find the amount of check digits in a (15,11) hamming code, you can use the formula c= log2(n+1), where c is the number of check digits and n is the total number of bits. In this case, n=15, so c= log2(15+1)=log2(16)=4. Therefore, the amount of check digits in a (15,11) hamming code is four. In summary, to find the amount of check digits in a (15,11) hamming code, you can use the formula c= log2(n+1), where c is the number of check digits and n is the total number of bits. In this case, n
  • #1
jackscholar
75
0

Homework Statement


I need to figure out how to find out the amount of check digits in a (15,11) hamming code. I know the amount of check digits is four and the amount of information digits is 7 but I don't know how to figure out how to get the answer, I only have the answer.

Homework Equations


I was given the equation n=4+c
n=2^c - 1
4+c=2^c-5
c=2^c-5

The Attempt at a Solution


I do not understand how the equation above is possible, so i could not figure out how the result c=2^c-5 was achieved
 
Last edited:
Physics news on Phys.org
  • #2
Normally a (15,11) hamming code would mean 15 total bits, 11 of which are data.
 

FAQ: (15,11) Hamming Code, too work out how to calculate check digits

How does the (15,11) Hamming Code work?

The (15,11) Hamming Code is a type of error-correcting code used in data transmission to detect and correct errors. It works by adding extra bits, called check digits, to a data block of 11 bits. These check digits help to identify and correct any bit errors that may occur during transmission.

What is the formula for calculating check digits in the (15,11) Hamming Code?

The formula for calculating check digits in the (15,11) Hamming Code is as follows: C1 = D1 + D2 + D3 + D4 + D5 + D6 + D7 + D8 + D9 + D10 + D11, C2 = D1 + D2 + D3 + D6 + D7 + D8 + D11, C3 = D1 + D4 + D5 + D6 + D9 + D10 + D11, C4 = D2 + D4 + D5 + D8 + D9 + D10 + D11. Where C1-C4 are the check digits and D1-D11 are the data bits.

How many errors can the (15,11) Hamming Code correct?

The (15,11) Hamming Code can correct up to two errors in a data block of 11 bits. If more than two errors occur, the code may not be able to correct them and will instead detect them as uncorrectable errors.

How are check digits used to detect and correct errors in the (15,11) Hamming Code?

The check digits in the (15,11) Hamming Code are used to detect errors by calculating the sum of the data bits and comparing it to the corresponding check digit. If the two do not match, it means there is an error in the data. The check digits are also used to correct errors by flipping the incorrect bit(s) to make the sum match the check digit.

Can the (15,11) Hamming Code be used for all types of data?

The (15,11) Hamming Code can be used for any type of data that can be represented by 11 bits, such as binary numbers, alphanumeric characters, and even images. However, it is most commonly used for digital communication and storage systems to ensure the accuracy of transmitted or stored data.

Similar threads

Replies
11
Views
1K
Replies
7
Views
2K
Replies
2
Views
1K
Replies
19
Views
2K
Replies
3
Views
2K
Replies
11
Views
2K
Back
Top