<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2010-02-19 11:53:39Theoretical computer science Elias Bassalygo bound Singleton bound Johnson bound Plotkin bound Linear code Hamming bound List decoding Gilbert–Varshamov bound Coding theory Mathematics Notation |
Add to Reading List |
Introduction to Coding Theory CMU: Spring 2010 | Beating the Gilbert-Varshamov Bound for Online Channels Ishay Haviv∗ Michael Langberg† AbstractDocID: 1m0GZ - View Document |
| Chapter 4 Hamming Codes In the late 1940’s Claude Shannon was developing information theory and coding as a mathematical model for communication. At the same time, Richard Hamming, a colleague of Shannon’s at Bell LDocID: a4Dz - View Document |
| Introduction to Coding Theory CMU: Spring 2010DocID: 1FMA - View Document |
| Foreword This chapter is based on lecture notes from coding theory courses taught by Venkatesan Guruswami at University at Washington and CMU; by Atri Rudra at University at Buffalo, SUNY and by Madhu Sudan at MIT.DocID: 1FJ4 - View Document |
| PDF DocumentDocID: 12xz - View Document |