Shrinivas Kudekar

Orcid: 0000-0001-6441-0699

According to our database1, Shrinivas Kudekar authored at least 29 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Source Polarization-Adjusted Convolutional Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2019
Joint Crosstalk-Avoidance and Error-Correction Coding for Parallel Data Buses.
IEEE Trans. Inf. Theory, 2019

2018
Design of Low-Density Parity Check Codes for 5G New Radio.
IEEE Commun. Mag., 2018

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Analysis of Saturated Belief Propagation Decoding of Low-Density Parity-Check Codes.
IEEE Trans. Inf. Theory, 2017

Reed-Muller Codes Achieve Capacity on Erasure Channels.
IEEE Trans. Inf. Theory, 2017

2016
Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Wave-Like Solutions of General 1-D Spatially Coupled Systems.
IEEE Trans. Inf. Theory, 2015

Reed-Muller Codes Achieve Capacity on the Binary Erasure Channel under MAP Decoding.
CoRR, 2015

2014
The effect of saturation on belief propagation decoding of LDPC codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation.
IEEE Trans. Inf. Theory, 2013

Improved linear programming decoding using frustrated cycles.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Wave-Like Solutions of General One-Dimensional Spatially Coupled Systems
CoRR, 2012

2011
Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC.
IEEE Trans. Inf. Theory, 2011

Decay of Correlations for Sparse Graph Error Correcting Codes.
SIAM J. Discret. Math., 2011

Existence and uniqueness of GEXIT curves via the Wasserstein metric.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Spatially coupled codes over the multiple access channel.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Threshold saturation on channels with memory via spatial coupling.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Linear programming based detectors for two-dimensional intersymbol interference channels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Threshold Saturation on BMS Channels via Spatial Coupling
CoRR, 2010

The effect of spatial coupling on compressive sensing.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Statistical physics methods for sparse graph codes.
PhD thesis, 2009

Sharp bounds for optimal decoding of low-density parity-check codes.
IEEE Trans. Inf. Theory, 2009

Decay of correlations in low density parity check codes: Low noise regime.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes
CoRR, 2008

Proof of replica formulas in the high noise regime for communication using LDGM codes.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Concentration of magnetization for linear block codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Sharp Bounds for MAP Decoding of General Irregular LDPC Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006


  Loading...