Channel Codes

Channel Codes

EnglishHardback
Ryan William
Cambridge University Press
EAN: 9780521848688
On order
Delivery on Thursday, 30. of July 2026
CZK 2,424
Common price CZK 2,693
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

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.
EAN 9780521848688
ISBN 0521848687
Binding Hardback
Publisher Cambridge University Press
Publication date September 17, 2009
Pages 710
Language English
Dimensions 252 x 176 x 35
Country United Kingdom
Readership Tertiary Education
Authors Lin Shu; Ryan William
Illustrations Worked examples or Exercises
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.