Robust Locally Testable Codes and Products of Codes Eli Ben-Sasson1 and Madhu Sudan2

First Page		Document Content
Date: 2010-10-24 16:07:58 Linear code Reed–Solomon error correction Symbol Expander code AN codes Coding theory Error detection and correction Finite fields		Robust Locally Testable Codes and Products of Codes Eli Ben-Sasson1 and Madhu Sudan2 Add to Reading List Source URL: people.csail.mit.edu Download Document from Source Website File Size: 186,66 KB Share Document on Facebook

	Lecture 9: Tues Feb 14: Superdense Coding OK, now on to some new stuff! Superdense Coding is the first protocol we’ll see that requires entanglement. Basic information theory (Shannon) tells us that “by sending bits, DocID: 1xVqR - View Document
	QcBits: constant-time small-key code-based cryptography Tung Chou Technische Universiteit Eindhoven, The Netherlands Coding theory DocID: 1vexc - View Document
	a Cimpa-ICTP research school on Lattices and application to cryptography and coding theory Saigon University, Ho Chi Minh City, August 1st-12th 2016 International Participants 1 Ankur DocID: 1uNEl - View Document
	Preventing Pollution Attacks in Multi-Source Network Coding Dan Boneh† Stanford University, USA Shweta Agrawal∗ DocID: 1uibH - View Document