Product Overview
Channel Codes: Classical And Modern
Lin , Shu Lin, William Ryan and Ryan
Hardback
This title is IN STOCK and will be shipped direct to you within 24-48 hours of you placing your order.
You should expect to receive this within 10-15 working days after dispatch.
Shipping from our overseas suppliers directly to you and sent via International Post
More delivery infoShips in 24-48 hours directly to you - Typically received in 10-15 working days after dispatch
Price: $188.95
Channel Codes: Classical And Modern
Synopsis
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. Known for their writing clarity, Professors Ryan and Lin provide the latest 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.
Product Details
- ISBN:
- 9780521848688
- Category:
- Coding Theory & Cryptology
- Format:
- Hardback
- Publication Date:
- 2009-09-17
- Publisher:
- Cambridge University Press
- Illustrations:
- 35 tables 250 exercises
- Country of origin:
- United Kingdom
- Pages:
- 708
- Pagination:
- 708 pages, 35 tables 250 exercises
- Dimensions (mm):
- 247x174x35mm
- Weight:
- 1500g
Customer Reviews
Average rating from customers
-
Be the first to review Channel Codes: Classical And Modern








