11 papers
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…
Recoverable systems and the maximal hard-core model on the triangular lattice
Geyang Wang, Alexander Barg, Navin Kashyap
In a previous paper (arXiv:2510.19746), we have studied the maximal hard-code model on the square lattice from the perspective of recoverable systems. Here we exten…
Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly
K. Sai Mineesh Reddy, Navin Kashyap
This paper introduces a framework for constructing Calderbank-Shor-Steane (CSS) codes that support fault-tolerant logical transversal -rotations. Using this framework, we obtain…
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…