Shashi Kiran Chilappagari

According to our database1, Shashi Kiran Chilappagari authored at least 28 papers between 2006 and 2012.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
On the Construction of Structured LDPC Codes Free of Small Trapping Sets.
IEEE Trans. Inf. Theory, 2012

2011
An Efficient Instanton Search Algorithm for LP Decoding of LDPC Codes Over the BSC.
IEEE Trans. Inf. Theory, 2011

2010
Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-Part II.
IEEE Trans. Inf. Theory, 2010

On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes.
IEEE Trans. Inf. Theory, 2010

LDPC Codes from Latin Squares Free of Small Trapping Sets
CoRR, 2010

Structured LDPC codes from permutation matrices free of small trapping sets.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Iterative decoding beyond belief propagation.
Proceedings of the Information Theory and Applications Workshop, 2010

Multilevel decoders surpassing belief propagation on the binary symmetric channel.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Worst configurations (instantons) for Compressed Sensing over reals: A channel coding approach.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Error-correction capability of column-weight-three LDPC codes.
IEEE Trans. Inf. Theory, 2009

Instanton-based techniques for analysis and reduction of error floors of LDPC codes.
IEEE J. Sel. Areas Commun., 2009

Analysis of error floors of LDPC codes under LP decoding over the BSC.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Two-bit message passing decoders for LDPC codes over the binary symmetric channel.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Trapping set ontology.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Analysis of Failures of Decoders for LDPC Codes.
PhD thesis, 2008

Eliminating Trapping Sets in Low-Density Parity-Check Codes by Using Tanner Graph Covers.
IEEE Trans. Inf. Theory, 2008

Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding
CoRR, 2008

Provably Efficient Instanton Search Algorithm for LP decoding of LDPC codes over the BSC
CoRR, 2008

Error Correction Capability of Column-Weight-Three LDPC Codes: Part II
CoRR, 2008

LDPC codes which can correct three errors under iterative decoding.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

On the guaranteed error correction capability of LDPC codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Girth of the Tanner graph and error correction capability of LDPC codes.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007
An Information Theoretical Framework for Analysis and Design of Nanoscale Fault-Tolerant Memories Based on Low-Density Parity-Check Codes.
IEEE Trans. Circuits Syst. I Regul. Pap., 2007

Reliable Memories Built from Unreliable Components Based on Expander Graphs
CoRR, 2007

Designing LDPC Codes without small trapping sets by using Tanner Graph Covers.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Analysis of One Step Majority Logic Decoders Constructed From Faulty Gates.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Error Floors of LDPC Codes on the Binary Symmetric Channel.
Proceedings of IEEE International Conference on Communications, 2006

Construction of Memory Circuits Using Unreliable Components Based on Low-Density Parity-Check Codes.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006


  Loading...