Emina Soljanin

Orcid: 0000-0002-7464-4242

Affiliations:
  • Rutgers University, New Brunswick, NJ, USA


According to our database1, Emina Soljanin authored at least 161 papers between 1995 and 2023.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2014, "For contributions to coding theory and coding schemes for transmission and storage systems".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Time-Entanglement QKD: Secret Key Rates and Information Reconciliation Coding.
IEEE Trans. Commun., December, 2023

Information Rates With Non Ideal Photon Detectors in Time-Entanglement Based QKD.
IEEE Trans. Commun., April, 2023

Controlling Data Access Load in Distributed Systems.
CoRR, 2023

Theory vs. Practice in Modeling Edge Storage Systems.
CoRR, 2023

The Service Rate Region Polytope.
CoRR, 2023

QKD Based on Time-Entangled Photons and its Key-Rate Promise.
CoRR, 2023

Computing Redundancy in Blocking Systems: Fast Service or No Service.
Proceedings of the International Conference on Wireless Communications and Signal Processing, 2023

Balancing on the Edge: Fast Service or No Service.
Proceedings of the 23rd IEEE International Conference on Communication Technology, 2023

2022
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy.
IEEE Trans. Inf. Theory, 2022

Covert, Low-Delay, Coded Message Passing in Mobile (IoT) Networks.
IEEE Trans. Inf. Forensics Secur., 2022

Balanced Nonadaptive Redundancy Scheduling.
IEEE J. Sel. Areas Inf. Theory, 2022

Technical perspective: Balancing at all loads.
Commun. ACM, 2022

Dual-Code Bounds on Multiple Concurrent (Local) Data Recovery.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Efficient Replication for Fast and Predictable Performance in Distributed Computing.
IEEE/ACM Trans. Netw., 2021

Service Rate Region: A New Aspect of Coded Distributed System Design.
IEEE Trans. Inf. Theory, 2021

Evaluating Load Balancing Performance in Distributed Storage With Redundancy.
IEEE Trans. Inf. Theory, 2021

Distributed Storage Allocations for Optimal Service Rates.
IEEE Trans. Commun., 2021

Download Time Analysis for Distributed Storage Codes With Locality and Availability.
IEEE Trans. Commun., 2021

2020
Introduction to the Special Issue on Quantum Information Science.
IEEE J. Sel. Areas Inf. Theory, 2020

Quantum Information Processing: An Essential Primer.
IEEE J. Sel. Areas Inf. Theory, 2020

Efficient Replication for Straggler Mitigation in Distributed Computing.
CoRR, 2020

Efficient Storage Schemes for Desired Service Rate Regions.
Proceedings of the IEEE Information Theory Workshop, 2020

Diversity vs. Parallelism in Distributed Computing with Redundancy.
Proceedings of the IEEE International Symposium on Information Theory, 2020

A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Data Freshness in Leader-Based Replicated Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Benchmarking in The Dark: On the Absence of Comprehensive Edge Datasets.
Proceedings of the 3rd USENIX Workshop on Hot Topics in Edge Computing, 2020

Increasing the Raw Key Rate in Energy-Time Entanglement Based Quantum Key Distribution.
Proceedings of the 54th Asilomar Conference on Signals, Systems, and Computers, 2020

2019
Straggler Mitigation at Scale.
IEEE/ACM Trans. Netw., 2019

Analyzing the Download Time of Availability Codes.
CoRR, 2019

Load Balancing Performance in Distributed Storage with Regular Balanced Redundancy.
CoRR, 2019

Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distribution.
CoRR, 2019

Optimizing Redundancy Levels in Master-Worker Compute Clusters for Straggler Mitigation.
CoRR, 2019

Load Balancing Performance in Distributed Storage with Regular Balanced Redundancy.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Anonymity Mixes as (Partial) Assembly Queues: Modeling and Analysis.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Modeling The Edge: Peer-to-Peer Reincarnated.
Proceedings of the 2nd USENIX Workshop on Hot Topics in Edge Computing, 2019

Scheduling in the Presence of Data Intensive Compute Jobs.
Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

Data Replication for Reducing Computing Time in Distributed Systems with Stragglers.
Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

Straggling for Covert Message Passing on Complete Graphs.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distributions.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Multicast with Prioritized Delivery: How Fresh is Your Data?
Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018

Timely Lossless Source Coding for Randomly Arriving Symbols.
Proceedings of the IEEE Information Theory Workshop, 2018

Service Rate Region of Content Access from Erasure Coded Storage.
Proceedings of the IEEE Information Theory Workshop, 2018

Two Freshness Metrics for Local Cache Refresh.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Heuristics for Analyzing Download Time in MDS Coded Storage Systems.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Minimizing content staleness in dynamo-style replicated storage systems.
Proceedings of the IEEE INFOCOM 2018, 2018

On Distributed Storage Allocations of Large Files for Maximum Service Rate.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

On the Effect of Task-to-Worker Assignment in Distributed Computing Systems with Stragglers.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Efficient Redundancy Techniques for Latency Reduction in Cloud Systems.
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2017

Straggler Mitigation by Delayed Relaunch of Tasks.
SIGMETRICS Perform. Evaluation Rev., 2017

Effective Straggler Mitigation: Which Clones Should Attack and When?
SIGMETRICS Perform. Evaluation Rev., 2017

Representations of the Multicast Network Problem.
CoRR, 2017

Simplex Queues for Hot-Data Download.
Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05, 2017

Backlog-adaptive compression: Age of information.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Timely updates over an erasure channel.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Status updates through M/G/1/1 queues with HARQ.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Status updates through multicast networks.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

On the service capacity region of accessing erasure coded content.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Successive Segmentation-Based Coding for Broadcasting Over Erasure Channels.
IEEE Trans. Inf. Theory, 2016

(Secure) Linear network coding multicast - A theoretical minimum and some open problems.
Des. Codes Cryptogr., 2016

Coding Theory in the Time of Big Data (Dagstuhl Seminar 16321).
Dagstuhl Reports, 2016

On storage allocation for maximum service rate in distributed storage systems.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Secrecy Capacities in Space-Division Multiplexed Fiber Optic Communication Systems.
IEEE Trans. Inf. Forensics Secur., 2015

Queues with Redundancy: Latency-Cost Analysis.
SIGMETRICS Perform. Evaluation Rev., 2015

SEARS: Space efficient and reliable storage system in the cloud.
Proceedings of the 40th IEEE Conference on Local Computer Networks, 2015

Coding for source-broadcasting over erasure channels with feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Analyzing the download time of availability codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Physical Layer Security of Space-Division Multiplexed Fiber-Optic Communication Systems in the Presence of Multiple Eavesdroppers.
Proceedings of the 2015 IEEE Global Communications Conference, 2015

Enhanced physical layer security of MIMO-SDM systems through information scrambling.
Proceedings of the European Conference on Optical Communication, 2015

When do the availability codes make the stored data more available?
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Efficient replication of queued tasks for latency reduction in cloud systems.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Why Reading Patterns Matter in Storage Coding & Scheduling Design.
Proceedings of the 8th IEEE International Conference on Cloud Computing, 2015

2014
Rate-Distortion-Based Physical Layer Secrecy with Applications to Multimode Fiber.
IEEE Trans. Commun., 2014

Modeling Network Coded TCP: Analysis of Throughput and Energy Cost.
Mob. Networks Appl., 2014

On the Delay-Storage Trade-Off in Content Download from Coded Distributed Storage Systems.
IEEE J. Sel. Areas Commun., 2014

Dynamic control of video quality for AVS.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An error probability approach for quantifying physical layer security of MIMO-SDM systems.
Proceedings of the European Conference on Optical Communication, 2014

Isn't hybrid ARQ sufficient?
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Low Complexity Doped Wireless Broadcast for Multimedia Applications.
IEEE Trans. Commun., 2013

Three schemes for wireless coded broadcast to heterogeneous users.
Phys. Commun., 2013

Introduction to the Special Issue on Network Coding and its Applications to Wireless Communications.
Phys. Commun., 2013

Coding Theory (Dagstuhl Seminar 13351).
Dagstuhl Reports, 2013

Resolution-aware network coded storage
CoRR, 2013

Rate-Distortion-Based Physical Layer Secrecy in Multimode Fiber
CoRR, 2013

Trade-Off between Cost and Goodput in Wireless: Replacing Transmitters with Coding.
Proceedings of the Mobile Networks and Management - 5th International Conference, 2013

Source broadcasting over erasure channels: Distortion bounds and code design.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Some coding and information theoretic problems in contemporary (video) content delivery.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Round-robin overlapping generations coding for fast content download.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Distortion bounds for broadcasting a binary source over binary erasure channels.
Proceedings of the 13th Canadian Workshop on Information Theory, 2013

On the secrecy capacity of the space-division multiplexed fiber optical communication systems.
Proceedings of the IEEE Conference on Communications and Network Security, 2013

The Code rebalancing problem for a storage-flexible Data Center Network.
Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012
Secure Network Coding for Wiretap Networks of Type II.
IEEE Trans. Inf. Theory, 2012

Coding Improves the Throughput-Delay Tradeoff in Mobile Wireless Networks.
IEEE Trans. Inf. Theory, 2012

Optimized IR-HARQ Schemes Based on Punctured LDPC Codes Over the BEC.
IEEE Trans. Inf. Theory, 2012

Low Complexity Differentiating Adaptive Erasure Codes for Multimedia Wireless Broadcast
CoRR, 2012

Trade-off between cost and goodput in wireless
CoRR, 2012

Suppressing the Cliff Effect in Video Reproduction Quality.
Bell Labs Tech. J., 2012

Round-robin streaming with generations.
Proceedings of the International Symposium on Network Coding, 2012

Quadratic Gaussian source broadcast with individual bandwidth mismatches.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Coding for fast content download.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Toward sustainable networking: Storage area networks with network coding.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Physical layer security in space-division multiplexed fiber optic communications.
Proceedings of the Conference Record of the Forty Sixth Asilomar Conference on Signals, 2012

2011
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding.
IEEE Trans. Inf. Theory, 2011

Update efficient codes for distributed storage.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Cliff effect suppression through multiple-descriptions with split personality.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Is rateless paradigm fitted for lossless compression of erasure-impaired sources?
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks.
IEEE J. Sel. Areas Commun., 2010

Collecting Coded Coupons over Overlapping Generations
CoRR, 2010

Collecting Code Coupons Over Generations
CoRR, 2010

Memory allocation in distributed storage networks.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Collecting coded coupons over generations.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Reducing delay with coding in (mobile) multi-agent information transfer.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

Update-efficient codes for erasure correction.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Doped fountain coding for minimum delay data collection in circular networks.
IEEE J. Sel. Areas Commun., 2009

Network coding for efficient network multicast.
Bell Labs Tech. J., 2009

Coding improves the throughput-delay trade-off in mobile wireless networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Rateless codes for single-server streaming to diverse users.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Incremental Redundancy Cooperative Coding for Wireless Networks: Cooperative Diversity, Coding, and Transmission Energy Gains.
IEEE Trans. Inf. Theory, 2008

Network multicast with network coding [Lecture Notes].
IEEE Signal Process. Mag., 2008

Network Coding Capacity of Random Wireless Networks under a SINR Model
CoRR, 2008

On secure communication over wireless erasure networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Raptor codes based distributed storage algorithms for wireless sensor networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks.
Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008

Decentralized fountain codes for minimum-delay data collection.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007
Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles.
IEEE Trans. Inf. Theory, 2007

Network Coding Applications.
Found. Trends Netw., 2007

Network Coding Fundamentals.
Found. Trends Netw., 2007

Network Coding Capacity of Random Wireless Networks under a Signal-to-Interference-and-Noise Model
CoRR, 2007

Hybrid ARQ: Theory, State of the Art and Future Directions.
Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007

On Wiretap Networks II.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Bounds on Codes Based on Graph Theory.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Reliable channel regions for good binary codes transmitted over parallel channels.
IEEE Trans. Inf. Theory, 2006

Information flow decomposition for network coding.
IEEE Trans. Inf. Theory, 2006

On average throughput and alphabet size in network coding.
IEEE Trans. Inf. Theory, 2006

Incremental Redundancy Cooperative Coding for Wireless Networks: Cooperative Diversity, Coding, and Transmission Energy Gain
CoRR, 2006

Punctured vs Rateless Codes for Hybrid ARQ.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

On Achievable Information Rates in Single-Source Non-Uniform Demand Networks.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Trapping Sets in Irregular LDPC Code Ensembles.
Proceedings of IEEE International Conference on Communications, 2006

On Multicast in Quantum Networks.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

Stopping and Trapping Sets in Generalized Covering Arrays.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005
On the weight spectrum of good linear binary codes.
IEEE Trans. Inf. Theory, 2005

LDPC code ensembles for incremental redundancy hybrid ARQ.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Incremental multi-hop based on "good" punctured codes and its reliable hop rate.
Proceedings of the 2004 IEEE Wireless Communications and Networking Conference , 2004

Decentralized network coding.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Reliable channel regions for good codes transmitted over parallel channels.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Subtree decomposition for network coding.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A connection between network coding and convolutional codes.
Proceedings of IEEE International Conference on Communications, 2004

2003
Bit-optimal Decoding of Codes Whose Tanner Graphs Are Trees.
Discret. Appl. Math., 2003

Punctured turbo code ensembles.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Hybrid ARQ with Random Transmission Assignments.
Proceedings of the Advances in Network Information Theory, 2003

2002
Compressing quantum mixed-state sources by sending classical information.
IEEE Trans. Inf. Theory, 2002

Writing sequences on the plane.
IEEE Trans. Inf. Theory, 2002

Extraction of perceptually important colors and similarity measurement for image matching, retrieval and analysis.
IEEE Trans. Image Process., 2002

2001
Color quantization and processing by Fibonacci lattices.
IEEE Trans. Image Process., 2001

A combinatorial technique for constructing high-rate MTR-RLL codes.
IEEE J. Sel. Areas Commun., 2001

LDPC codes: a group algebra formulation.
Electron. Notes Discret. Math., 2001

2000
Quantization of color spaces and processing of color images by fibonacci lattices.
Proceedings of the Human Vision and Electronic Imaging V, 2000

1999
Constrained coding for binary channels with high intersymbol interference.
IEEE Trans. Inf. Theory, 1999

1998
Multihead Detection for Multitrack Recording Channels.
IEEE Trans. Inf. Theory, 1998

1997
Decoding Techniques for Some Specially Constructed Dc-Free Codes.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1995
Coding for two-head recording systems.
IEEE Trans. Inf. Theory, 1995


  Loading...