Son Hoang Dau

CoRR, 2024

Block Circulant Codes with Application to Decentralized Systems.

[BibT_eX]

[DOI]

Birenjith Sasidharan

CoRR, 2024

Repairing Reed-Solomon Codes with Side Information.

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

Birenjith Sasidharan

CoRR, 2024

Repairing a Single Erasure in Reed-Solomon Codes with Side Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

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

[BibT_eX]

[DOI]

Birenjith Sasidharan

Proceedings of the IEEE International Symposium on Information Theory, 2024

Private Repair of a Single Erasure in Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Repairing with Zero Skip Cost.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications.

[BibT_eX]

[DOI]

Mohammad Rowshan

IEEE Trans. Inf. Theory, December, 2023

Transition Waste Optimization for Coded Elastic Computing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2023

From Programming Bugs to Multimillion-Dollar Scams: An Analysis of Trapdoor Tokens on Decentralized Exchanges.

[BibT_eX]

[DOI]

CoRR, 2023

Improving Robustness and Accuracy of Ponzi Scheme Detection on Ethereum Using Time-Dependent Features.

[BibT_eX]

[DOI]

CoRR, 2023

Designing Compact Repair Groups for Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

k-server Byzantine-Resistant PIR Scheme with Optimal Download Rate and Optimal File Size.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Two-Server Private Information Retrieval with Optimized Download Rate and Result Verification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2023

Committed Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2023, 2023

New Results on Erasure Combinatorial Batch Codes.

[BibT_eX]

[DOI]

Proceedings of the 59th Annual Allerton Conference on Communication, 2023

Rug-pull malicious token detection on blockchain using supervised learning with feature engineering.

[BibT_eX]

[DOI]

Proceedings of the 2023 Australasian Computer Science Week, 2023

2022

Ancestral Colorings of Perfect Binary Trees With Applications in Private Retrieval of Merkle Proofs.

[BibT_eX]

[DOI]

CoRR, 2022

Improving the Error Coefficient of Polar Codes.

[BibT_eX]

[DOI]

Mohammad Rowshan

Proceedings of the IEEE Information Theory Workshop, 2022

Practical Considerations in Repairing Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Repairing Reed-Solomon Codes via Subspace Polynomials.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Error Coefficient-reduced Polar/PAC Codes.

[BibT_eX]

[DOI]

Mohammad Rowshan

CoRR, 2021

2020

Locally Decodable Index Codes.

[BibT_eX]

[DOI]

Lakshmi Prasad Natarajan

Prasad Krishnan

V. Lalitha

IEEE Trans. Inf. Theory, 2020

Secure Erasure Codes With Partial Reconstructibility.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Set-Codes with Small Intersections and Small Discrepancies.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

On the triangle clique cover and Kt clique cover problems.

[BibT_eX]

[DOI]

Viduranga Bandara Wijekoon

Gregory J. Puleo

Discret. Math., 2020

Access balancing in storage systems by labeling partial Steiner systems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

Optimizing the Transition Waste in Coded Elastic Computing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Sparse and Balanced Reed-Solomon and Tamo-Barg Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Analysis of Nakamoto Consensus, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Iterative Decoding of Reed-Solomon Codes based on Non-binary Matrices.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

On the I/O Costs in Repairing Short-Length Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Locality in Index Coding for Large Min-Rank.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Repairing Reed-Solomon Codes With Multiple Erasures.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

MaxMinSum Steiner Systems for Access Balancing in Distributed Storage.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Repair Schemes with Optimal I/O Costs for Full-Length Reed-Solomon Codes with Two Parities.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

Hien Chu

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

2017

Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

Low bandwidth repair of the RS(10, 4) Reed-Solomon code.

[BibT_eX]

[DOI]

Iwan M. Duursma

Proceedings of the 2017 Information Theory and Applications Workshop, 2017

Balanced and sparse Tamo-Barg codes.

[BibT_eX]

[DOI]

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

Optimal repair schemes for some families of full-length reed-solomon codes.

[BibT_eX]

[DOI]

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

Repairing reed-solomon codes with two erasures.

[BibT_eX]

[DOI]

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

Motif clustering and overlapping clustering for social network analysis.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016

Inference of latent network features via co-intersection representations of graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Delay Minimization for Relay-Based Cooperative Data Exchange With Network Coding.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

On Simple Multiple Access Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2015

Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures.

[BibT_eX]

[DOI]

Algorithmica, 2015

Erasure codes with symbol locality and group decodability for distributed storage.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Local codes with addition based repair.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Weakly secure MDS codes for simple multiple access networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Secure erasure codes with partial decodability.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Communications, 2015

Locally Encodable and Decodable Codes for Distributed Storage Systems.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Global Communications Conference, 2015

Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fields.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

Optimal Index Codes With Near-Extreme Rates.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Optimal Locally Repairable Linear Codes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

On block security of regenerating codes at the MBR point for distributed storage systems.

[BibT_eX]

[DOI]

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

On the existence of MDS codes over small fields with constrained generator matrices.

[BibT_eX]

[DOI]

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

Parity declustering for fault-tolerant storage systems via t-designs.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013

Error Correction for Index Coding With Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Delay Minimization in Varying-Bandwidth Direct Multicast with Side Information

[BibT_eX]

[DOI]

CoRR, 2013

Delay Minimization for Network Coded Cooperative Data Exchange with Rate Adaptation.

[BibT_eX]

[DOI]

Xiumin Wang

Proceedings of the 78th IEEE Vehicular Technology Conference, 2013

Delay Minimization for Relay-Based Cooperative Data Exchange with Network Coding.

[BibT_eX]

[DOI]

Proceedings of the 78th IEEE Vehicular Technology Conference, 2013

Balanced Sparsest generator matrices for MDS codes.

[BibT_eX]

[DOI]

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

2012

On the Security of Index Coding With Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

2011

Index coding and error correction.

[BibT_eX]

[DOI]

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

On secure Index Coding with Side Information.

[BibT_eX]

[DOI]