Zobrazeno 1 - 10
of 103
pro vyhledávání: '"Fabregas, Albert Guillen i"'
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 small fraction of codewords from a randomly selected code results in a co
Externí odkaz:
http://arxiv.org/abs/2307.12162
We find the exact typical error exponent of constant composition generalized random Gilbert-Varshamov (RGV) codes over DMCs channels with generalized likelihood decoding. We show that the typical error exponent of the RGV ensemble is equal to the exp
Externí odkaz:
http://arxiv.org/abs/2211.12238
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 distribution. The proposed classifier interpolates between Hoeffding's classif
Externí odkaz:
http://arxiv.org/abs/2206.11700
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 typical random-coding exponent tends to zero as the codeword length tends to
Externí odkaz:
http://arxiv.org/abs/2203.15607
This paper studies the concentration properties of random codes. Specifically, we show that, for discrete memoryless channels, the error exponent of a randomly generated code with pairwise-independent codewords converges in probability to its expecta
Externí odkaz:
http://arxiv.org/abs/2203.07853
We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the probability of erro
Externí odkaz:
http://arxiv.org/abs/2111.04797
We study a variation of Bayesian M-ary hypothesis testing in which the test outputs a list of L candidates out of the M possible upon processing the observation. We study the minimum error probability of list hypothesis testing, where an error is def
Externí odkaz:
http://arxiv.org/abs/2110.14608
We study the problem of mismatched binary hypothesis testing between i.i.d. distributions. We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are different from the distri
Externí odkaz:
http://arxiv.org/abs/2107.06679
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\'os that shows the existence of a subcode with certain symmetry properties. The bound is shown to coincide with th
Externí odkaz:
http://arxiv.org/abs/2101.10238
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 the channel, such that a maximum-likelihood decoding error on the tran
Externí odkaz:
http://arxiv.org/abs/2004.01785