1 citations · 1 across the 5 of their papers we have counts for
13 papers
Universal Decoding for Unequal Error Protection
Seyed AmirPouya Moeini, Albert Guillén i Fàbregas
We study universal unequal error protection of a single special message over discrete memoryless channels. We construct a sequence of codes with a decoding rule that does not depen…
An Upper Bound to the Undetected Error Exponent with Erasure Decoding at Positive Rates
Seyed AmirPouya Moeini, Marco Dalai, Albert Guillén i Fàbregas
We study the undetected-error exponent of discrete memoryless channels with erasure decoding. Assuming that the undetected-error and erasure probabilities vanish, we derive an uppe…
Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity
Ran Tamir, Nir Weinberger, Albert Guillén i Fàbregas
We study the amount of reliable information that can be stored in a DNA-based storage system with noisy sequencing, where each codeword is composed of short DNA molecules. We analy…
Achievable Rates and Error Exponents for a Class of Mismatched Compound Channels
Priyanka Patel, Francesc Molina, Albert Guillén i Fàbregas
This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding met…
A Refinement of Expurgation
Giuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura
We show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily sma…
Universal Neyman-Pearson Classification with a Known Hypothesis
Parham Boroumand, Albert Guillén i Fàbregas
We propose a universal classifier for binary Neyman-Pearson classification where null distribution is known while only a training sequence is available for the alternative distribu…
Typical Error Exponents: A Dual Domain Derivation
Giuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura
This paper shows that the probability that the error exponent of a given code randomly generated from a pairwise independent ensemble being smaller than a lower bound on the typica…
Mismatched decoding reliability function at zero rate
Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai
We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The bound is based on a result by Komlós that shows the existence of a subcode with…
A Single-Letter Upper Bound to the Mismatch Capacity
Ehsan Asadi Kangarshahi, Albert Guillén i Fàbregas
We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of…
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes
Ran Tamir, Neri Merhav, Nir Weinberger +1
This work studies the deviations of the error exponent of the constant composition code ensemble around its expectation, known as the error exponent of the typical random code (TRC…
The Error Probability of Generalized Perfect Codes via the Meta-Converse
Gonzalo Vazquez-Vilar, Albert Guillén i Fàbregas, Sergio Verdú
We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This notion generalizes previous definitions o…
Bayesian M-ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds are Tight
Gonzalo Vazquez-Vilar, Adrià Tauste Campo, Albert Guillén i Fàbregas +1
Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability…
Shaping Bits
Albert Guillen i Fabregas, Alfonso Martinez
The performance of bit-interleaved coded modulation (BICM) with bit shaping (i.e., non-equiprobable bit probabilities in the underlying binary code) is studied. For the Gaussian ch…