Hoang Ly
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hoang Ly has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Emina Soljanin
Department of Electrical and Computer Engineering, Rutgers, The State University of New Jersey, Piscataway, NJ, USA
2 shared publications - V. Lalitha
Signal Processing and Communications Research Center (SPCRC), International Institute of Information Technology Hyderabad, Hyderabad, India
1 shared publication
Latest Publications
- Top Cited Papers
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
On the Service Rate Region of Reed–Muller Codes
We study the Service Rate Region of Reed–Muller codes in the context of distributed storage systems. The service rate region is a convex polytope comprising all achievable data access request rates under a given coding scheme. It represents a critical metric for evaluating system efficiency and scalability. Using the geometric properties of Reed–Muller codes, we characterize recovery sets for data objects, including their existence, uniqueness, and enumeration. This analysis reveals a connection between recovery sets and minimum-weight codewords in the dual Reed–Muller code, providing a framework for identifying those recovery sets. Leveraging these results, we derive explicit and tight bounds on the maximal achievable demand for individual data objects, thereby defining the maximal simplex contained within the service rate region, and the smallest simplex containing it. These two simplices provide a tight approximation to the service-rate region of Reed–Muller codes.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
Top Cited PapersOn the Service Rate Region of Reed–Muller Codes
We study the Service Rate Region of Reed–Muller codes in the context of distributed storage systems. The service rate region is a convex polytope comprising all achievable data access request rates under a given coding scheme. It represents a critical metric for evaluating system efficiency and scalability. Using the geometric properties of Reed–Muller codes, we characterize recovery sets for data objects, including their existence, uniqueness, and enumeration. This analysis reveals a connection between recovery sets and minimum-weight codewords in the dual Reed–Muller code, providing a framework for identifying those recovery sets. Leveraging these results, we derive explicit and tight bounds on the maximal achievable demand for individual data objects, thereby defining the maximal simplex contained within the service rate region, and the smallest simplex containing it. These two simplices provide a tight approximation to the service-rate region of Reed–Muller codes.
- Top Cited Papers
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2144-2161
Service Rate Regions of MDS Codes and Fractional Matchings in Quasi-Uniform Hypergraphs
The Service Rate Region (SRR) is a fundamental performance metric for distributed storage systems with redundancy, quantifying the range of data request patterns that the system can serve concurrently without exceeding the servers’ capacities. Geometrically, the SRR is a convex polytope in $\mathbb {R}^{k}$ , where each axis corresponds to the request rate for one of $k$ data objects. This paper focuses on the SRR of systems encoded using a large class of Maximum Distance Separable (MDS) codes. We characterize the axial intercepts of the SRR and derive the smallest standard simplex containing it, demonstrating that the SRR expands strictly as the number of systematic columns in the generator matrix of the code increases. To facilitate this analysis, we develop a graph-theoretic framework that models the SRR as the image of a fractional matching polytope of a quasi-uniform hypergraph. We introduce a novel allocation strategy, Greedy Matching, and use it to characterize the SRRs without requiring an exhaustive evaluation of fractional matchings. These findings yield exact SRRs for a wide range of MDS codes and unify previous results regarding systematic and non-systematic constructions. Our work offers both theoretical and practical guidance for designing storage systems with optimized data service.
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2144-2161
Top Cited PapersService Rate Regions of MDS Codes and Fractional Matchings in Quasi-Uniform Hypergraphs
The Service Rate Region (SRR) is a fundamental performance metric for distributed storage systems with redundancy, quantifying the range of data request patterns that the system can serve concurrently without exceeding the servers’ capacities. Geometrically, the SRR is a convex polytope in $\mathbb {R}^{k}$ , where each axis corresponds to the request rate for one of $k$ data objects. This paper focuses on the SRR of systems encoded using a large class of Maximum Distance Separable (MDS) codes. We characterize the axial intercepts of the SRR and derive the smallest standard simplex containing it, demonstrating that the SRR expands strictly as the number of systematic columns in the generator matrix of the code increases. To facilitate this analysis, we develop a graph-theoretic framework that models the SRR as the image of a fractional matching polytope of a quasi-uniform hypergraph. We introduce a novel allocation strategy, Greedy Matching, and use it to characterize the SRRs without requiring an exhaustive evaluation of fractional matchings. These findings yield exact SRRs for a wide range of MDS codes and unify previous results regarding systematic and non-systematic constructions. Our work offers both theoretical and practical guidance for designing storage systems with optimized data service.