What is Hamming code.?
Code
A А Seven bit even
code is received
What is the correct code ?
مه
LLLO101
2
Answers
Step-by-step explanation:
Changes made to your input should not affect the solution:
(1): "190.4" was replaced by "(1904/10)". 2 more similar replacement(s)
STEP
1
:
952
Simplify ———
5
Equation at the end of step
1
:
136 952
{———}3 - (1022)) + ———
10 5
STEP
2
:
2.1 102 = 2•3•17
(102)2 = (2•3•17)2 = 22 • 32 • 172
Equation at the end of step
2
:
136 952
{———}3 - (22•32•172)) + ———
10 5
STEP
3
:
68
Simplify ——
5
Equation at the end of step
3
:
68 952
((——)3) - (22•32•172)) + ———
5 5
STEP
4
:
4.1 68 = 22•17
(68)3 = (22•17)3 = 26 • 173
Equation at the end of step
4
:
(26•173) 952
(———————— - (22•32•172)) + ———
53 5
STEP
5
:
Rewriting the whole as an Equivalent Fraction
5.1 Subtracting a whole from a fraction
Rewrite the whole as a fraction using 53 as the denominator :
(22•32•172) (22•32•172) • 53
(22•32•172) = ——————————— = ————————————————
1 53
Equivalent fraction : The fraction thus generated looks different but has the same value as the whole
Common denominator : The equivalent fraction and the other fraction involved in the calculation share the same denominator
Adding fractions that have a common denominator :
5.2 Adding up the two equivalent fractions
Add the two equivalent fractions which now have a common denominator
Combine the numerators together, put the sum or difference over the common denominator then reduce to lowest terms if possible:
(26•173) - ((22•32•172) • 125) 26•173 - 22•32•172•53
—————————————————————————————— = —————————————————————
125 125
Equation at the end of step
5
:
(26•173 - 22•32•172•53) 952
——————————————————————— + ———
125 5
Answer:
Hamming Code in Computer Network
Hamming code is a set of error-correction codes that can be used to detect and correct the errors that can occur when the data is moved or stored from the sender to the receiver. It is technique developed by R.W. Hamming for error correction.
Redundant bits –
Redundant bits are extra binary bits that are generated and added to the information-carrying bits of data transfer to ensure that no bits were lost during the data transfer.
The number of redundant bits can be calculated using the following formula:
2^r ≥ m + r + 1
where, r = redundant bit, m = data bit