Coding and Information Theory

a₁ ASCII code average code length b₁ bandwidth binary digits binary symmetric channel channel capacity Chapter check bit code word coefficients column conditional entropy corresponding decoding tree encoded message entropy function equation equipment error-correcting code error-detecting code example Exercises Figure frequency given Gray code H₂(S Hamming code Huffman code information theory input symbols instantaneous code Kraft inequality log₂ Markov process matrix maximum means message positions minimum distance modulo mutual information n-dimensional nth extension number of 1's number of errors occur octal odd number original P₁ P₂ parity check prime polynomial probability problem radix received message receiving end rectangular codes redundancy reliable remainder reserved symbol s₁ Section sent sequence Shannon-Fano coding Shannon's signaling system simple single error correction source alphabet source symbols space sphere storage Suppose syndrome term theorem tion transmission uniquely decodable white noise zero