Soft Guessing Random Additive Noise Decoding queries corrections in an observation-dependent order, defined by the pointwise supremum of codebook-independent uniform-input correction posteriors, which minimizes, at each observation, the worst-case logarithm of the rank--posterior product over admissible channel--correction pairs with positive posterior probability.
Abstract
Soft Guessing Random Additive Noise Decoding queries corrections in an observation-dependent order. For a known channel, the matched order ranks corrections by nonincreasing conditional posterior probability. Under channel uncertainty, admissible channels may induce matched orders that assign different ranks to the same correction at the same observation. We instead use a posterior-envelope order, defined by the pointwise supremum of codebook-independent uniform-input correction posteriors. For fixed measurable posterior representatives and a measurable envelope, this order minimizes, at each observation, the worst-case logarithm of the rank--posterior product over admissible channel--correction pairs with positive posterior probability. For uniform-subset codebooks, this finite-block minimax property does not by itself determine the ensemble-average error exponent, which depends on the distribution of the realized correction rank. For i.i.d. correction--observation pairs with a finite correction alphabet whose joint distribution is dominated by the product of counting measure on that alphabet and a $\sigma$-finite measure on the observation space, Arimoto conditional R\'enyi entropy characterizes the matched rank-moment spectrum. An auxiliary posterior-envelope order preserves this spectrum on $[0,1]$ when its posterior family contains the corresponding conditional power tilts and has subexponential conditional Shtarkov complexity on observation sets whose complement probabilities decay exponentially faster than the reciprocal correction-space cardinality. Under additional differentiability and entropy nondegeneracy conditions, the auxiliary order attains the matched uniform-subset ensemble-average error exponent at every fixed normalized code rate strictly between zero and one. For uniform-input memoryless channels, this exponent equals Gallager's uniform-input random-coding exponent.
We study finite-blocklength lossy transmission of a Gaussian memoryless source over memoryless, possibly nonstationary block erasure channels under an excess mean-squared distortion criterion. We derive computable nonasymptotic achievability and converse bounds and establish matching third-order, channel-uniform normal...
In error correction, the difference between a codeword and a received word, a candidate noise sequence, carries information on the confidence of the codeword as a proposed decoding. For additive channels, it is known that if noise sequences are ranked in decreasing order of likelihood, a lower rank correlates with high...
Conrad Struss, Muriel Médard, Ken R. Duffy· 0 citations
A distribution-free decomposition: the probability that a comparison flips is bounded by the probability mass of exact margins near zero plus the tail probability of the calibrated residual, and a deterministic coupling theorem for Vamana neighbour selection is proved.
A multiple-access channel transmits messages from several senders to one receiver. For quantum outputs, the receiver must distinguish states depending on all messages, while tests for different decoding errors may not commute. In this paper, we give a self-contained account of simultaneous decoding, in which one joint...
This work revisits the Gray-Wyner problem of lossy compression of bivariate Gaussian sources under the quadratic distortion measure and derives a covariance shell covering lemma that is analogous to the type covering lemma for the discrete case and derives a achievability proof.
We determine the exact second-order asymptotics of covert communication over binary-input discrete memoryless channels when covertness is measured by variational distance. Previous work by Tahmasbi and Bloch [IEEE Trans. Inf. Theory, Apr. 2019] characterized the first-order asymptotics and derived achievability and con...
Qiao-Sheng Zhang, Lin Zhou, Xue-Long Li· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.