Student edition of the classic text in information and coding theoryExample 8.15 Any binary Hamming code, with m = 2m - 1, r a m, and g(x) = a primitive polynomial of degree m, is a b = 1 burst-error-correcting code. (Any error vector of weight 1 is ipso facto a burst of length 1.) The strong Abramson bound is anbsp;...
|Title||:||The Theory of Information and Coding|
|Author||:||R. J. McEliece|
|Publisher||:||Cambridge University Press - 2004-07-15|