|
 | 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.
Vippathalla, PK and Chan, C and Kashyap, N and Zhou, Q (2022) Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. In: 2022 IEEE Information Theory Workshop, ITW 2022, 1 - 9 November 2022, Mumbai, pp. 726-731.
Sidana, T and Kashyap, N (2022) Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. In: 2022 IEEE International Symposium on Information Theory, ISIT 2022, 26 June 2022 through 1 July 2022, Espoo, pp. 1064-1069.
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.
Arvind Rameshwar, V and Kashyap, N (2022) On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. In: 2022 IEEE International Symposium on Information Theory, ISIT 2022, 26 June - 1 July 2022, Espoo, pp. 1755-1760.
Arvind Rameshwar, V and Kashyap, N (2021) Numerically computable lower bounds on the capacity of the (1, ∞)-rll input-constrained binary erasure channel. In: 27th National Conference on Communications, NCC 2021, 27 - 30 July 2021, Virtual, Kanpur.
Vippathalla, PK and Chan, C and Kashyap, N and Zhou, Q (2021) Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. In: IEEE International Symposium on Information Theory - Proceedings, 12 - 20 July 2021, Melbourne, pp. 1624-1629.
Vinay Kumar, BR and Kashyap, N and Yogeshwaran, D (2021) An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. In: 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, WiOpt 2021, 18-21 Oct 2021, Virtual, Philadelphia.
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.
George, AJ and Kashyap, N (2021) An MCMC Method to Sample from Lattice Distributions. In: 2021 IEEE International Symposium on Information Theory, ISIT 2021, 12-20 Jul 2021, Melbourne, pp. 3074-3079.
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.
Chan, C and Kashyap, N and Vippathalla, PK and Zhou, Q (2020) Secure Information Exchange for Omniscience. In: 2020 IEEE International Symposium on Information Theory, ISIT 2020, 21-26 July 2020, Los Angeles; United States, pp. 966-971.
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.
Kashyap, N and Roth, RM and Siegel, PH (2019) The Capacity of Count-Constrained ICI-Free Systems. In: 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 - 12 July 2019, Paris, pp. 1592-1596.
Chan, C and Kashyap, N and Vippathalla, PK and Zhou, Q (2019) One-Shot Perfect Secret Key Agreement for Finite Linear Sources. In: 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 - 12 July 2019, Paris, pp. 947-951.
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.
Robert, BP and Arun Babu, P and Kashyap, N and Gurrala, G (2019) Practical Approaches Towards Securing Edge Devices in Smart Grid. In: 2019 8th International Conference on Power Systems (ICPS), 20-22 Dec. 2019, Jaipur, India, India.
Vippathalla, PK and Kashyap, N (2022) The Secure Storage Capacity of a DNA Wiretap Channel Model. In: 2022 IEEE International Symposium on Information Theory, ISIT 2022, 26 June - 1 July 2022, Espoo, pp. 1785-1790.
Kashyap, N and Krishnapur, M (2022) How many modes can a mixture of Gaussians with uniformly bounded means have? In: Information and Inference, 11 (2). pp. 423-434.
Huleihel, B and Sabag, O and Permuter, HH and Kashyap, N and Shamai Shitz, S (2021) Computable Upper Bounds on the Capacity of Finite-State Channels. In: IEEE Transactions on Information Theory, 67 (9). pp. 5674-5692.
Kumar, BRV and Kashyap, N (2021) Probabilistic Forwarding of Coded Packets on Networks. In: IEEE/ACM Transactions on Networking, 29 (1). pp. 234-247.
Vatedka, S and Kashyap, N (2017) Some ``Goodness'' Properties of LDA Lattices. In: PROBLEMS OF INFORMATION TRANSMISSION, 53 (1). pp. 1-29.
Kashyap, N and Singh, SK and Yadav, N and Singh, VK and Kumari, M and Kumar, D and Shukla, L and Kaushalendra, K and Bhardwaj, N and Kumar, A (2023) Biocontrol Screening of Endophytes: Applications and Limitations. Multidisciplinary Digital Publishing Institute (MDPI).
