Birenjith Sasidharan

Yi Hong

IEEE Commun. Lett., July, 2024

On oriented diameter of (n,k)-star graphs.

[BibT_eX]

[DOI]

K. S. Ajish Kumar

K. S. Sudeep

Discret. Appl. Math., 2024

Block Circulant Codes with Application to Decentralized Systems.

[BibT_eX]

[DOI]

Son Hoang Dau

CoRR, 2024

A Family of Low-Complexity Binary Codes with Constant Hamming Weights.

[BibT_eX]

[DOI]

Son Hoang Dau

CoRR, 2024

On ML Decoding of Binary Cyclic-gap Constant Weight Codes.

[BibT_eX]

[DOI]

Son Hoang Dau

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes.

[BibT_eX]

[DOI]

M. Nikhil Krishnan

Anoop Thomas

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes.

[BibT_eX]

[DOI]

Anoop Thomas

IEEE J. Sel. Areas Commun., 2022

Private Balance-Checking on Blockchain Accounts Using Private Integer Addition.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Codes for Distributed Storage.

[BibT_eX]

[DOI]

Vinayak Ramkumar

Balaji Srinivasan Babu

Found. Trends Commun. Inf. Theory, 2022

2021

Private Data Access in Blockchain Systems Employing Coded Sharding.

[BibT_eX]

[DOI]

Srinivasan Narayanamurthy

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Codes for Distributed Storage.

[BibT_eX]

[DOI]

CoRR, 2020

2018

On Maximally Recoverable Codes for Product Topologies.

[BibT_eX]

[DOI]

CoRR, 2018

Erasure coding for distributed storage: an overview.

[BibT_eX]

[DOI]

Balaji Srinivasan Babu

Sci. China Inf. Sci., 2018

Clay Codes: Moulding MDS Codes to Yield an MSR Code.

[BibT_eX]

[DOI]

Syed Hussain

Siddhartha Nandi

Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018

2017

An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d < (n - 1).

[BibT_eX]

[DOI]

Myna Vajha

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes.

[BibT_eX]

[DOI]

Int. J. Inf. Coding Theory, 2016

An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair.

[BibT_eX]

[DOI]

Myna Vajha

CoRR, 2016

Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs.

[BibT_eX]

[DOI]

Chao Tian

Vaneet Aggarwal

Vinay A. Vaishampayan

IEEE Trans. Inf. Theory, 2015

An alternate construction of an access-optimal regenerating code with optimal sub-packetization level.

[BibT_eX]

[DOI]

Gaurav Kumar Agarwal

Proceedings of the Twenty First National Conference on Communications, 2015

Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets.

[BibT_eX]

[DOI]

Kaushik Senthoor

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

A high-rate MSR code with polynomial sub-packetization level.

[BibT_eX]

[DOI]

Gaurav Kumar Agarwal

Proceedings of the IEEE International Symposium on Information Theory, 2015

Codes with hierarchical locality.

[BibT_eX]

[DOI]

Gaurav Kumar Agarwal

Birenjith Padmakumari Sasidharan

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes.

[BibT_eX]

[DOI]

Kaushik Senthoor

Srinivasan Narayanamurthy

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Optimality of the product-matrix construction for secure MSR regenerating codes.

[BibT_eX]

[DOI]

Proceedings of the 6th International Symposium on Communications, 2014

Evaluation of Codes with Inherent Double Replication for Hadoop.

[BibT_eX]

[DOI]

Ranjit Kumar

Siddhartha Nandi

Proceedings of the 6th USENIX Workshop on Hot Topics in Storage and File Systems, 2014

2013

DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

High-rate regenerating codes through layering.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On the interior points of the storage-repair bandwidth tradeoff of regenerating codes.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

DMT of Multihop Networks: End Points and Computational Tools.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

2008

DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks with Full-Duplex Performance

[BibT_eX]

[DOI]

CoRR, 2008

DMT of Multi-hop Cooperative Networks - Part I: Basic Results

[BibT_eX]

[DOI]

CoRR, 2008

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

[BibT_eX]

[DOI]

CoRR, 2008

DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Diversity and degrees of freedom of cooperative wireless networks.

[BibT_eX]

[DOI]