2001
Introduction to the Special Issue on Codes on Graphs and Iterative Algorithms
Frey B, Koetter R, Forney G, Kschischang F, Mceliece R, Spielman D. Introduction to the Special Issue on Codes on Graphs and Iterative Algorithms. IEEE Transactions On Information Theory 2001, 47: 493. DOI: 10.1109/tit.2001.910571.Peer-Reviewed Original ResearchEfficient Erasure Correcting Codes
Luby M, Mitzenmacher M, Shokrollahi M, Spielman D. Efficient Erasure Correcting Codes. IEEE Transactions On Information Theory 2001, 47: 569. DOI: 10.1109/18.910575.Peer-Reviewed Original ResearchImproved Low-Density Parity-Check Codes Using Irregular Graphs
Luby M, Mitzenmacher M, Shokrollahi M, Spielman D. Improved Low-Density Parity-Check Codes Using Irregular Graphs. IEEE Transactions On Information Theory 2001, 47: 585. DOI: 10.1109/18.910576.Peer-Reviewed Original ResearchLow-density parity-check (LDPC) codesParity-check codesDensity Parity-Check CodesIrregular codesBelief propagationGallager's low-density parity-check codesSuch decoding algorithmsIrregular low-density parity-check (LDPC) codesHard-decision decodingError-correcting codesIrregular parity-check matrixParity-check matrixBinary symmetric channelDecoding algorithmTurbo codesIrregular graphsCode performanceResults of experimentsNew rigorous analysisGaussian channelTurbo code performanceCodeRigorous analysisEfficient methodIrregular structure
1999
Constructing Error-Correcting Codes from Expander Graphs
Spielman D. Constructing Error-Correcting Codes from Expander Graphs. The IMA Volumes In Mathematics And Its Applications 1999, 109: 591-600. DOI: 10.1007/978-1-4612-1544-8_25.Peer-Reviewed Original Research
1998
Models of computation in coding theory
Spielman D. Models of computation in coding theory. 2013 IEEE Conference On Computational Complexity 1998, 120. DOI: 10.1109/ccc.1998.694597.Peer-Reviewed Original Research
1997
The complexity of error-correcting codes
Spielman D. The complexity of error-correcting codes. Lecture Notes In Computer Science 1997, 1279: 67-84. DOI: 10.1007/bfb0036172.Peer-Reviewed Original Research
1996
Expander codes
Sipser M, Spielman D. Expander codes. IEEE Transactions On Information Theory 1996, 42: 1710-1722. DOI: 10.1109/18.556667.Peer-Reviewed Original ResearchHighly fault-tolerant parallel computation
Spielman D. Highly fault-tolerant parallel computation. 2011 IEEE 52nd Annual Symposium On Foundations Of Computer Science 1996, 154-163. DOI: 10.1109/sfcs.1996.548474.Peer-Reviewed Original ResearchParallel computationComputational devicesReed-Solomon codesFault-tolerant computationError-correcting codesSmall overheadWrong outputValid inputsW processorsProcessorsMachineComputationSequential timeFaulty machineConstant factorCodeConstant probabilityFault-tolerant machineOverheadTime stepInputDevicesFailure probabilityOutputModel
1994
Expander codes
Sipser M, Spielman D. Expander codes. 1994, 566-576. DOI: 10.1109/sfcs.1994.365734.Peer-Reviewed Original Research