# Give the Hamming Even Parity SEC for the following bits 1011 1101 00

Content type
User Generated
Rating
Showing Page:
1/7
Give the Hamming Even Parity SEC for the following bits:
1011 1101 0001. Identify which bit positions will be parity
bits. Show your work. Given the following Hamming Even
Parity SEC encoded bits: 0111 1110 0111 One of the bits
bit is an error. Show which bit is an error, and show the
non-hamming encoded original 8 bits of correct data. Show
which bits are parity bits. Show your work.
Solution
Hamming Code:
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 Code Structure:
The Structure contains two types of bits
1. Data Bits
2. Parity Bits
1. Data Bits:
These bits are actual data that needs to taken into
consideration while sending across a Network. These bits
are placed in remaining places other than Parity bits

Showing Page:
2/7
2. Parity Bits:
These bits are generated using the Data Bits and
they wil be used for Error detection and Correction after
receiving at other end of Network. These bits are placed in
positions of 2n-1 as n is the number of parity bits.
Caluculating Procedure:
1. Place the position of bits accoring to their category
and the number of parity bits in data depends on how
many poer of 2 positions that dta length can hold.
2. Take the values as follows For a parity do the
following steps
1. consider parity position as n
2. take n bits from position n and then skip n
positions
3. repeat the above steps until length of data ends
1\'s for each row
4. place the result as 1 if the count is even and 0 if it is
odd.
5. If we compare the resultant bits with the parity bits
the data should match otherwise there is an error in data.
6. if we got an error then add positions of Parity error

Showing Page:
3/7

End of Preview - Want to read all 7 pages?
Access Now
Unformatted Attachment Preview
Give the Hamming Even Parity SEC for the following bits: 1011 1101 0001. Identify which bit positions will be parity bits. Show your work. Given the following Hamming Even Parity SEC encoded bits: 0111 1110 0111 One of the bits bit is an error. Show which bit is an error, and show the non-hamming encoded original 8 bits of correct data. Show which bits are parity bits. Show your work. Solution Hamming Code: 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 Code Structure: The Structure contains two types of bits 1. Data Bits 2. Parity Bits 1. Data Bits: These bits are actual data that needs to taken into consideration while sending across a Network. These bits are placed in remaining places other than Parity bits 2. Parity Bits: These bits are generated using the Data Bits and they wil be used for Error detection and Correction after receiving at other end of Network. These bits are placed in positions of 2n-1 as n is the number of parity bits. Caluculating Procedure: 1. Place the position of bits accoring to their category and the number of parity bits in data depends on how many poer of 2 positions that dta length can hold. 2. Take the values as follows For a parity do the following steps 1. consider parity position as n 2. take n bits from position n and then skip n posit ...
Purchase document to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

### Review

Anonymous
I was having a hard time with this subject, and this was a great help.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4