117 citations · 410 across the 60 of their papers we have counts for
51 papers · 1 filter
RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes
Shiv Pratap Singh Rathore, Navin Kashyap
The Recursive Projection Aggregation (RPA) decoder for Reed-Muller codes uses, in its default implementation, all one-dimensional subspaces at each level of recursion. We restrict…
Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
Prachi Mishra, Sidharth Jaggi, Navin Kashyap +1
We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We…
Reed--Muller Codes Achieve the Symmetric Capacity on Finite-State Channels
Henry D. Pfister, Navin Kashyap, Jean-Francois Chamberland +1
We study reliable communication over finite-state channels (FSCs) using Reed--Muller (RM) codes. Building on recent symmetry-based analyses for memoryless channels, we show that a…
Directed Information: Estimation, Optimization and Applications in Communications and Causality
Dor Tsur, Oron Sabag, Navin Kashyap +2
Directed information (DI) is an information measure that attempts to capture directionality in the flow of information from one random process to another. It is closely related to…
Estimators for Substitution Rates in Genomes from Read Data
Shiv Pratap Singh Rathore, Navin Kashyap
We study the problem of estimating the mutation rate between two sequences from noisy sequencing reads. Existing alignment-free methods typically assume direct access to the full s…
Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics
Shiv Pratap Singh Rathore, Navin Kashyap
In this paper, we derive an expression for the expected number of runs in a trace of a binary sequence obtained by passing through a deletion channel that ind…