![9786130216900: Levenshtein Distance: Information theory, Computer science, String (computer science), String metric, Damerau?Levenshtein distance, Spell checker, Hamming distance - AbeBooks: 6130216904 9786130216900: Levenshtein Distance: Information theory, Computer science, String (computer science), String metric, Damerau?Levenshtein distance, Spell checker, Hamming distance - AbeBooks: 6130216904](https://pictures.abebooks.com/isbn/9786130216900-us.jpg)
9786130216900: Levenshtein Distance: Information theory, Computer science, String (computer science), String metric, Damerau?Levenshtein distance, Spell checker, Hamming distance - AbeBooks: 6130216904
I've heard two explanations of Hamming codes, keeping track of parity bits vs encoding a message as part of a nullspace and checking if the received message is still in the nullspace.
![Buy Coding Theory: Reed-Solomon Error Correction, Hamming Code, Prefix Code, Bch Code, Hamming Distance, Binary Symmetric Channel book : Source Wikipedia,LLC Books,LLC Books , 1156945763, 9781156945766 - SapnaOnline.com India Buy Coding Theory: Reed-Solomon Error Correction, Hamming Code, Prefix Code, Bch Code, Hamming Distance, Binary Symmetric Channel book : Source Wikipedia,LLC Books,LLC Books , 1156945763, 9781156945766 - SapnaOnline.com India](https://cdn01.sapnaonline.com/bk_images/766/9781156945766.jpg)