Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Problems of Information Transmission

Remark on the reliability function of a symmetric channel under list decoding

Vladimir M. Blinovsky

Published Jun 1, 2011• 0 citations
Publisher

Abstract

We complete the derivation of a formula for the reliability function of a q -ary symmetric channel under list decoding at zero rate.
DOI
10.1134/s0032946011020013

Related papers

About the reliability function of symmetric channel under list decoding

Vladimir M. Blinovsky

We complete the derivation of the formula for the reliability function of q-ary symmetric channel under list decoding for zero rate.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2011•0 citations

Zero-rate Reliability Function for Mismatched Decoding

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 certain symmetry properties. The bound is shown to coincide with the expurgated exponent at rate zero for a broad family of channel and decoding metric pairs. A full version of this paper is accessible at: https://arxiv.org/pdf/2101.10238.pdf

IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•1 citation

Exponent of the probability of list-of-L decoding error at low rates

Vladimir M. Blinovsky

There exists a lot of works devoted to obtaining the bound for the exponent of the probability of error in different channels. In this paper we prove that the expurgation exponent of the list-of-L decoding error is tight at zero rate.

IEEE International Symposium on Information Theory (ISIT)•Nov 13, 2002•2 citations

Random Coding Bound for the Reliability Function in Quantum Channel: General Case

Vladimir M. Blinovsky

We complete the proof of conjecture, which allows to complete the derivation of the random coding bound for the reliability function in quantum channel in the case of arbitrary signal states

arXiv:1112.4876•Dec 20, 2011•0 citations

Zero-Error List Decoding for Classical-Quantum Channels

Marco Dalai, Filippo Girardi, Ludovico Lami

The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size two and a converse bound holding for every fixed list size. The two bounds coincide for channels whose pairwise absolute state overlaps form a positive semi-definite matrix. Finally, we discuss a remarkable peculiarity of the classical-quantum case: differently from the fully classical setting, the rate at which the sphere-packing bound diverges might not be achievable by zero-error list codes, even when we take the limit of fixed but arbitrarily large list size.

quant-pharXiv:2601.09786•IEEE International Symposium on Information Theory (ISIT)•Jan 16, 2026•2 citations

List-Decoding Capacity Implies Capacity on the 𝑞-ary Symmetric Channel

Francisco Pernice, Oscar Sprumont, Mary K. Wootters

It is known that the Shannon capacity of the q-ary symmetric channel (qSC) is the same as the list-decoding capacity of an adversarial channel, raising the question of whether there is a formal (and black-box) connection between the two.We show that there is: Any linear code 𝐶 ⊆ F 𝑛 𝑞 that has superconstant minimum distance and achieves list-decoding capacity also achieves capacity on the qSC. CCS Concepts• Theory of computation → Error-correcting codes.

ACM Symposium on Theory of Computing (STOC)•Jun 15, 2025•2 citations
The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size two and a converse bound holding for every fixed list size. The two bounds coincide for channels whose pairwise absolute state overlaps form a positive semi-definite matrix. Finally, we discuss a remarkable peculiarity of the classical-quantum case: differently from the fully classical setting, the rate at which the sphere-packing bound diverges might not be achievable by zero-error list codes, even when we take the limit of fixed but arbitrarily large list size.