top button
Flag Notify
Site Registration

What is Hamming code problem in algorithm?

+2 votes
243 views

What is Hamming code problem and what is its application. Please explain in detail.

posted Dec 6, 2015 by Rajan Paswan

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

+1 vote

There are two types are error controling techniques one is error detection and another is error correction.

Hamming code is a set of error-correction code's that can be used to detect and correct bit errors that can occur when computer data is moved or stored. It was introduced by Hamming In 1950 ([7,4] Hamming code) It encodes four data bits into seven 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.

Check the following link for the full algo https://en.wikipedia.org/wiki/Hamming_code#Hamming_codes

answer Dec 6, 2015 by Tapesh Kulkarni
Similar Questions
0 votes

I am looking for the best algorithm to complete tower of hanoi problem along with C/C++ code, any help would be great support for my interview?

+1 vote

But when priority(distance) are changed of vertex.So I have to search those vertex in priority queue(MIN heap) which distance are updated.How to find position of that vertex in binary min heap because find operation are not present in binary min heap?

0 votes

We have a long string. We label some substrings with tags.
- A tag entry is [startIndex, endIndex, tag].
- Query: 1 or more tags
- Output: all blocks/ranges with all queried tags.

Example tag entries: [23, 72, 0]
// label [23, 72) with tag 0 [34, 53, 1]
// label [34, 53) with tag 1 [100, 128, 0]

Query and Output: 0 => [23, 72], [100, 128] 0,1 => [34,53]
// [34, 53) matches both tag 0 and 1

Give an efficient algorithm. Please describe your algorithm before posting code.

...