Channel Codes

Classical and Modern

Nonfiction, Science & Nature, Technology, Engineering, Mathematics
Cover of the book Channel Codes by William Ryan, Shu Lin, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: William Ryan, Shu Lin ISBN: 9781139931205
Publisher: Cambridge University Press Publication: September 17, 2009
Imprint: Cambridge University Press Language: English
Author: William Ryan, Shu Lin
ISBN: 9781139931205
Publisher: Cambridge University Press
Publication: September 17, 2009
Imprint: Cambridge University Press
Language: English

Channel coding lies at the heart of digital communication and data storage, and this detailed introduction describes the core theory as well as decoding algorithms, implementation details, and performance analyses. In this book, Professors Ryan and Lin provide clear information on modern channel codes, including turbo and low-density parity-check (LDPC) codes. They also present detailed coverage of BCH codes, Reed-Solomon codes, convolutional codes, finite geometry codes, and product codes, providing a one-stop resource for both classical and modern coding techniques. Assuming no prior knowledge in the field of channel coding, the opening chapters begin with basic theory to introduce newcomers to the subject. Later chapters then extend to advanced topics such as code ensemble performance analyses and algebraic code design. 250 varied and stimulating end-of-chapter problems are also included to test and enhance learning, making this an essential resource for students and practitioners alike.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Channel coding lies at the heart of digital communication and data storage, and this detailed introduction describes the core theory as well as decoding algorithms, implementation details, and performance analyses. In this book, Professors Ryan and Lin provide clear information on modern channel codes, including turbo and low-density parity-check (LDPC) codes. They also present detailed coverage of BCH codes, Reed-Solomon codes, convolutional codes, finite geometry codes, and product codes, providing a one-stop resource for both classical and modern coding techniques. Assuming no prior knowledge in the field of channel coding, the opening chapters begin with basic theory to introduce newcomers to the subject. Later chapters then extend to advanced topics such as code ensemble performance analyses and algebraic code design. 250 varied and stimulating end-of-chapter problems are also included to test and enhance learning, making this an essential resource for students and practitioners alike.

More books from Cambridge University Press

Cover of the book Patronal Politics by William Ryan, Shu Lin
Cover of the book Plants of Oceanic Islands by William Ryan, Shu Lin
Cover of the book Reinhold Niebuhr and His Circle of Influence by William Ryan, Shu Lin
Cover of the book The Politics of Nation-Building by William Ryan, Shu Lin
Cover of the book In Search of the True Universe by William Ryan, Shu Lin
Cover of the book Romantic Reformers and the Antislavery Struggle in the Civil War Era by William Ryan, Shu Lin
Cover of the book Subaltern Lives by William Ryan, Shu Lin
Cover of the book A Clinician's Guide to Statistics and Epidemiology in Mental Health by William Ryan, Shu Lin
Cover of the book The Logic of Slavery by William Ryan, Shu Lin
Cover of the book New Handbook of Mathematical Psychology: Volume 2, Modeling and Measurement by William Ryan, Shu Lin
Cover of the book Aggregation Functions by William Ryan, Shu Lin
Cover of the book Meditation in Modern Buddhism by William Ryan, Shu Lin
Cover of the book The Material World of Ancient Egypt by William Ryan, Shu Lin
Cover of the book Picturing Quantum Processes by William Ryan, Shu Lin
Cover of the book Reading Sartre by William Ryan, Shu Lin
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy