88 citations · 349 across the 70 of their papers we have counts for
90 papers
One-at-a-Time Quantum Guessing: Multipartite Entanglement Beyond MoE Games
Michael Schleppy, Emina Soljanin
Multipartite entanglement remains a challenging and not fully understood aspect of quantum information. Monogamy-of-Entanglement (MoE) games have been highly effective for studying…
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…
The Oval Strikes Back
Andrea Di Giusto, Alberto Ravagnani, Emina Soljanin
We investigate the applications of ovals in projective planes to distributed storage, with a focus on the Service Rate Region problem. Leveraging the incidence relations between li…
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…
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…