| Publication | Date of Publication | Type |
|---|
Markov capacity for factor codes with an unambiguous symbol
Ergodic Theory and Dynamical Systems | 2024-10-25 | Paper |
MacWilliams extension property with respect to weighted poset metric
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Rényi entropy rate of stationary ergodic processes
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Reflexivity of partitions induced by weighted poset metric and combinatorial metric
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
An optimization approach to the Langberg-Médard multiple unicast conjecture
Advances in Mathematics of Communications | 2023-07-07 | Paper |
| A Gr\"{o}bner Basis Approach to Combinatorial Nullstellensatz | 2023-04-16 | Paper |
| Markov Capacity for Factor Codes with an Unambiguous Symbol | 2022-10-21 | Paper |
The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
A Deterministic Algorithm for the Capacity of Finite-State Channels
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
On Sampling Continuous-Time AWGN Channels
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
A Wong-Zakai approximation of stochastic differential equations driven by a general semimartingale
Discrete and Continuous Dynamical Systems. Series B | 2021-06-17 | Paper |
| The Langberg-M\'{e}dard Multiple Unicast Conjecture: Stable $3$-Pair Networks | 2020-01-07 | Paper |
On mergings in acyclic directed graphs
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Feedback Capacity of Stationary Gaussian Channels Further Examined
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| Information-Theoretic Extensions of the Shannon-Nyquist Sampling Theorem | 2018-10-17 | Paper |
Counterexample to the Vector Generalization of Costa’s Entropy Power Inequality, and Partial Resolution
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
On sequential locally repairable codes
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Asymptotics of Input-Constrained Erasure Channel Capacity
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Capacity of Multilevel NAND Flash Memory Channels
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
On the Langberg-Médard multiple unicast conjecture
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
Network encoding complexity: exact values, bounds, and inequalities
Advances in Mathematics of Communications | 2017-10-12 | Paper |
Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Concavity of the Mutual Information Rate for Input-Restricted Memoryless Channels at High SNR
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Limit Theorems in Hidden Markov Models
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
A Randomized Algorithm for the Capacity of Finite-State Channels
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Analyticity of Entropy Rate of Hidden Markov Chains With Continuous Alphabet
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
The minimum number of hubs in networks
Journal of Combinatorial Optimization | 2015-11-03 | Paper |
A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes
(available as arXiv preprint) | 2014-06-11 | Paper |
One-dimensional Markov random fields, Markov chains and topological Markov fields
Proceedings of the American Mathematical Society | 2013-11-14 | Paper |
| Analyticity of Entropy Rate of Continuous-State Hidden Markov Chains | 2012-08-15 | Paper |
Asymptotics of input-constrained binary symmetric channel capacity
The Annals of Applied Probability | 2009-07-17 | Paper |
Analyticity of Entropy Rate of Hidden Markov Chains
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Geometrical and Numerical Design of Structured Unitary Space–Time Constellations
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Unitary Space–Time Constellation Analysis: An Upper Bound for the Diversity
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| A Numerical Approach for Designing Unitary Space Time Codes with Large Diversity | 2002-11-07 | Paper |
