6 papers
Bandwidth Cost of Locally Repairable Convertible Codes in the Global Merge Regime
Saransh Chopra, Shubhransh Singhvi, K. V. Rashmi
Recent studies have shown that distributed storage systems can achieve significant space savings by adapting redundancy levels to varying disk failure rates. This adaptation is per…
Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs
Shubhransh Singhvi, Han Mao Kiah, Eitan Yaakobi
The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a communication setting in which a sender transmits a codeword and the receiver observes K indepen…
Tight Lower Bounds on the Bandwidth Cost of MDS Convertible Codes in the Split Regime
Shubhransh Singhvi, Saransh Chopra, K. V. Rashmi
Recent advances in erasure coding for distributed storage systems have demonstrated that adapting redundancy to varying disk failure rates can lead to substantial storage savings.…
Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors
Shubhransh Singhvi
Constructing Reed-Solomon (RS) codes that can correct insertion and deletion (ins-del) errors has been the focus of several recent studies. However, efficient decoding algorithms f…
Conditional Entropies of k-Deletion/Insertion Channels
Shubhransh Singhvi, Omer Sabary, Daniella Bar-Lev +1
The channel output entropy of a transmitted sequence is the entropy of the possible channel outputs and similarly the channel input entropy of a received sequence is the entropy of…
Peak Age of Information under Tandem of Queues
Ashirwad Sinha, Shubhransh Singhvi, Praful D. Mankar +1
This paper considers a communication system where a source sends time-sensitive information to its destination via queues in tandem. We assume that the arrival process as well as t…