research
∙
09/08/2023
Modulation and Estimation with a Helper
The problem of transmitting a parameter value over an additive white Gau...
share
research
∙
08/01/2023
Trade-offs Between Weak-Noise Performance and Probability of Anomaly in Parameter Estimation from Noisy Chaotic Signals
We consider the problem of parameter estimation, based on noisy chaotic ...
research
∙
04/06/2023
Some families of Jensen-like inequalities with application to information theory
It is well known that the traditional Jensen inequality is proved by low...
research
∙
12/23/2022
A Universal Random Coding Ensemble for Sample-wise Lossy Compression
We propose a universal ensemble for random selection of rate-distortion ...
research
∙
09/19/2022
The Secrecy Capacity of The Gaussian Wiretap Channel with Rate-Limited Help
The Gaussian wiretap channel with rate-limited help, available at the le...
research
∙
06/21/2022
Codebook Mismatch Can Be Fully Compensated by Mismatched Decoding
We consider an ensemble of constant composition codes that are subsets o...
research
∙
05/14/2022
Error Exponents of the Dirty-Paper and Gel'fand-Pinsker Channels
We derive various error exponents for communication channels with random...
research
∙
03/07/2022
D-semifaithful codes that are universal over both memoryless sources and distortion measures
We prove the existence of codebooks for d-semifaithful lossy compression...
research
∙
02/06/2022
Optimal Correlators and Waveforms for Mismatched Detection
We consider the classical Neymann-Pearson hypothesis testing problem of ...
research
∙
12/27/2021
Universal Randomized Guessing Subjected to Distortion
In this paper, we consider the problem of guessing a sequence subject to...
research
∙
12/15/2021
Encoding Individual Source Sequences for the Wiretap Channel
We consider the problem of encoding a deterministic source sequence (a.k...
research
∙
09/26/2021
The DNA Storage Channel: Capacity and Error Probability
The DNA storage channel is considered, in which M Deoxyribonucleic acid ...
research
∙
07/19/2021
Conveying individual source sequences over memoryless channels using finite-state decoders with source side information
We study the following semi-deterministic setting of the joint source-ch...
research
∙
06/24/2021
Guessing Based on Compressed Side Information
A source sequence is to be guessed with some fidelity based on a rate-li...
research
∙
11/20/2020
On Error Exponents of Encoder-Assisted Communication Systems
We consider a point-to-point communication system, where in addition to ...
research
∙
11/19/2020
Error Exponents in the Bee Identification Problem
We derive various error exponents in the bee identification problem unde...
research
∙
09/18/2020
On More General Distributions of Random Binning for Slepian-Wolf Encoding
Traditionally, ensembles of Slepian-Wolf (SW) codes are defined such tha...
research
∙
07/25/2020
Universal Decoding for Asynchronous Slepian-Wolf Encoding
We consider the problem of (almost) lossless source coding of two correl...
research
∙
07/23/2020
The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code
We provide two results concerning the optimality of the maximum mutual i...
research
∙
06/08/2020
Optimal Work Extraction and the Minimum Description Length Principle
We discuss work extraction from classical information engines (e.g., Szi...
research
∙
05/17/2020
Trade-offs Between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes
Typical random codes (TRC) in a communication scenario of source coding ...
research
∙
05/12/2020
Some Useful Integral Representations for Information-Theoretic Analyses
This work is an extension of our earlier article, where a well–known int...
research
∙
12/20/2019
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes
This work studies the deviations of the error exponent of the constant c...
research
∙
12/12/2019
An Integral Representation of the Logarithmic Function with Applications in Information Theory
We explore a well-known integral representation of the logarithmic funct...
research
∙
10/01/2019
Noisy Guesses
We consider the problem of guessing a random, finite-alphabet, secret n-...
research
∙
08/12/2019
A Lagrange-Dual Lower Bound to the Error Exponent Function of the Typical Random Code
A Lagrange-dual (Gallager-style) lower bound is derived for the error ex...
research
∙
06/26/2019
Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines
Motivated by earlier results on universal randomized guessing, we consid...
research
∙
04/25/2019
Weak-Noise Modulation-Estimation of Vector Parameters
We address the problem of modulating a parameter onto a power-limited si...
research
∙
03/04/2019
Error Exponents of Typical Random Trellis Codes
In continuation to an earlier work, where error exponents of typical ran...
research
∙
12/15/2018
Error Exponents of Typical Random Codes for the Colored Gaussian Channel
The error exponent of the typical random code is defined as the asymptot...
research
∙
11/11/2018
Universal Randomized Guessing with Application to Asynchronous Decentralized Brute-Force Attacks
Consider the problem of guessing the realization of a random vector X by...
research
∙
05/31/2018
False-Accept/False-Reject Trade-offs in Biometric Authentication Systems
Biometric authentication systems, based on secret key generation, work a...
research
∙
02/13/2018
Trade-offs Between Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation
We focus on the problem of modulating a parameter onto a power-limited s...
research
∙
02/08/2018
Detection Games Under Fully Active Adversaries
We study a binary hypothesis testing problem in which a defender must de...
research
∙
11/28/2017
Expurgated Bounds for the Asymmetric Broadcast Channel
This work contains two main contributions concerning the expurgation of ...
research
∙
05/20/2007
