On Secure Communication over Wireless Erasure Networks (2009)
Andrew Mills, Brian Smith, T. Charles Clancy, Emina Soljanin, Sriram Vishwanath
Abstract — This paper studies the secrecy capacity of unicast communication in a wireless erasure network setting in the presence of a wire-tapper. From an information-theoretic setting of perfect...
Coding Improves the Throughput-Delay Trade-off in Mobile Wireless Networks (2009)
Kong, Zhenning, Yeh, Edmund M., Soljanin, Emina
We study the throughput-delay performance tradeoff in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Theta(1/sqrt(n log...
Secure Network Coding for Wiretap Networks of Type II (2009)
Rouayheb, Salim El, Soljanin, Emina, Sprintson, Alex
We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network edges of its choice. We assume that the network...
Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks (2009)
Kong, Zhenning, Aly, Salah A., Soljanin, Emina
We consider large-scale wireless sensor networks with $n$ nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which...
Raptor Codes Based Distributed Storage Algorithms for Wireless Sensor Networks (2009)
Aly, Salah A., Kong, Zhenning, Soljanin, Emina
We consider a distributed storage problem in a large-scale wireless sensor network with $n$ nodes among which $k$ acquire (sense) independent data. The goal is to disseminate the acquired information...
Fountain Codes Based Distributed Storage Algorithms for Large-scale Wireless Sensor Networks (2009)
Aly, Salah A., Kong, Zhenning, Soljanin, Emina
We consider large-scale sensor networks with n nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which network...
Ra Chekuri, Christina Fragouli, Emina Soljanin
We examine the throughput benefits that network coding offers with respect to the average through-put achievable by routing, where the average throughput refers to the average of the rates that the...
Rouayheb, Salim El, Soljanin, Emina
We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network links of his choice. We assume that the network...
Network Coding Capacity of Random Wireless Networks under a SINR Model (2008)
Kong, Zhenning, Aly, Salah A., Soljanin, Emina, Yeh, Edmund M., Klappenecker, Andreas
Previous work on network coding capacity for random wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a...
Ruoheng Liu, Predrag Spasojević, Emina Soljanin
In applications of wireless packet-oriented video and image communications, a special coding scheme, referred to as multilevel coding (MLC), exhibits both power and bandwidth efficiency by jointly...
Emina Soljanin, Ruoheng Liu, Predrag Spasojevic
Abstract. In mobile packet data and voice networks, a special coding scheme, known as the incremental redundancy hybrid ARQ (IR HARQ), achieves higher throughput efficiency than ordinary turbo codes...
Code Ensembles ∗ Abstract (2008)
Olgica Milenkovic, Emina Soljanin, Philip Whiting
We address the problem of evaluating the asymptotic, normalized distributions of a class of combinatorial configurations in random, regular and irregular binary low-density parity-check (LDPC) code...
Kong, Zhenning, Aly, Salah A., Soljanin, Emina, Yeh, Edmund M., Klappenecker, Andreas
In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of...
Liu, Ruoheng, Spasojevic, Predrag, Soljanin, Emina
We study an incremental redundancy (IR) cooperative coding scheme for wireless networks. To exploit the spatial diversity benefit we propose a cluster-based collaborating strategy for a quasi-static...
Information flow decomposition for network coding (2006)
Christina Fragouli, Emina Soljanin, Senior Member
The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the...
January George, E. Georgiou, Gail R. Lalk, Lawrence Nagel, Ruth Pennoyer, Richard Steinel, ...
Add your name to the list of Senior Members. All new Senior Members will receive an engraved wood and bronze Senior Member plaque from the IEEE. To get information and an application to advance to...
Soljanin “A connection between network coding and convolutional codes (2004)
Christina Fragouli, Emina Soljanin
The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink....
User cooperation with punctured turbo codes (2003)
Ruohengs Liu, Predrag Spasojević, Emina Soljanin
In wireless network transmission, a recently introduced form of spatial diversity, known as user cooperation diversity is an effective way to overcome deep fading. Cooperative users share their...
Ra Mojsilović, Jianying Hu, Emina Soljanin
Abstract—Color descriptors are among the most important features used in image analysis and retrieval. Due to its compact representation and low complexity, direct histogram comparison is a...
Compressing Mixed-State Sources by Sending Classical Information (2001)
We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob knows the source statistics,...
An Algebraic Description Of Iterative Decoding Schemes (2000)
. Several popular, suboptimal algorithms for bit decoding of binary block codes such as turbo decoding, threshold decoding, and message passing for LDPC, were developed almost as a common sense...
Constrained Coding for Binary Channels with High Intersymbol Interference (1999)
Razmik Karabed, Paul H. Siegel, Emina Soljanin, Epr E, Pr E
Partial-response (PR) signalling is used to model communications channels with intersymbol interference (ISI) such as the magnetic recording channel and the copper wire channel for digital subscriber...
Distance-Enhancing Codes for Digital Recording (1998)
Bruce E. Moision, Paul H. Siegel, Emina Soljanin
We review recent progress in the design of high-rate, distance-enhancing codes that achieve the matched-filter-bound (MFB) on the E 2 PR4 channel, h(D) = (1 \Gamma D)(1 + D) 3 , including a rate 8/9...