Stephan R. Cavior

Learn More
-Suppose 0 I i, j I 2” 1. We prove that, if i, j are encoded as binary Gray codewords whose Hamming distance is M 2 1, then Ii jl < 2” 2m/3. In [I], Yuen finds a lower bound on the signal error that produces an m-bit error in its Gray codeword. Denoting the Gray codeword for i by g(i), he proves that if the Hamming distance between g(i) and g(j) is m 2 1,(More)
  • 1