default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrasad Krishnan
Person information
- affiliation: International Institute of Information Technology, Hyderabad, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i40]Chandan Anand, Jayesh Seshadri, Prasad Krishnan, Gowtham R. Kurri:
Sun-Jafar-Type Schemes for Weak Private Information Retrieval. CoRR abs/2501.11505 (2025)- 2024
- [j10]Prasad Krishnan
, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. IEEE Trans. Inf. Theory 70(6): 3903-3921 (2024) - [c37]Aditya Siddheshwar, Lakshmi Prasad Natarajan, Prasad Krishnan:
Recursive Subproduct Codes with Reed-Muller-like Structure. ISIT 2024: 291-296 - [c36]Hrishi Narayanan, Prasad Krishnan, Nita Parekh:
On Achievable Rates for the Shotgun Sequencing Channel with Erasures. ISIT 2024: 1730-1735 - [i39]Aditya Siddheshwar, Lakshmi Prasad Natarajan, Prasad Krishnan:
Recursive Subproduct Codes with Reed-Muller-like Structure. CoRR abs/2401.15678 (2024) - [i38]Hrishi Narayanan, Prasad Krishnan, Nita Parekh:
On Achievable Rates for the Shotgun Sequencing Channel with Erasures. CoRR abs/2401.16342 (2024) - 2023
- [j9]Shailja Agrawal, K. V. Sushena Sree, Prasad Krishnan, Abhinav Vaishya, Srikar Kale:
Cache-Aided Communication Schemes via Combinatorial Designs and Their q-Analogs. IEEE J. Sel. Areas Inf. Theory 4: 551-568 (2023) - [j8]Lakshmi Prasad Natarajan, Prasad Krishnan:
Berman Codes: A Generalization of Reed-Muller Codes That Achieve BEC Capacity. IEEE Trans. Inf. Theory 69(11): 6956-6980 (2023) - [c35]Sijie Li, Prasad Krishnan, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Computationally Efficient Codes for Adversarial Binary-Erasure Channels. ISIT 2023: 228-233 - [c34]Harshithanjani Athi, Rasagna Chigullapally, Prasad Krishnan, V. Lalitha:
On the Structure of Higher Order MDS Codes. ISIT 2023: 1009-1014 - [c33]Srikar Kale, Keshav Agarwal, Prasad Krishnan:
t-PIR Schemes with Flexible Parameters via Star Products of Berman Codes. ISIT 2023: 1348-1353 - [i37]Shailja Agrawal, K. V. Sushena Sree, Prasad Krishnan, Abhinav Vaishya, Srikar Kale:
Cache-Aided Communication Schemes via Combinatorial Designs and their q-analogs. CoRR abs/2302.03452 (2023) - [i36]Srikar Kale, Keshav Agarwal, Prasad Krishnan:
t-PIR Schemes with Flexible Parameters via Star Products of Berman Codes. CoRR abs/2305.04606 (2023) - [i35]Harshithanjani Athi, Rasagna Chigullapally, Prasad Krishnan, Lalitha Vadlamani:
On the Structure of Higher Order MDS Codes. CoRR abs/2305.05596 (2023) - 2022
- [c32]Lakshmi Prasad Natarajan, Prasad Krishnan:
Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity. ISIT 2022: 1761-1766 - [c31]Athreya Chandramouli, Abhinav Vaishya, Prasad Krishnan:
Coded Data Rebalancing for Distributed Data Storage Systems with Cyclic Storage. ITW 2022: 618-623 - [c30]Tulasi Sowjanya B., Visvesh Subramanian, Prasad Krishnan:
Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-based Approach. ITW 2022: 696-701 - [c29]Lakshmi Prasad Natarajan, Prasad Krishnan:
A Family of Capacity-Achieving Abelian Codes for the Binary Erasure Channel. NCC 2022: 425-430 - [i34]Lakshmi Prasad Natarajan, Prasad Krishnan:
Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity. CoRR abs/2202.09981 (2022) - [i33]Athreya Chandramouli, Abhinav Vaishya, Prasad Krishnan:
Coded Data Rebalancing for Distributed Data Storage Systems with Cyclic Storage. CoRR abs/2205.06257 (2022) - [i32]Tulasi Sowjanya B., Visvesh Subramanian, Prasad Krishnan:
Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-based Approach. CoRR abs/2208.10389 (2022) - 2021
- [j7]Prasad Krishnan, Lakshmi Natarajan, V. Lalitha:
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, and Shuffling. Entropy 23(8): 985 (2021) - [j6]Suman Ghosh, Prasad Krishnan, Lakshmi Prasad Natarajan:
Blind Updates in Coded Caching. IEEE J. Sel. Areas Inf. Theory 2(4): 1253-1265 (2021) - [j5]Hari Hara Suthan Chittoor, Prasad Krishnan, K. V. Sushena Sree, Bhavana Mamillapalli:
Subexponential and Linear Subpacketization Coded Caching via Projective Geometry. IEEE Trans. Inf. Theory 67(9): 6193-6222 (2021) - [c28]Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. ISIT 2021: 214-219 - [i31]Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. CoRR abs/2102.02182 (2021) - 2020
- [j4]Lakshmi Prasad Natarajan, Prasad Krishnan, V. Lalitha, Hoang Dau:
Locally Decodable Index Codes. IEEE Trans. Inf. Theory 66(12): 7387-7407 (2020) - [c27]Shailja Agrawal, Prasad Krishnan:
Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers. ISIT 2020: 162-167 - [c26]Prasad Krishnan, V. Lalitha, Lakshmi Natarajan:
Coded Data Rebalancing: Fundamental Limits and Constructions. ISIT 2020: 640-645 - [c25]Suman Ghosh, Prasad Krishnan, Lakshmi Prasad Natarajan:
Blind Updates in Coded Caching. ITW 2020: 1-5 - [c24]Prasad Krishnan, Lakshmi Natarajan, V. Lalitha:
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, Shuffling & Rebalancing. ITW 2020: 1-5 - [c23]K. V. Sushena Sree, Prasad Krishnan:
Coded Data Rebalancing for Decentralized Distributed Databases. ITW 2020: 1-5 - [i30]Hari Hara Suthan Chittoor, Prasad Krishnan, K. V. Sushena Sree, Bhavana M:
Subexponential and Linear Subpacketization Coded Caching via Line Graphs and Projective Geometry. CoRR abs/2001.00399 (2020) - [i29]Prasad Krishnan, V. Lalitha, Lakshmi Natarajan:
Coded Data Rebalancing: Fundamental Limits and Constructions. CoRR abs/2001.04939 (2020) - [i28]Shailja Agrawal, Prasad Krishnan:
Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers. CoRR abs/2001.05438 (2020) - [i27]Prasad Krishnan, Lakshmi Natarajan, V. Lalitha:
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, Shuffling & Rebalancing. CoRR abs/2010.10459 (2020) - [i26]Suman Ghosh, Prasad Krishnan, Lakshmi Prasad Natarajan:
Blind Updates in Coded Caching. CoRR abs/2010.10464 (2020) - [i25]K. V. Sushena Sree, Prasad Krishnan:
Coded Data Rebalancing for Decentralized Distributed Databases. CoRR abs/2010.11935 (2020)
2010 – 2019
- 2019
- [c22]Hari Hara Suthan Chittoor, Prasad Krishnan:
Low Subpacketization Coded Caching via Projective Geometry for Broadcast and D2D Networks. GLOBECOM 2019: 1-6 - [c21]Hari Hara Suthan Chittoor, Prasad Krishnan:
Projective Geometry based Coded Caching Schemes with Subexponential and Linear Subpacketizations. ISCIT 2019: 537-542 - [c20]Lakshmi Natarajan, Hoang Dau, Prasad Krishnan, V. Lalitha:
Locality in Index Coding for Large Min-Rank. ISIT 2019: 517-521 - [c19]Hari Hara Suthan Chittoor, Bhavana M, Prasad Krishnan:
Coded Caching via Projective Geometry: A new low subpacketization scheme. ISIT 2019: 682-686 - [c18]Shailja Agrawal, K. V. Sushena Sree, Prasad Krishnan:
Coded Caching based on Combinatorial Designs. ISIT 2019: 1227-1231 - [c17]Bhavana M, Prasad Krishnan:
On Index coding for Complementary Graphs with focus on Circular Perfect Graphs. ISIT 2019: 2319-2323 - [i24]Bhavana M, Prasad Krishnan:
On Index coding for Complementary Graphs with focus on Circular Perfect Graphs. CoRR abs/1901.05898 (2019) - [i23]Lakshmi Natarajan, Hoang Dau, Prasad Krishnan, V. Lalitha:
Locality in Index Coding for Large Min-Rank. CoRR abs/1901.05908 (2019) - [i22]Shailja Agrawal, K. V. Sushena Sree, Prasad Krishnan:
Coded Caching based on Combinatorial Designs. CoRR abs/1901.06383 (2019) - [i21]Hari Hara Suthan C, Bhavana M, Prasad Krishnan:
Coded Caching via Projective Geometry: A new low subpacketization scheme. CoRR abs/1901.07823 (2019) - [i20]Hari Hara Suthan C, Prasad Krishnan:
Low Subpacketization Coded Caching via Projective Geometry for Broadcast and D2D networks. CoRR abs/1902.08041 (2019) - [i19]Hari Hara Suthan Chittoor, K. V. Sushena Sree, Prasad Krishnan:
Cache-Aided Interference Management with Subexponential Subpacketization. CoRR abs/1904.05213 (2019) - [i18]Lakshmi Natarajan, Prasad Krishnan, V. Lalitha, Hoang Dau:
Locally Decodable Index Codes. CoRR abs/1910.08745 (2019) - 2018
- [c16]Lakshmi Prasad Natarajan, Prasad Krishnan, V. Lalitha:
On Locally Decodable Index Codes. ISIT 2018: 446-450 - [c15]Prasad Krishnan:
Coded Caching via Line Graphs of Bipartite Graphs. ITW 2018: 1-5 - [i17]Lakshmi Prasad Natarajan, Prasad Krishnan, V. Lalitha:
On Locally Decodable Index Codes. CoRR abs/1801.03895 (2018) - [i16]Prasad Krishnan:
Coded Caching via Line Graphs of Bipartite Graphs. CoRR abs/1805.08955 (2018) - 2017
- [c14]Vijaya Kumar Mareedu, Prasad Krishnan:
Uniprior index coding. ISIT 2017: 3065-3069 - [c13]V. Lalitha, Prasad Krishnan:
Rate 1/3 index coding: Forbidden and feasible configurations. ISIT 2017: 3070-3074 - [c12]Hari Hara Suthan C, Ishani Chugh, Prasad Krishnan:
An improved secretive coded caching scheme exploiting common demands. ITW 2017: 66-70 - [i15]Vijaya Kumar Mareedu, Prasad Krishnan:
Uniprior Index Coding. CoRR abs/1701.06273 (2017) - [i14]V. Lalitha, Prasad Krishnan:
Rate 1/3 Index Coding: Forbidden and Feasible Configurations. CoRR abs/1701.06814 (2017) - [i13]Vamsi Krishna Gummadi, Ashok Choudhary, Prasad Krishnan:
Index Coding: Rank-Invariant Extensions. CoRR abs/1704.00687 (2017) - [i12]Hari Hara Suthan C, Ishani Chugh, Prasad Krishnan:
An Improved Secretive Coded Caching Scheme exploiting Common Demands. CoRR abs/1705.08092 (2017) - [i11]Ashok Choudhary, Vamsi Krishna Gummadi, Prasad Krishnan:
Optimal Index Codes via a Duality between Index Coding and Network Coding. CoRR abs/1711.06487 (2017) - 2016
- [c11]Prasad Krishnan, V. Lalitha:
A class of index coding problems with rate 1/3. ISIT 2016: 130-134 - [i10]Prasad Krishnan, V. Lalitha:
A class of index coding problems with rate 1/3. CoRR abs/1601.06689 (2016) - 2015
- [j3]Prasad Krishnan, B. Sundar Rajan:
A Matroidal Framework for Network-Error Correcting Codes. IEEE Trans. Inf. Theory 61(2): 836-872 (2015) - 2014
- [j2]Prasad Krishnan, B. Sundar Rajan:
Network-Error Correcting Codes using Small Fields. IEEE Trans. Commun. 62(2): 423-433 (2014) - [j1]Teja Damodaram Bavirisetti, Abhinav Ganesan, Prasad Krishnan, B. Sundar Rajan:
Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay. IEEE Trans. Inf. Theory 60(10): 6276-6302 (2014) - 2013
- [i9]Teja Damodaram Bavirisetti, Abhinav Ganesan, Prasad Krishnan, B. Sundar Rajan:
Precoding Based Network Alignment using Transform Approach for Acyclic Networks with Delay. CoRR abs/1310.2809 (2013) - 2012
- [c10]Prasad Krishnan, B. Sundar Rajan:
A matroidal framework for network-error correcting codes. ISIT 2012: 1493-1497 - [c9]Teja Damodaram Bavirisetti, Abhinav Ganesan, Prasad Krishnan, B. Sundar Rajan:
A transform approach to linear network coding for acyclic networks with delay. ISIT 2012: 1902-1906 - [c8]Prasad Krishnan, B. Sundar Rajan:
A construction of matroidal error correcting networks. ISITA 2012: 401-405 - [i8]Prasad Krishnan, B. Sundar Rajan:
A Matroidal Framework for Network-Error Correcting Codes. CoRR abs/1201.6459 (2012) - 2011
- [c7]Prasad Krishnan, B. Sundar Rajan:
Network-error correcting codes using small fields. ISIT 2011: 1930-1934 - [c6]Prasad Krishnan, B. Sundar Rajan:
On network coding for acyclic networks with delays. ITW 2011: 523-527 - [c5]Abhinav Ganesan, Teja Damodaram Bavirisetti, Prasad Krishnan, B. Sundar Rajan:
A generalized network alignment for three-source three-destination multiple unicast networks with delays. ITW 2011: 573-577 - [i7]Prasad Krishnan, B. Sundar Rajan:
On network coding for acyclic networks with delays. CoRR abs/1102.1782 (2011) - [i6]Teja Damodaram Bavirisetti, G. Abhinav, Prasad Krishnan, B. Sundar Rajan:
A Transform Approach to Linear Network Coding for Acyclic Networks with Delay. CoRR abs/1103.3882 (2011) - 2010
- [c4]Prasad Krishnan, B. Sundar Rajan:
Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes. ICC 2010: 1-6 - [c3]Prasad Krishnan, B. Sundar Rajan:
Single-Generation Network Coding for Networks with Delay. ICC 2010: 1-6 - [c2]Prasad Krishnan, B. Sundar Rajan:
On network-error correcting convolutional codes under the BSC edge error model. ISIT 2010: 2418-2422 - [i5]Prasad Krishnan, B. Sundar Rajan:
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model. CoRR abs/1001.1026 (2010) - [i4]Prasad Krishnan, B. Sundar Rajan:
Network-Error Correcting Codes using Small Fields. CoRR abs/1009.3728 (2010)
2000 – 2009
- 2009
- [c1]Prasad Krishnan, B. Sundar Rajan:
Convolutional Codes for Network-Error Correction. GLOBECOM 2009: 1-6 - [i3]Prasad Krishnan, B. Sundar Rajan:
Convolutional Codes for Network-Error Correction. CoRR abs/0902.4177 (2009) - [i2]Prasad Krishnan, B. Sundar Rajan:
Network error correction for unit-delay, memory-free networks using convolutional codes. CoRR abs/0903.1967 (2009) - [i1]Prasad Krishnan, B. Sundar Rajan:
Single-generation Network Coding for Networks with Delay. CoRR abs/0909.1638 (2009)
Coauthor Index
aka: Hari Hara Suthan Chittoor
aka: Lalitha Vadlamani
aka: Lakshmi Prasad Natarajan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
