1 citations · 1 across the 11 of their papers we have counts for
13 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…
Permutation Recovery Problem against Deletion Errors for DNA Data Storage
Shubhransh Singhvi, Charchit Gupta, Avital Boruchovsky +3
Owing to its immense storage density and durability, DNA has emerged as a promising storage medium. However, due to technological constraints, data can only be written onto many sh…
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
Shubhransh Singhvi, Roni Con, Han Mao Kiah +1
The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a scenario where the sender transmits a codeword from some codebook, and the receiver obtains …
Data-Driven Bee Identification for DNA Strands
Shubhransh Singhvi, Avital Boruchovsky, Han Mao Kiah +1
We study a data-driven approach to the bee identification problem for DNA strands. The bee-identification problem, introduced by Tandon et al. (2019), requires one to identify …
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes
Stanislav Kruglik, Gaojun Luo, Wilton Kim +4
We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we co…
Coding Gain for Age of Information in a Multi-source System with Erasure Channel
Shubhransh Singhvi, Praful D. Mankar
In our work, we study the age of information ($\AoI$) in a multi-source system where sources transmit updates of their time-varying processes via a common-aggregator node to a…
Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network
Shubhransh Singhvi, Gayathri R., P. Vijay Kumar
In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to random and burst packet erasures. The source wishes to transmit an infinite stream of packe…
The Input and Output Entropies of the -Deletion/Insertion Channel
Shubhransh Singhvi, Omer Sabary, Daniella Bar-Lev +1
The channel output entropy of a transmitted word is the entropy of the possible channel outputs and similarly, the input entropy of a received word is the entropy of all possible t…