Introduction to Coding Theory CMU: Spring 2010

First Page		Document Content
Date: 2010-02-19 11:53:39 Theoretical computer science Elias Bassalygo bound Singleton bound Johnson bound Plotkin bound Linear code Hamming bound List decoding Gilbert–Varshamov bound Coding theory Mathematics Notation		Introduction to Coding Theory CMU: Spring 2010 Add to Reading List Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 584,31 KB Share Document on Facebook

	11 JuneSINGLE-QUERY LEARNING FROM ABELIAN AND NON-ABELIAN HAMMING DISTANCE ORACLES David A. Meyer∗ and James Pommersheim∗,† DocID: 13Gld - View Document
	Chapter 6 Modifying Codes If one code is in some sense good, then we can hope to find from it similar and related codes that are also good. In this chapter we discuss some elementary methods for modifying a code in orde DocID: 9RRh - View Document
	Introduction to Coding Theory CMU: Spring 2010 DocID: 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