This text is an introduction to the subjects of information and coding theory at the graduate or advanced undergraduate level. It assumes a basic knowledge of probability and linear algebra, but is otherwise self-contained. The first quarter of the book is devoted to the basics of information theory, including a proof of Shannon's famous Noisy Coding Theorem. The remainder of the book is devoted to coding theory and has a decidedly algebraic flavour. After a brief discussion of general families of codes, the authors discuss linear codes, (including the Hamming, Golay, and Reed-Miller codes), finite fields and cyclic codes. An appendix reviews relevant topics from modern algebra.
"Sinopsis" puede pertenecer a otra edición de este libro.
This text is an introduction to the subjects of information and coding theory at the graduate or advanced undergraduate level. It assumes a basic knowledge of probability and linear algebra, but is otherwise self-contained. The first quarter of the book is devoted to the basics of information theory, including a proof of Shannon's famous Noisy Coding Theorem. The remainder of the book is devoted to coding theory and has a decidedly algebraic flavour. After a brief discussion of general families of codes, the authors discuss linear codes, (including the Hamming, Golay, and Reed-Miller codes), finite fields and cyclic codes. An appendix reviews relevant topics from modern algebra.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Greenworld Books, Arlington, TX, Estados Unidos de America
Condición: good. Fast Free Shipping â" Good condition. It may show normal signs of use, such as light writing, highlighting, or library markings, but all pages are intact and the book is fully readable. A solid, complete copy that's ready to enjoy. Nº de ref. del artículo: GWV.3540978127.G
Cantidad disponible: 1 disponibles