98 citations · 133 across the 9 of their papers we have counts for
9 papers
Locally Decodable Index Codes
Lakshmi Natarajan, Prasad Krishnan, V. Lalitha +1
An index code for broadcast channel with receiver side information is locally decodable if each receiver can decode its demand by observing only a subset of the transmitted codewor…
Set-Codes with Small Intersections and Small Discrepancies
R. Gabrys, H. S. Dau, C. J. Colbourn +1
We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum d…
On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes
Hoang Dau, Iwan Duursma, Hien Chu
Network transfer and disk read are the most time consuming operations in the repair process for node failures in erasure-code-based distributed storage systems. Recent developments…
On the Triangle Clique Cover and Clique Cover Problems
Hoang Dau, Olgica Milenkovic, Gregory J. Puleo
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generalize this concept to " clique cover", i.e. a set of cliques that covers all co…
MaxMinSum Steiner Systems for Access-Balancing in Distributed Storage
Hoang Dau, Olgica Milenkovic
Many code families such as low-density parity-check codes, fractional repetition codes, batch codes and private information retrieval codes with low storage overhead rely on the us…
Repairing Reed-Solomon Codes With Two Erasures
Hoang Dau, Iwan Duursma, Han Mao Kiah +1
Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor…
Optimal Repair Schemes for Some Families of Full-Length Reed-Solomon Codes
Hoang Dau, Olgica Milenkovic
Reed-Solomon codes have found many applications in practical storage systems, but were until recently considered unsuitable for distributed storage applications due to the widely-h…
Repairing Reed-Solomon Codes With Multiple Erasures
Hoang Dau, Iwan Duursma, Han Mao Kiah +1
Despite their exceptional error-correcting properties, Reed-Solomon codes have been overlooked in distributed storage applications due to the common belief that they have poor repa…
Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations
Son Hoang Dau, Olgica Milenkovic
We propose a new latent Boolean feature model for complex networks that captures different types of node interactions and network communities. The model is based on a new concept i…