1 Zigzag Codes: MDS Array Codes with Optimal Rebuilding Itzhak Tamo∗ † , Zhiying Wang∗ , and Jehoshua Bruck∗ Engineering Department, California Institute of Technology, Pasadena, CA 91125, USA

First Page		Document Content
Date: 2012-01-09 16:57:54 Coding theory Mathematics Discrete mathematics Erasure code Permutation MDS matrix Linear subspace Hamming code ReedSolomon error correction		1 Zigzag Codes: MDS Array Codes with Optimal Rebuilding Itzhak Tamo∗ † , Zhiying Wang∗ , and Jehoshua Bruck∗ Engineering Department, California Institute of Technology, Pasadena, CA 91125, USA Add to Reading List Source URL: paradise.caltech.edu Download Document from Source Website File Size: 466,00 KB Share Document on Facebook

	INTERSECTED LOW-DENSITY PARITY-CHECK AND CONVOLUTIONAL CODES Edward A. Ratzer Cavendish Laboratory, University of Cambridge, Cambridge Key words to describe this work: Low-density parity-check (LDPC) codes, convolutional DocID: 1riYP - View Document
	6536 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 61, NO. 12, DECEMBER 2015 Optimal Achievable Rates for Interference Networks With Random Codes DocID: 1pWdo - View Document
	Intersected low-density parity-check and convolutional codes Edward A. Ratzer Cavendish Laboratory, University of Cambridge Madingley Road, Cambridge CB3 0HE Abstract DocID: 1pr57 - View Document
	Spectral Graph Theory Lecture 11 Introduction to Coding Theory Daniel A. Spielman DocID: 1p98C - View Document
	Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes, DocID: 1p3uS - View Document