Coding and Information TheoryPrentice-Hall, 1986 - 259ÆäÀÌÁö Focusing on both theory and practical applications, this volume combines in a natural way the two major aspects of information representation--representation for storage (coding theory) and representation for transmission (information theory). |
¸ñÂ÷
ErrorDetecting Codes | 20 |
ErrorCorrecting Codes | 34 |
Huffman Codes | 51 |
ÀúÀÛ±Ç | |
Ç¥½ÃµÇÁö ¾ÊÀº ¼½¼Ç 11°³
±âŸ ÃâÆÇº» - ¸ðµÎ º¸±â
ÀÚÁÖ ³ª¿À´Â ´Ü¾î ¹× ±¸¹®
a©û arbitrarily average code length b©û bandwidth binary digits binary symmetric channel block code bound channel capacity Chapter code book code word coding theory coefficients column conditional entropy correct corresponding decoding tree detection distribution double-error encoded message entropy function equation error-correcting codes error-detecting code example Exercises Figure frequency Gibbs inequality given Gray code Hamming codes hence Huffman code I(a©û information theory input symbols instantaneous code integral joint entropy Kraft inequality log2 loge Markov process matrix maximum means message positions modulus polynomial mutual information nth extension number of 1's occur octal original p(a©û P(ba p(Si p©û parity check possible prime polynomial probability radius radix received message receiving end Section sent Shannon-Fano coding signaling system simple single error single-error-correcting source alphabet source symbols sphere storage Suppose syndrome term theorem uniquely decodable variable white noise zero ¥ë¥ç

