b'Neri Merhav'

On Error Exponents of Encoder-Assisted Communication Systems

We consider a point-to-point communication system, where in addition to ...
11/20/2020 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Error Exponents in the Bee Identification Problem

We derive various error exponents in the bee identification problem unde...
11/19/2020 ∙ by Ran Tamir, et al. ∙ 0 ∙ share

read it
On More General Distributions of Random Binning for Slepian-Wolf Encoding

Traditionally, ensembles of Slepian-Wolf (SW) codes are defined such tha...
09/18/2020 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Universal Decoding for Asynchronous Slepian-Wolf Encoding

We consider the problem of (almost) lossless source coding of two correl...
07/25/2020 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
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...
07/23/2020 ∙ by Ran Tamir, et al. ∙ 0 ∙ share

read it
Optimal Work Extraction and the Minimum Description Length Principle

We discuss work extraction from classical information engines (e.g., Szi...
06/08/2020 ∙ by Léo Touzo, et al. ∙ 0 ∙ share

read it
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 ...
05/17/2020 ∙ by Ran Tamir, et al. ∙ 0 ∙ share

read it
Some Useful Integral Representations for Information-Theoretic Analyses

This work is an extension of our earlier article, where a well–known int...
05/12/2020 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes

This work studies the deviations of the error exponent of the constant c...
12/20/2019 ∙ by Ran Tamir, et al. ∙ 0 ∙ share

read it
An Integral Representation of the Logarithmic Function with Applications in Information Theory

We explore a well-known integral representation of the logarithmic funct...
12/12/2019 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Noisy Guesses

We consider the problem of guessing a random, finite-alphabet, secret n-...
10/01/2019 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
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...
08/12/2019 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines

Motivated by earlier results on universal randomized guessing, we consid...
06/26/2019 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Weak-Noise Modulation-Estimation of Vector Parameters

We address the problem of modulating a parameter onto a power-limited si...
04/25/2019 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Error Exponents of Typical Random Trellis Codes

In continuation to an earlier work, where error exponents of typical ran...
03/04/2019 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Error Exponents of Typical Random Codes for the Colored Gaussian Channel

The error exponent of the typical random code is defined as the asymptot...
12/15/2018 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Universal Randomized Guessing with Application to Asynchronous Decentralized Brute-Force Attacks

Consider the problem of guessing the realization of a random vector X by...
11/11/2018 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
False-Accept/False-Reject Trade-offs in Biometric Authentication Systems

Biometric authentication systems, based on secret key generation, work a...
05/31/2018 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
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...
02/13/2018 ∙ by Neri Merhav, et al. ∙ 0 ∙ share

read it
Detection Games Under Fully Active Adversaries

We study a binary hypothesis testing problem in which a defender must de...
02/08/2018 ∙ by Benedetta Tondi, et al. ∙ 0 ∙ share

read it
Expurgated Bounds for the Asymmetric Broadcast Channel

This work contains two main contributions concerning the expurgation of ...
11/28/2017 ∙ by Ran Averbuch, et al. ∙ 0 ∙ share

read it
Scanning and Sequential Decision Making for Multi-Dimensional Data - Part II: the Noisy Case

We consider the problem of sequential decision making on random fields c...
05/20/2007 ∙ by Asaf Cohen, et al. ∙ 0 ∙ share

read it

Neri Merhav

Featured Co-authors

Tsachy Weissman

Mauro Barni

Benedetta Tondi

Asaf Cohen

Albert Guillén i Fàbregas

Igal Sason

Matteo Marsili

Nir Weinberger

Ran Tamir

Édgar Roldán

Léo Touzo

On Error Exponents of Encoder-Assisted Communication Systems

Error Exponents in the Bee Identification Problem

On More General Distributions of Random Binning for Slepian-Wolf Encoding

Universal Decoding for Asynchronous Slepian-Wolf Encoding

The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code

Optimal Work Extraction and the Minimum Description Length Principle

Trade-offs Between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes

Some Useful Integral Representations for Information-Theoretic Analyses

Large Deviations Behavior of the Logarithmic Error Probability of Random Codes

An Integral Representation of the Logarithmic Function with Applications in Information Theory

Noisy Guesses

A Lagrange-Dual Lower Bound to the Error Exponent Function of the Typical Random Code

Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines

Weak-Noise Modulation-Estimation of Vector Parameters

Error Exponents of Typical Random Trellis Codes

Error Exponents of Typical Random Codes for the Colored Gaussian Channel

Universal Randomized Guessing with Application to Asynchronous Decentralized Brute-Force Attacks

False-Accept/False-Reject Trade-offs in Biometric Authentication Systems

Trade-offs Between Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation

Detection Games Under Fully Active Adversaries

Expurgated Bounds for the Asymmetric Broadcast Channel

Scanning and Sequential Decision Making for Multi-Dimensional Data - Part II: the Noisy Case