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

	Bounds on List Decoding of Rank Metric Codes Antonia Wachter-Zeh Institute of Communications Engineering, Ulm University, Ulm, Germany and Institut de Recherche Math´ ematique de Rennes (IRMAR), Universit´ DocID: 1vnJD - View Document
	A Complete List of Genes, Binary Decoding Tapes, and Decimal Codes of the 1882 LSBF that Can be Realized via a CNN of Four Input Variables FANGYUE CHEN ∗ DocID: 1vnvL - View Document
	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
	Universal compression, list decoding, and logarithmic loss Yanina Shkel, Maxim Raginsky, and Sergio Verd´u Abstract—Universal lossy source coding under the logarithmic loss (log-loss) criterion is studied. Bounds on t DocID: 1uxOt - View Document
	1 Bounds on List Decoding Gabidulin Codes Antonia Wachter-Zeh Institute of Communications Engineering, Ulm University, Ulm, Germany and Institut de Recherche Math´ematique de Rennes, Universit´e de Rennes 1, Rennes, F DocID: 1u4uQ - View Document