7 papers
Majority-Logic Decoding of Binary Locally Recoverable Codes: A Probabilistic Analysis
Hoang Ly, Emina Soljanin, Philip Whiting
Locally repairable codes (LRCs) were originally introduced to enable efficient recovery from erasures in distributed storage systems by accessing only a small number of other symbo…
Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
Hoang Ly, Emina Soljanin, Michael Schleppy
Maximum-likelihood (ML) decoding for arbitrary block codes remains fundamentally hard, with worst-case time complexity-measured by the total number of multiplications-being no bett…
Optimum 1-Step Majority-Logic Decoding of Binary Reed-Muller Codes
Hoang Ly, Emina Soljanin
The classical majority-logic decoder proposed by Reed for Reed-Muller codes RM(r, m) of order r and length 2^m, unfolds in r+1 sequential steps, decoding message symbols from highe…
On the Service Rate Region of Reed-Muller Codes
Hoang Ly, Emina Soljanin, V. Lalitha
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 acc…
Service Rate Regions of MDS Codes & Fractional Matchings in Quasi-uniform Hypergraphs
Hoang Ly, Emina Soljanin
The service rate region (SRR) has emerged as a critical performance metric for distributed systems that store data redundantly. It measures the system's ability to serve multiple u…
Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs
Hoang Ly, Emina Soljanin
We investigate the service-rate region (SRR) of distributed storage systems that employ linear codes. We focus on systems where each server stores one code symbol, and a user recov…