|
 | Up a level |
Prabhu, GR and Bhashyam, S and Gopalan, A and Sundaresan, R (2022) Sequential Multi-Hypothesis Testing in Multi-Armed Bandit Problems: An Approach for Asymptotic Optimality. In: IEEE Transactions on Information Theory, 68 (7). pp. 4790-4817.
Jinan, R and Badita, A and Sarvepalli, PK and Parag, P (2022) Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers. In: IEEE Transactions on Information Theory, 68 (6). pp. 4135-4155.
Acharya, J and Canonne, CL and Liu, Y and Sun, Z and Tyagi, H (2022) Interactive Inference under Information Constraints. In: IEEE Transactions on Information Theory, 68 (1). pp. 502-516.
Sahasranand, KR and Tyagi, H (2021) Communication Complexity of Distributed High Dimensional Correlation Testing. In: IEEE Transactions on Information Theory, 67 (9). pp. 6082-6095.
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.
Acharya, J and Canonne, CL and Tyagi, H (2020) Inference under Information Constraints I: Lower Bounds from Chi-Square Contraction. In: IEEE Transactions on Information Theory, 66 (12). pp. 7835-7855.
Acharya, J and Canonne, CL and Tyagi, H (2020) Inference under Information Constraints II: Communication Constraints and Shared Randomness. In: IEEE Transactions on Information Theory, 66 (12). pp. 7856-7877.
Karthik, PN and Sundaresan, R (2020) Learning to Detect an Odd Markov Arm. In: IEEE Transactions on Information Theory, 66 (7). pp. 4324-4348.
Mayekar, P and Parag, P and Tyagi, H (2020) Optimal Source Codes for Timely Updates. In: IEEE Transactions on Information Theory, 66 (6). pp. 3714-3731.
Tyagi, H and Watanabe, S (2020) Strong Converse Using Change of Measure Arguments. In: IEEE Transactions on Information Theory, 66 (2). pp. 689-703.
Balaji, S B and Kini, G R and Kumar, P V (2020) A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery from Any Number of Multiple Erasures. In: IEEE Transactions on Information Theory, 66 (2). pp. 1023-1052.
Choudhury, Ashish and Patra, Arpita (2017) An Efficient Framework for Unconditionally Secure Multiparty Computation. In: IEEE Transactions on Information Theory, 63 (1). pp. 428-468. ISSN 0018-9448
Acharya, Jayadev and Orlitsky, Alon and Suresh, Ananda Theertha and Tyagi, Himanshu (2017) Estimating Renyi Entropy of Discrete Distributions. In: IEEE Transactions on Information Theory, 63 (1). pp. 38-56. ISSN 0018-9448
Srinath, Pavan K and Rajan, Sundar B (2013) Improved perfect space-time block codes. In: IEEE Transactions on Information Theory, 59 (12). pp. 7927-7935.
Sreeram, K and Birenjith, S and Kumar, Vijay P (2013) DMT of parallel-path and layered networks under the half-duplex constraint. In: IEEE Transactions on Information Theory, 59 (6). pp. 3875-3891.
Natarajan, Lakshmi Prasad and Rajan, Sundar B (2013) Generalized distributive law for ML decoding of space-time block codes. In: IEEE Transactions on Information Theory, 59 (5). pp. 2914-2935.
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.
Das, Smarajit and Rajan, Sundar B (2012) Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs. In: IEEE Transactions on Information Theory, 58 (5). pp. 2633-2647.
Shah, Nihar B and Rashmi, KV and Kumar, Vijay P and Ramchandran, Kannan (2012) Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff. In: IEEE Transactions on Information Theory, 58 (3). pp. 1837-1852.
Kavitha, Veeraruna and Altman, Eitan and El-Azouzi, Rachid and Sundaresan, Rajesh (2012) Opportunistic Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles. In: IEEE Transactions on Information Theory, 58 (3). pp. 1757-1773.
Sreeram, K and Birenjith, S and Kumar, Vijay P (2012) DMT of Multihop Networks: End Points and Computational Tools. In: IEEE Transactions on Information Theory, 58 (2). pp. 804-819.
Natarajan, Lakshmi Prasad and Rajan, Sundar B (2011) Low ML Decoding Complexity STBCs via Codes Over the Klein Group. In: IEEE Transactions on Information Theory, 57 (12). pp. 7950-7971.
Karmakar, Sanjay and Srinath, Pavan K and Rajan, Sundar B (2011) Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs. In: IEEE Transactions on Information Theory, 57 (12). pp. 7972-7981.
Mazumdar, Arya and Barg, Alexander and Kashyap, Navin (2011) Coding for High-Density Recording on a 1-D Granular Magnetic Medium. In: IEEE Transactions on Information Theory, 57 (11). pp. 7403-7417.
Srinath, Pavan K and Rajan, Sundar B (2011) Generalized Silver Codes. In: IEEE Transactions on Information Theory, 57 (9). pp. 6134-6147.
Harshan, J and Rajan, Sundar B and Hjorungnes, Are (2011) Training-Symbol Embedded, High-Rate, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks. In: IEEE Transactions on Information Theory, 57 (9). pp. 6157-6169.
Rashmi, KV and Shah, Nihar B and Kumar, Vijay P (2011) Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction. In: IEEE Transactions on Information Theory, 57 (8). pp. 5227-5239.
Mohammed, Saif Khan and Viterbo, Emanuele and Hong, Yi and Chockalingam, Ananthanarayanan (2011) Precoding by Pairing Subchannels to Increase MIMO Capacity With Discrete Input Alphabets. In: IEEE Transactions on Information Theory, 57 (7). pp. 4156-4169.
Mohammed, Saif Khan and Viterbo, Emanuele and Hong, Yi and Chockalingam, Ananthanarayanan (2011) MIMO Precoding With X- and Y- Codes. In: IEEE Transactions on Information Theory, 57 (6). pp. 3542-3566.
Hanawal, Manjesh Kumar and Sundaresan, Rajesh (2011) The Shannon Cipher System With a Guessing Wiretapper: General Sources. In: IEEE Transactions on Information Theory, 57 (4). pp. 2503-2516.
Harshan, J and Rajan, Sundar B (2011) On Two-User Gaussian Multiple Access Channels With Finite Input Constellations. In: IEEE Transactions on Information Theory, 57 (3). pp. 1299-1327.
Karmakar, Sanjay and Rajan, B Sundar (2009) High-Rate, Multisymbol-Decodable STBCs From Clifford Algebras. In: IEEE Transactions on Information Theory, 55 (6). pp. 2682-2695.
Vummintala, Shashidhar and Rajan, B Sundar and Kumar, P Vijay (2009) Asymptotic-Information-Lossless Designs and the Diversity-Multiplexing Tradeoff. In: IEEE Transactions on Information Theory, 55 (1). pp. 255-268.
Karmakar, Sanjay and Rajan, B Sundar (2009) Multigroup Decodable STBCs From Clifford Algebras. In: IEEE Transactions on Information Theory, 55 (1). pp. 223-231.
Goyal, Munish and Kumar, Anurag and Sharma, Vinod (2008) Optimal Cross-Layer Scheduling of Transmissions Over a Fading Multiaccess Channel. In: IEEE Transactions on Information Theory, 54 (8). pp. 3518-3537.
Sharma, Vinod and Premkumar, Karumbu and Swamy, Raghava N (2008) Exponential Diversity Achieving Spatio–Temporal Power Allocation Scheme for Fading Channels. In: IEEE Transactions on Information Theory, 54 (1). pp. 188-208.
Elia, Petros and Sethuraman, BA and Kumar, Vijay P (2007) Perfect Space-Time Codes for Any Number of Antennas. In: IEEE Transactions on Information Theory, 53 (11). pp. 3853-3868.
Krishnan, Murali K and Shankar, Priti (2007) Computing the Stopping Distance of a Tanner Graph is NP-hard. In: IEEE Transactions on Information Theory, 53 (6). pp. 2278-2280.
Sundaresan, Rajesh (2007) Guessing Under Source Uncertainty. In: IEEE Transactions on Information Theory, 53 (1). pp. 269-287.
Thejaswi, Chandrashekhar PS and Sharma, Vinod (2006) Adaptive Joint Source–Channel Rate Allocation Policies for Delay Sensitive Applications Over Fading Channels. In: IEEE Transactions on Information Theory, 52 (12). pp. 5587-5598.
Thejaswi, Chandrashekhar PS and Sharma, Vinod (2006) Adaptive Joint Source–Channel Rate Allocation Policies for Delay Sensitive Applications Over Fading Channels. In: IEEE Transactions on Information Theory, 52 (12). pp. 5587-5598.
Vaze, Rahul and Rajan, Sundar B (2006) On Space–Time Trellis Codes Achieving Optimal Diversity Multiplexing Tradeoff. In: IEEE Transactions on Information Theory, 52 (11). pp. 5060-5067.
Nori, Aditya V and Shankar, Priti (2006) Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes. In: IEEE Transactions on Information Theory, 52 (10). pp. 4431-4443.
Kiran, T and Rajan, Sundar B (2005) STBC-Schemes with Nonvanishing Determinant for Certain Number of Transmit Antennas. In: IEEE Transactions on Information Theory, 51 (8). pp. 2984-2992.
Tanner, Michael R and Sridhara, Deepak and Sridharan, Arvind and Fuja, Thomas E and Costello, Daniel J (2004) LDPC Block and Convolutional Codes Based on Circulant Matrices. In: IEEE Transactions on Information Theory, 50 (12). pp. 2966-2984.
Kiran, T and Rajan, Sundar B (2004) Consta-Abelian Codes Over Galois Rings. In: IEEE Transactions on Information Theory, 50 (2). pp. 367-380.
Khan, Zafar Ali and Rajan, Sundar B (2004) A Generalization of Some Existence Results on Orthogonal Designs for STBCs. In: IEEE Transactions on Information Theory, 50 (1). 218 -219.
Sethuraman, BA and Sundar Rajan, B and Shashidhar, V (2003) Full-diversity, high-rate space-time block codes from division algebras. In: IEEE Transactions on Information Theory, 49 (10). pp. 2596-2616.
Kiran, T and Rajan, Sundar B (2003) Abelian Codes Over Galois Rings Closed Under Certain Permutations. In: IEEE Transactions on Information Theory, 49 (9). pp. 2242-2253.
Rajan, Sundar B and Lee, Moon Ho (2002) Quasi-Cyclic Dyadic Codes in the Walsh-Hadamard Transform Domain. In: IEEE Transactions on Information Theory, 48 (8). 2406 -2412.
Rajan, Sundar B and Subramaniam, Venkata L and Bahl, Rajendar (2002) Gilbert-Varshamov Bound for Euclidean Space Codes Over Distance-Uniform Signal Sets. In: IEEE Transactions on Information Theory, 48 (2). pp. 537-546.
Selvakumaran, TV and Rajan, Sundar B (1999) Block-Coded Modulation Using Two-Level Group Codes Over Generalized Quaternion Groups. In: IEEE Transactions on Information Theory, 45 (1). pp. 365-372.
Bali, Jyoti and Rajan, Sundar B (1998) Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups. In: IEEE Transactions on Information Theory, 44 (4). pp. 1620-1631.
Borkar, VS and Mitter, Sanjoy K (1996) Stochastic Processes that Generate Polygonal and Related Random Fields. In: IEEE Transactions on Information Theory, 42 (2). 606 -617.
Gowda, K and Krishna, G (1979) The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.). In: IEEE Transactions on Information Theory, 25 (4). pp. 488-490.
Shankar, P (1979) On BCH codes over arbitrary integer rings. In: IEEE Transactions on Information Theory, 25 (4). pp. 480-483.
Stein, J and Bhargav, V (1975) Equivalent rate 1/2 quasi-cyclic codes. In: IEEE Transactions on Information Theory, 21 (5). pp. 588-589.
