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

	INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE List-decoding of binary Goppa codes up to the binary Johnson bound Daniel Augot — Morgan Barbier — Alain Couvreur DocID: 1uEKU - View Document
	Dimensionality Reduction: beyond the Johnson-Lindenstrauss bound∗ Yair Bartal† Ben Recht‡ DocID: 1lUXQ - View Document
	Ultra-Low-Dimensional Embeddings for Doubling Metrics T-H. Hubert Chan∗ Anupam Gupta† Abstract DocID: 15uQp - View Document
	Seattle Repertory Theatre and Newspapers In Education present JOHNSON’S LEGACY TODAY: DO WE LIVE IN A GREAT SOCIETY? DocID: XJDD - View Document
	Seattle Repertory Theatre and Newspapers In Education present JOHNSON’S LEGACY TODAY: DO WE LIVE IN A GREAT SOCIETY? DocID: Jcrs - View Document