activity
20052026
most citedShortened Array Codes of Large Girth

117 citations · 410 across the 60 of their papers we have counts for

collaborators

67 papers

quant-ph2026

Realizing Logical Diagonal Gates via Transversal Physical -Rotations in CSS Codes

K. Sai Mineesh Reddy, Navin Kashyap

Calderbank-Shor-Steane (CSS) codes, constructed from nested classical codes , are typically optimized for good code parameters. However, practical quantum comput…

cs.IT2026

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…

cs.IT2026

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…

cs.IT2026

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…

math.CO2026

The maximal hard-core model on the triangular lattice

Geyang Wang, Alexander Barg, Navin Kashyap

The well-known hard-core model on the triangular lattice is an interaction model defined on the independent sets of the lattice, parameterized by an activity parameter…

cs.IT2026

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…