| On maximally recoverable codes for product topologies D Shivakrishna, VA Rameshwar, V Lalitha, B Sasidharan 2018 Twenty Fourth National Conference on Communications (NCC), 1-6, 2018 | 9 | 2018 |
| Maximally recoverable codes with hierarchical locality: Constructions and field-size bounds D Shivakrishna, AM Nair, V Lalitha IEEE Transactions on Information Theory 69 (2), 842-859, 2022 | 3 | 2022 |
| Properties of maximally recoverable product codes and higher order MDS codes D Shivakrishna, V Lalitha 2022 National Conference on Communications (NCC), 233-238, 2022 | 2 | 2022 |
| A field size bound and constructions of maximally recoverable codes with hierarchical locality D Shivakrishna, AM Nair, V Lalitha 2021 IEEE International Symposium on Information Theory (ISIT), 2048-2053, 2021 | 1 | 2021 |
| Some results on maximally recoverable codes with locality and hierarchical locality D Shivakrishna, V Lalitha 2022 IEEE International Symposium on Information Theory (ISIT), 1181-1186, 2022 | | 2022 |
| Bounds and Constructions of Maximally Recoverable Codes for Various Topologies D Shivakrishna Hyderabad, 0 | | |
Birenjith SasidharanMonash University在 monash.edu 的电子邮件经过验证
Birenjith SasidharanMonash University在 monash.edu 的电子邮件经过验证
V. Arvind RameshwarResearch Fellow, India Urban Data Exchange在 iisc.ac.in 的电子邮件经过验证