|
 | Up a level |
Rameshwar, VA and Kashyap, N (2023) Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. In: 2023 IEEE International Symposium on Information Theory, ISIT 2023, 25 - 30 June 2023, Taipei, pp. 2667-2672.
Rameshwar, VA and Kashyap, N (2023) A Version of Delsarte's Linear Program for Constrained Systems. In: 2023 IEEE International Symposium on Information Theory, ISIT 2023, 25 - 30 June 2023, Taipei, pp. 30-35.
Rameshwar, VA and Kashyap, N (2022) Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. In: 2022 IEEE Information Theory Workshop, ITW 2022, 1 - 9 November 2022, Mumbai, pp. 624-629.
Rameshwar, VA and Kashyap, N (2022) A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. In: 14th IEEE International Conference on Signal Processing and Communications, SPCOM 2022, 11 - 15 July 2022, Bangalore.
Rameshwar, VA and Kashyap, N (2021) Bounds on the Feedback Capacity of the (d, \infty)-RLL Input-Constrained Binary Erasure Channel. In: 2021 IEEE International Symposium on Information Theory, ISIT 2021, 12-20 Jul 2021, Melbourne, pp. 290-295.
Rameshwar, VA and Kashyap, N (2020) Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. In: 2020 IEEE International Symposium on Information Theory, ISIT 2020, 21-26 July 2020, Los Angeles; United States, pp. 2002-2007.
Rameshwar, VA and Reghu, AM and Kashyap, N (2020) On the Capacity of the Flash Memory Channel with Feedback. In: 16th International Symposium on Information Theory and its Applications, ISITA 2020, 24-27 Oct 2020, Kapolei; United States, pp. 11-15.
Rameshwar, VA and Kashyap, N (2019) Achieving secrecy capacity of minimum storage regenerating codes for all feasible (n, k, d) parameter values. In: 25th National Conference on Communications, NCC 2019, 20 - 23 February 2019, Bangalore.
