ESEmina Soljanin

Emina Soljanin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Emina Soljanin has a total of 55 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers

    On the Service Rate Region of Reed–Muller Codes

    by 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 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.


  • Uncertain Location Transmitter and UAV-Aided Warden-Based LEO Satellite Covert Communication Systems

    by Pei Peng, Xianfu Chen, Tianheng Xu, Celimuge Wu, Yulong Zou, Qiang Ni, Emina Soljanin

    We propose a novel covert communication system in which a ground user, Alice, transmits unauthorized message fragments to Bob, a low-Earth orbit satellite (LEO), and an unmanned aerial vehicle (UAV) warden (Willie) attempts to detect these transmissions. The key contribution is modeling a scenario where Alice and Willie are unaware of each other’s exact locations and move randomly within a specific area. Alice utilizes environmental obstructions to avoid detection and only transmits when the satellite is directly overhead. LEO satellite technology allows users to avoid transmitting messages near a base station. We introduce two key performance metrics: catch probability (Willie detects and locates Alice during a message chunk transmission) and overall catch probability over multiple message chunks. We analyze how two parameters impact these metrics: 1) the size of the detection window and 2) the number of message chunks. The paper proposes two algorithms to optimize these parameters. The simulation results show that the algorithms effectively reduce the detection risks. This work advances the understanding of covert communication under mobility and uncertainty in satellite-aided systems.


  • Top Cited Papers

    Service Rate Regions of MDS Codes and Fractional Matchings in Quasi-Uniform Hypergraphs

    by Hoang Ly, Emina Soljanin

    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.


  • Open Access

    The Oval Strikes Back

    by 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 lines and ovals, we describe a class of non-systematic MDS matrices with a large number of small and disjoint recovery sets. For certain parameter choices, the service-rate region of these matrices contains the region of a systematic generator matrix for the same code, yielding better service performance. We further apply our construction to analyze the PIR properties of the considered MDS matrices and present a one-step majority-logic decoding algorithm with strong error-correcting capability. These results highlight how ovals, a classical object in finite geometry, re-emerge as a useful tool in modern coding theory.

  • Optimal Strategies for Winning Certain Coset-Guessing Quantum Games

    by Michael Schleppy, Emina Soljanin, Nicolas Swanson

    In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins with Alice preparing a 2m-qubit quantum state based on a random selection of three parameters. She sends the first m qubits to Bob and the rest to Charlie, and then reveals to them her choice for one of the parameters. Bob is supposed to guess one of the hidden parameters, Charlie the other, and they win if both guesses are correct. From previous work, we know that the probability of Bob’s and Charlie’s guesses being simultaneously correct goes to zero exponentially as m increases. We derive a tight upper bound on this probability and show how Bob and Charlie can achieve it. While developing an optimal strategy, we devised an encoding circuit using only and Hadamard gates, which builds CSS codes from EPR pairs using only local operations. We found that the role of quantum information that Alice communicates to Bob and Charlie is to make their responses correlated rather than improve their individual (marginal) correct guessing rates.


  • Redundancy Management for Fast Service (Rates) in Edge Computing Systems

    by Pei Peng, Emina Soljanin

    Edge computing operates between the cloud and end users and strives to provide low-latency computing services for simultaneous users. Redundant use of multiple edge nodes can reduce latency, as edge systems often operate in uncertain environments. However, since edge systems have limited computing and storage resources, directing more resources to some computing jobs will either block the execution of others or pass their execution to the cloud, thus increasing latency. This paper uses the average system computing time and blocking probability to evaluate edge system performance and analyzes the optimal resource allocation accordingly. We also propose blocking probability and average system time optimization algorithms. Simulation results show that both algorithms significantly outperform the benchmark for different service time distributions and show how the optimal replication factor changes with varying parameters of the system.


  • Time-Entanglement QKD: Secret Key Rates and Information Reconciliation Coding

    by Joseph J. Boutros, Emina Soljanin

    In time entanglement-based quantum key distribution (TE-QKD), Alice and Bob extract the raw key bits from the arrival times of entangled photon pairs. Each entangled pair can contribute to multiple key bits depending on how precisely Alice and Bob can measure the photon arrival times. Thus, TE-QKD can potentially increase the secret key rate compared to typical QKD implementations, which extract up to a bit per photon. Because of entanglement, the times of photon arrivals at Alice’s and Bob’s detectors and, thus, their raw keys should be identical. However, practical photon detectors suffer from time jitter errors. These errors cause discrepancies between Alice’s and Bob’s raw keys. Therefore, Alice must send information to Bob through the public channel to reconcile their raw keys. The amount of data sent for reconciliation represents a loss, rendering secret keys shorter than the raw keys. We compute the secret key rates possible in systems with detector jitter errors and show that they are much higher than those achievable in polarization entanglement-based QKD. We then construct codes for information reconciliation to approach these rates. We demonstrate that short and moderate-length standard error-correcting codes represent excellent information reconciliation choices, making TE-QKD a promising technology.


  • QKD Based on Time-Entangled Photons and Its Key-Rate Promise

    by Lara Dolecek, Emina Soljanin

    For secure practical systems, quantum key distribution (QKD) must provide high key rates over long distances. Time-entanglement-based QKD promises to increase the secret key rate and distribution distances compared to other QKD implementations. This article describes the major steps in QKD protocols, focusing on the nascent QKD technology based on high-dimensional time-bin entangled photons. We overview state-of-the-art from the information and coding theory perspective. In particular, we discuss the key rate loss due to single-photon detector imperfections. We hope the open questions posed and discussed in this paper will inspire information and coding theorists to contribute to and impact fledgling quantum applications and influence future quantum communication systems.