When transmitting data, the Hamming code apparently allows you to recreate data that has been corrupted over the wire (an error correcting code). How does this work and what are its limitations, if any? Are there any better solutions for error correction (as opposed to retransmission)? Are there circumstances where retransmission is be...
For a Data Structures project, I must find the shortest path between two words (like "cat" and "dog), changing only one letter at a time. We are given a Scrabble word list to use in finding our path. For example: cat -> bat -> bet -> bot -> bog -> dog I've solved the problem using a breadth first search, but am seeking something bette...
hamming('10101010','01010101') The result of the above should be 8. How to implement it? ...
Hi guys, How to find the Hamming distance of a code generated by a certain CRC? Assume that I have a generating polynomial of order, say, 4 and 11 bits of data. How to compute the HD basing only on these information? Cheers. ...
Hi guys, Let's assume I want to have a possibility of detecting 4-bit errors and recovering 2-bit errors. What the Hamming distance should be then? I wonder if it should be d = Max{2r+1, r+1} or d = s + r, where s is 4 and r is 2? Thanks in advance for the reply! Cheers ...
Input: Graph G Output: several independent sets, so that the membership of a node to all independent sets is unique. A node therefore has no connections to any node in its own set. Here is an example path. since clarification was called for here another re phrasal: divide a given graph into sets so that i can tell a node from all oth...
Hi guys, I was reading about error detection and stumbled upon a statement which I didn't quite understand. The statement said "for a k bit string we need lg k parity bits to detect 2 bit errors".where lg is log to the base 2 I couldn't quite understand why this is true, is there any formal derivation that confirms this. The name of t...
Hi Guys, I was reading about horizontal and vertical parity check codes. One of the properties of these codes is that the final parity check (the lower right bit) is equal to modulo 2 sum of horizontal parity checks and also equal to modulo 2 of sum of vertical parity checks. I did not understand, why this is true. I can see them in t...