Aslan Tchamkerten

IEEE Trans. Inf. Theory, October, 2024

Entropy-Achieving Compression with Private Local Decodability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Reconfigurable Adaptive Channel Sensing.

[BibT_eX]

[DOI]

Manuj Mukherjee

Chadi Jabbour

IEEE Trans. Green Commun. Netw., September, 2023

Feedback Increases the Capacity of Queues with Finite Support Service Times.

[BibT_eX]

[DOI]

K. R. Sahasranand

Proceedings of the IEEE International Symposium on Information Theory, 2023

Data Compression with Private Local Decodability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Local Decoding in Distributed Compression.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, December, 2022

Error-Correction for Sparse Support Recovery Algorithms.

[BibT_eX]

[DOI]

Mohammad Mehrabi

IEEE Trans. Inf. Theory, 2022

Random Access in Distributed Source Coding.

[BibT_eX]

[DOI]

CoRR, 2022

Locally Decodable Slepian-Wolf Compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Capacity-Achieving Input Distribution in Per-Sample Zero-Dispersion Model of Optical Fiber.

[BibT_eX]

[DOI]

Jihad Fahs

IEEE Trans. Inf. Theory, 2021

2020

Local Decode and Update for Big Data Compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Bits Through Queues With Feedback.

[BibT_eX]

[DOI]

Laure Aptel

IEEE Trans. Inf. Theory, 2020

Zero-Error Sum Modulo Two with a Common Observation.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Approximating Probability Distributions by ReLU Networks.

[BibT_eX]

[DOI]

Manuj Mukherjee

Proceedings of the IEEE Information Theory Workshop, 2020

O (log log n) Worst-Case Local Decoding and Update Efficiency for Data Compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Second-Order Asymptotics for Communication Under Strong Asynchronism.

[BibT_eX]

[DOI]

Longguang Li

IEEE Trans. Inf. Theory, 2019

Security of Distance-Bounding: A Survey.

[BibT_eX]

[DOI]

Kasper Bonne Rasmussen

Dave Singelée

Rolando Trujillo-Rasua

Serge Vaudenay

ACM Comput. Surv., 2019

Somatic mutations render human exome and pathogen DNA more similar.

[BibT_eX]

[DOI]

CoRR, 2019

Local Decoding and Update of Compressed Data.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Optimal Input of the Nondispersive Optical Fiber.

[BibT_eX]

[DOI]

Jihad Fahs

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Lattice Codes for Deletion and Repetition Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Sampling Constrained Asynchronous Communication: How to Sleep Efficiently.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Feedback Increases the Capacity of Queues.

[BibT_eX]

[DOI]

Laure Aptel

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Bounds on the Approximation Power of Feedforward Neural Networks.

[BibT_eX]

[DOI]

Mohammad Mehrabi

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Capacity-Achieving Input Distributions in Nondispersive Optical Fibers.

[BibT_eX]

[DOI]

Jihad Fahs

CoRR, 2017

Infinite dispersion in bursty communication.

[BibT_eX]

[DOI]

Longguang Li

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Distributed Function Computation Over a Rooted Directed Tree.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

2015

Quickest Transient-Change Detection under a Sampling Constraint.

[BibT_eX]

[DOI]

CoRR, 2015

Sequential detection of transient changes in stochastic systems under a sampling constraint.

[BibT_eX]

[DOI]

Ehsan Ebrahimzadeh

Proceedings of the IEEE International Symposium on Information Theory, 2015

Asynchronous capacity per unit cost under a receiver sampling constraint.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Energy and Sampling Constrained Asynchronous Communication.

[BibT_eX]

[DOI]

Giuseppe Caire

IEEE Trans. Inf. Theory, 2014

Lattice Codes for the Binary Deletion Channel.

[BibT_eX]

[DOI]

Lin Sok

Patrick Solé

CoRR, 2014

2013

Asynchronous Communication: Capacity Bounds and Suboptimality of Training.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Asynchronous Capacity per Unit Cost.

[BibT_eX]

[DOI]

David Tse

IEEE Trans. Inf. Theory, 2013

Distributed function computation over a tree network.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Lattice based codes for insertion and deletion channels.

[BibT_eX]

[DOI]

Lin Sok

Patrick Solé

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Estimating a Random Walk First-Passage Time From Noisy or Delayed Observations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Sequential estimation of a threshold crossing time for a Gaussian random walk through correlated observations.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

On function computation over a cascade network.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On cooperation in multi-terminal computation and rate distortion.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On the capacity of the one-bit deletion and duplication channel.

[BibT_eX]

[DOI]

Hamed Mirghasemi

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

On Bounded Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Computing a Function of Correlated Sources

[BibT_eX]

[DOI]

CoRR, 2011

Computing a function of correlated Sources: A rate region.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Estimating a Gaussian random walk first-passage time from noisy or delayed observations.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Tracking a Threshold Crossing Time of a Gaussian Random Walk Through Correlated Observations

[BibT_eX]

[DOI]

CoRR, 2010

Heavy weight codes.

[BibT_eX]

[DOI]

Gérard D. Cohen

Patrick Solé

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Communication under strong asynchronism.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Tracking Stopping Times Through Noisy Observations.

[BibT_eX]

[DOI]

Urs Niesen

IEEE Trans. Inf. Theory, 2009

Training-Based Schemes are Suboptimal for High Rate Asynchronous Communication

[BibT_eX]

[DOI]

CoRR, 2009

An Efficient Distance Bounding RFID Authentication Protocol: Balancing False-Acceptance Rate and Memory Requirement.

[BibT_eX]

[DOI]

Gildas Avoine

Proceedings of the Information Security, 12th International Conference, 2009

2008

Secure Broadcasting Over Fading Channels.

[BibT_eX]

[DOI]

Ashish Khisti

IEEE Trans. Inf. Theory, 2008

Optimal Sequential Frame Synchronization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

An asymptotically optimal RFID protocol against relay attacks.

[BibT_eX]

[DOI]

Gildas Avoine

IACR Cryptol. ePrint Arch., 2008

An Asymptotically Optimal RFID Authentication Protocol Against Relay Attacks

[BibT_eX]

[DOI]

Gildas Avoine

CoRR, 2008

On the capacity region of asynchronous channels.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Tracking Stopping Times

[BibT_eX]

[DOI]

Urs Niesen

CoRR, 2007

Secure Broadcasting

[BibT_eX]

[DOI]

Ashish Khisti

CoRR, 2007

The Complexity of Tracking a Stopping Time.

[BibT_eX]

[DOI]

Urs Niesen

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Variable length coding over an unknown channel.

[BibT_eX]

[DOI]

I. Emre Telatar

IEEE Trans. Inf. Theory, 2006

On the use of training sequences for channel estimation.

[BibT_eX]

[DOI]

I. Emre Telatar

IEEE Trans. Inf. Theory, 2006

Information Theoretic Perspectives on Synchronization.

[BibT_eX]

[DOI]

Ashish Khisti

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

On the universality of Burnashev's error exponent.

[BibT_eX]

[DOI]

I. Emre Telatar

IEEE Trans. Inf. Theory, 2005

2004

On the Discreteness of Capacity-Achieving Distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Optimal feedback schemes over unknown channels.

[BibT_eX]

[DOI]