Sudarsan Vasista Srinivasan Ranganathan

Orcid: 0000-0001-6662-7218

According to our database1, Sudarsan Vasista Srinivasan Ranganathan authored at least 20 papers between 2014 and 2019.

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

2019
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths.
IEEE Trans. Inf. Theory, 2019

Variable-Length Coding With Shared Incremental Redundancy: Design Methods and Examples.
IEEE Trans. Commun., 2019

Decoding Flash Memory with Progressive Reads and Independent vs. Joint Encoding of Bits in a Cell.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018
Advances in Protograph-Based LDPC Codes and a Rate Allocation Problem.
PhD thesis, 2018

Linear Rate-Compatible Codes with Degree-1 Extending Variable Nodes Under Iterative Decoding.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Serial List Viterbi Decoding with CRC: Managing Errors, Erasures, and Complexity.
Proceedings of the IEEE Global Communications Conference, 2018

2017
Allocating Redundancy Between Erasure Coding and Channel Coding When Fading Channel Diversity Grows With Codeword Length.
IEEE Trans. Commun., 2017

Sequential differential optimization of incremental redundancy transmission lengths: An example with tail-biting convolutional codes.
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

An information density approach to analyzing and optimizing incremental redundancy with feedback.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Approaching capacity using incremental redundancy without feedback.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Design of improved quasi-cyclic protograph-based Raptor-like LDPC codes for short block-lengths.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Optimizing Transmission Lengths for Limited Feedback With Nonbinary LDPC Examples.
IEEE Trans. Commun., 2016

Optimizing Transmission Lengths for Limited Feedback with Non-Binary LDPC Examples.
CoRR, 2016

Optimality and Rate-Compatibility for Erasure-Coded Packet Transmissions when Fading Channel Diversity Increases with Packet Length.
CoRR, 2016

Some results on spatially coupled protograph LDPC codes.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

Universal rate-compatible LDPC code families for any increment ordering.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

2015
On the girth of (3, L) quasi-cyclic LDPC codes based on complete protographs.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Feedback systems using non-binary LDPC codes with a limited number of transmissions.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Short-blocklength non-binary LDPC codes with feedback-dependent incremental transmissions.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Design of high-rate irregular non-binary LDPC codes using algorithmic stopping-set cancellation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014


  Loading...