ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by IISc Authors

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 39.

Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2019) Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 65 (8). pp. 5080-5093.

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2018) Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 64 (7). pp. 4940-4961.

Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2018) Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 2654-2658.

Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2018) On the Optimality of Secret Key Agreement via Omniscience. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 64 (4, 1). pp. 2371-2389.

Kumar, Vinay BR and Antony, Roshan and Kashyap, Navin (2018) The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol. In: 2018 Twenty Fourth National Conference on Communications (NCC), FEB 25-28, 2018, Hyderabad, INDIA.

Manickam, Shivkumar K and Kashyap, Navin (2018) On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. In: 2018 International Symposium on Information Theory and Its Applications (ISITA), 28-31 Oct. 2018, Singapore, pp. 648-652.

Shivkumar, KM and Kashyap, Navin (2017) A maximization problem related to Huffman codes. In: 23rd National Conference on Communications, NCC 2017, 02-04 March 2017, Chennai, India, pp. 1-6.

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2017) An Optimal Coding Scheme for the BIBO Channel with a No-Repeated-Ones Input Constraint. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY, pp. 216-220.

Chan, Chun Lam and Fernandes, Winston and Kashyap, Navin and Krishnapur, Manjunath (2017) PHASE TRANSITIONS FOR THE UNIFORM DISTRIBUTION IN THE PATTERN MAXIMUM LIKELIHOOD PROBLEM AND ITS BETHE APPROXIMATION. In: SIAM JOURNAL ON DISCRETE MATHEMATICS, 31 (1). pp. 597-631.

Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2017) Secret Key Agreement under Discussion Rate Constraints. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY, pp. 1519-1523.

Mukherjee, Manuj and Chan, Chung and Kashyap, Navin and Zhou, Qiaoqiao (2016) Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. In: IEEE International Symposium on Information Theory (ISIT), JUL 10-15, 2016, Barcelona, SPAIN, pp. 2504-2508.

Vatedka, Shashank and Kashyap, Navin (2016) A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity. In: 22nd National Conference on Communications (NCC), MAR 04-06, 2016, Guwahati, INDIA.

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2016) The Feedback Capacity of the BIBO Channel with a No-Consecutive-Ones Input Constraint. In: 11th International Conference on Signal Processing and Communications (SPCOM), JUN 12-15, 2016, Indian Inst Sci, Banglore, INDIA.

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2016) The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 62 (1). pp. 8-22.

Vatedka, Shashank and Kashyap, Navin (2016) A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources. In: IEEE International Symposium on Information Theory (ISIT), JUL 10-15, 2016, Barcelona, SPAIN, pp. 515-519.

Das, Abhinav NV and Kashyap, Navin (2016) MCMC Methods for Drawing Random Samples From the Discrete-Grains Model of a Magnetic Medium. In: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 34 (9). pp. 2430-2438.

Mukherjee, Manuj and Kashyap, Navin and Sankarasubramaniam, Yogesh (2016) On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 62 (7). pp. 3811-3830.

Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2016) When is Omniscience a Rate-Optimal Strategy for Achieving Secret Key Capacity? In: IEEE Information Theory Workshop (ITW), SEP 11-14, 2016, Cambridge, ENGLAND.

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2015) Capacity of the (1,infinity)-RLL Input-Constrained Erasure Channel with Feedback. In: IEEE INFORMATION THEORY WORKSHOP (ITW), APR 26-MAY 01, 2015, Jerusalem, ISRAEL.

Mukherjee, Manuj and Kashyap, Navin (2015) The Communication Complexity of Achieving SK Capacity in a Class of PIN Models. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 296-300.

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2015) The Feedback Capacity of the Binary Symmetric Channel with a No-Consecutive-Ones Input Constraint. In: 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), SEP 29-OCT 02, 2015, Monticello, IL, pp. 160-164.

Chan, Chun Lam and Siavoshani, Mahdi Jafari and Jaggi, Sidharth and Kashyap, Navin and Vontobel, Pascal O (2015) Generalized Belief Propagation for Estimating the Partition Function of the 2D Ising Model. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 2261-2265.

Vatedka, Shashank and Kashyap, Navin (2015) Nested Lattice Codes for Secure Bidirectional Relaying with Asymmetric Channel Gains (Invited paper). In: IEEE Information Theory Workshop (ITW), APR 26-MAY 01, 2015, Jerusalem, ISRAEL.

Basu, Pranab and Kashyap, Navin (2015) On Linear Subspace Codes Closed under Intersection. In: 21st National Conference on Communications (NCC), FEB 27-MAR 01, 2015, Indian Inst Technol, Bombay, INDIA.

Vatedka, Shashank and Kashyap, Navin and Thangaraj, Andrew (2015) Secure Compute-and-Forward in a Bidirectional Relay. In: IEEE TRANSACTIONS ON INFORMATION THEORY , MAY 2015, pp. 2531-2556.

Vatedka, Shashank and Kashyap, Navin (2015) Some ``Goodness'' Properties of LDA Lattices. In: IEEE Information Theory Workshop (ITW), APR 26-MAY 01, 2015, Jerusalem, ISRAEL.

Mukherjee, Manuj and Kashyap, Navin and Sankarasubramaniam, Yogesh (2014) Achieving SK Capacity in the Source Model: When Must All Terminals Talk? In: IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), JUN 29-JUL 04, 2014, Honolulu, HI, pp. 1156-1160.

Mukherjee, Manuj and Kashyap, Navin (2014) On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model. In: IEEE International Symposium on Information Theory (ISIT), JUN 29-JUL 04, 2014, Honolulu, HI, pp. 1151-1155.

Kashyap, Navin and Zemor, Gilles (2014) Upper Bounds on the Size of Grain-Correcting Codes. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 60 (8). pp. 4699-4709.

Manada, Akiko and Kashyap, Navin (2013) On the zeta function of a periodic-finite-type shift. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E96A (6). pp. 1024-1031.

Shashank, V and Kashyap, Navin (2013) Lattice Coding for Strongly Secure Compute-and-Forward in a Bidirectional Relay. In: IEEE International Symposium on Information Theory Proceedings (ISIT), JUL 07-12, 2013, Istanbul, TURKEY, pp. 2775-2779.

Shivkumar, KM and Kashyap, Navin (2013) On 2-D Non-Adjacent-Error Channel Models. In: IEEE Information Theory Workshop (ITW), SEP 09-13, 2013, Seville, SPAIN.

Kashyap, Navin and Mukherjee, Manuj and Sankarasubramaniam, Yogesh (2013) On the secret key capacity of the harary graph PIN model. In: 2013 National Conference on Communications (NCC), 15-17 Feb. 2013, New Delhi, India.

Fernandes, Winston and Kashyap, Navin (2013) A Phase Transition for the Uniform Distribution in the Pattern Maximum Likelihood Problem. In: 2013 IEEE INFORMATION THEORY WORKSHOP (ITW) Published: 2013 .

Kashyap, Navin and Thangaraj, Andrew (2012) The Treewidth of MDS and Reed-Muller Codes. In: IEEE Transactions on Information Theory, 58 (7). pp. 4837-4847.

Tyagi, Himanshu and Kashyap, Navin and Sankarasubramaniam, Yogesh and Viswanathan, Kapali (2012) Fault-tolerant secret key generation. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), 1-6 July 2012, Cambridge, MA.

Kashyap, Navin and Sankarasubramaniam, Yogesh and Kashyap, Navin (2012) Jamming to foil an eavesdropper. In: 2012 National Conference on Communications (NCC), 3-5 Feb. 2012, Kharagpur.

Kashyap, Navin and Shashank, V and Thangaraj, Andrew (2012) Secure Computation in a Bidirectional Relay. In: IEEE International Symposium on Information Theory, JUL 01-06, 2012 , Cambridge, MA.

Kashyap, Navin and Thangaraj, Andrew E (2011) On the treewidth of MDS and Reed-Muller codes. In: 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), July 31 2011-Aug. 5 2011, St. Petersburg, Russia.

This list was generated on Sat Dec 21 16:44:54 2024 IST.