Algorithms on strings, trees, and sequences: computer science and computational biology eBook

$12.00

  • Delivery: Can be download immediately after purchasing. For new customer, we need process for verification from 30 mins to 24 hours.
  • Version: PDF/EPUB. If you need another version, please Contact us
  • Quality: Full page, full content, high quality images, searchable text and you can print it.
  • Compatible Devices: Can be read on any devices (Kindle, NOOK, Android/IOS devices, Windows, MAC,..).
  • e-Book Features: Purchase and read your book immediately, access your eTextbook anytime and anywhere, unlimited download and share with friends.
  • Note: If you do not receive the download link within 15 minutes of your purchase, please Contact us. Thank you!

Error-correcting codes constitute one of the key ingredients in achieving the high degree of reliability required in modern data transmission and storage systems. This book introduces the reader to the theoretical foundations of this subject with the emphasis on the Reed-Solomon codes and their derivatives. Linear codes — Introduction to finite fields — Bounds on the parameters of codes — Reed-Solomon and related codes — Decoding of Reed-Solomon codes — Structure of finite fields — Cyclic codes — List decoding of Reed-Solomon codes — Codes in the Lee metric — MDS codes — Concatenated codes — Graph codes — Trellis and convolutional codes — Basics in modern algebra

Reviews

There are no reviews yet.

Be the first to review “Algorithms on strings, trees, and sequences: computer science and computational biology eBook”

Your email address will not be published. Required fields are marked *