Pith. sign in

REVIEW 1 major objections 4 minor 1 cited by

Rate-reliability tradeoff for deterministic identification

T0 review · 1 major / 4 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Demanding exponentially small error probabilities in deterministic identification restores linear message growth, with the achievable rate set by the Minkowski dimension of the channel's square-root output set.

desk verdict New rate-reliability results for deterministic identification are solid, but the claimed recovery of the pessimistic capacity bound has a gap that needs a fix. read the letter →

arxiv 2502.02389 v4 pith:VBINBURH submitted 2025-02-04 cs.IT math.ITquant-ph

Pau Colomer , Christian Deppe , Holger Boche , Andreas Winter This is my paper · ORCID
classification cs.ITmath.ITquant-ph MSC 94A2428A8081P45
keywords deterministicidentificationrate-reliabilityfunctionerrorexponentsMinkowskidimensionpackingandcoveringnumberslinearithmicscalingmemorylesschannelsclassical-quantum
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper studies deterministic identification, the task in which a receiver checks whether the transmitted message equals one particular message of interest rather than decoding it. For channels with a finite output alphabet, it claims that if both error probabilities must vanish exponentially in the block length, with exponents E1 and E2, then the number of identifiable messages grows only linearly with n, and the rate is a function of the exponents. The central quantitative claim is that this rate is sandwiched between about (1/4)d_M log(1/min{E1,E2}) and (1/2)d_M log(1/min{E1,E2}), where d_M is the Minkowski dimension of the square-root output probability set. That means the earlier superlinear (n log n) identification rates survive only when the exponents tend to zero slowly, and it explains those rates as a geometric, not a purely combinatorial, phenomenon. The paper also shows that requiring only one of the two errors to be exponentially small still destroys the superlinear regime, and it extends the bounds to classical-quantum channels.

What carries the argument

The load-bearing object is the square-root output probability set $\sqrt$(W(X)) = {$\sqrt$(W_x) : x in X}, a subset of the non-negative orthant of the unit sphere in R^Y; the paper works in the Euclidean metric on this set. The rate bounds are expressed through the packing number Π_delta, the maximum number of pairwise disjoint delta-balls, and the covering number Γ_delta, the minimum number of delta-balls needed to cover the set, whose log-growth rates as delta approaches 0 define the lower and upper Minkowski dimensions. The coding argument selects letter-wise Euclidean packings of $\sqrt$(W(X)) and combines them with Hamming-distance separation and conditional typical sets as identification tests, while the converse partitions the input space into covering balls and shows that no two code words can share a ball.

What would settle it

For a fixed channel with known Minkowski dimension d_M of sqrt(W(X)), set E1 = E2 = E and compute the maximum rate for block length n, either from an exhaustive search on a small alphabet or from an optimized code construction; if it exceeds the covering-number bound of Theorem 7 the converse fails, and if it falls below the packing bound of Theorem 4 for all sufficiently large n the achievability claim fails. A cleaner test in the small-exponent regime is to measure the slope of R(n)/log(1/E) as E tends to 0 for a one-dimensional output set and check whether it lies between d_M/4 and d_M/2.

Watch

Extended reading notes

Core claim

The paper's central discovery is that the rate-reliability function for deterministic identification is controlled by packing and covering numbers of the set $\sqrt$(W(X)) = {$\sqrt$(W_x) : x in X} in the unit sphere of R^Y. Theorem 4 shows a code can achieve rate at least (1-t) log Π_{4th-root(6E/$ct^{2}$)}($\sqrt$(W(X))) minus entropy and lower-order terms, while Theorem 7 shows any code with error exponents at least E has rate at most log Γ_{1/2 $\sqrt$(1-$e^{{-E/2}}$)}($\sqrt$(W(X))). In the asymptotic small-exponent limit, Corollaries 6 and 8 convert these into the sandwich (1/4)d_M log(1/min E) <= R <= (1/2)d_M log(1/min E). Letting E(n) tend to 0 slowly, with omega(1/n) <= E(n) <= o(1), recovers the prior linearithmic capacity bounds 1/4 d_M <= C_DI <= 1/2 d_M. For zero-dimensional output sets, such as a Bernoulli channel whose input set accumulates at a point, the relevant scale becomes n log log n, with capacity 1.

Load-bearing premise

Throughout the paper the output alphabet Y is assumed finite, so sqrt(W(X)) is a bounded subset of a finite-dimensional sphere; all packing, covering, and Minkowski-dimension arguments depend on this, and the abstract's phrase 'arbitrary memoryless channels' reaches beyond what is actually proved.

Editorial extensions

If this is right

  • For any finite-output memoryless channel, a DI code with exponentially small errors of both kinds cannot identify more than about 2^{((1/2)d_M log(1/E))n} messages, while at least about 2^{((1/4)d_M log(1/E))n} messages are always possible for small E.
  • The linearithmic capacity bounds of the earlier dimension-based theory follow as a limit of the new finite-blocklength bounds, with the lower and upper Minkowski dimensions playing the pessimistic and optimistic roles.
  • If only one error probability is forced to vanish exponentially, the linearithmic regime is lost as well: the rate is at most O(log log n) in general and O(1) when all output probabilities are bounded away from zero.
  • For zero-dimensional output probability sets, the relevant scale shifts from n log n to n log log n, as illustrated by a Bernoulli channel with inputs accumulating at zero.
  • The same packing and covering bounds extend to classical-quantum channels and to general quantum channels restricted to product-state inputs, with the Euclidean metric replaced by the Hilbert-Schmidt distance.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Read constructively, the factor-four gap between the 1/4 and 1/2 constants suggests that the true constant may be found by improving either the typical-set packing code or the covering converse; the paper's own discussion of Gaussian channels already points in that direction.
  • A testable consequence of the sandwich is that for E1 = E2 = E the ratio R(E)/log(1/E) should be asymptotically independent of n but channel-dependent through d_M, so plotting the finite-blocklength bounds for a one-dimensional output set could reveal which constant is approached.
  • The finite output alphabet assumption is the main scope limitation: for continuous output alphabets one would expect the same picture only if an analogous metric entropy for sqrt(W(X)) is finite, and the paper's results do not by themselves cover that case.
  • One-sided error regimes may behave very differently depending on zero-probability structure: the O(log log n) bound could be loose, and the authors leave open whether linearithmic rates are possible for cq-channels in the Stein regime.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 4 minor

Summary. The paper studies deterministic identification (DI) over memoryless channels under the constraint that both identification error probabilities decay exponentially in the block length, with reliability exponents E1 and E2. The main results are finite-blocklength lower and upper bounds on the identification rate R(n) in terms of packing and covering numbers of the square-root output probability set sqrt(W(X)) (Theorems 4 and 7). For small exponents these bounds are expanded into asymptotic expressions involving the lower and upper Minkowski dimensions of sqrt(W(X)) (Corollaries 6 and 8). The paper claims that positive error exponents restore linear scaling of the identifiable message number, and that when the exponents vanish slowly the linearithmic capacity results of the authors' earlier paper [17] are recovered (Theorems 9 and 10). It also treats zero-dimensional output sets, asymmetric Stein/Sanov error regimes with an O(log log n) upper bound, and extends the bounds to classical-quantum and product-input quantum channels.

Significance. If the results hold, they provide a genuinely new finite-blocklength perspective on deterministic identification: the geometric packing/covering structure of the output probability set is separated from the error-exponent control, and the known superlinear rates are explained as a small-exponent phenomenon. The fixed-positive-exponent bounds in Theorems 4 and 7 are written out and internally consistent, and the extension to cq and quantum channels together with the zero-dimensional examples are useful additions. The main caveat is that the recovery of the pessimistic capacity upper bound in Theorem 9 is not fully justified as written; this is a load-bearing part of the claim to recover [17], but it appears repairable by a subsequence/monotonicity argument.

major comments (1)
  1. [Theorem 9, Section IV-A, Eqs. (40), (41), (44), (48)] The converse half of Theorem 9 does not derive the claimed pessimistic capacity upper bound. Equation (41) is an improved upper bound that holds only for error-exponent sequences E(n) lying in the 'bad' set E_b defined by Eq. (40). However, the capacity in Eq. (44) is a supremum over all admissible sequences with E_i(n) -> 0 and n E_i(n) -> infinity. Since the maximum code size is monotone nonincreasing in the exponents, an upper bound for one specially selected E_b sequence does not automatically control the supremum over all admissible sequences; in particular, taking E_1(n)=E_2(n) >= C/n does not yield a bound for exponents smaller than that sequence, and the sequence C/n need not belong to E_b. A repair would require a subsequence argument: for an arbitrary admissible exponent sequence, one can choose n_k and an E_b-sequence with 1/n_k << E_b(n_k) <= E(n_k) (or <= C/n_k) and apply Eq. (41) on that subsequence to bound the liminf. As written, the claimed recovery of the bound Cdot_DI(W) <= (1/2) d_M(sqrt(eX)) is incomplete. The fixed-positive-exponent results in Theorems 4 and 7 and Corollaries 6 and 8 are not affected.
minor comments (4)
  1. [Abstract and Section I-A] The abstract states that the paper treats 'arbitrary memoryless channels', but Section I-A explicitly restricts the analysis to finite output alphabets Y for the rest of the paper. The abstract should be aligned with the proved scope, or the finite-output assumption should be stated there.
  2. [Section V, Theorem 15, Eqs. (82)-(90)] The proof of Theorem 15 requires a uniform margin lambda_{1,2} < 1 - delta/2 for a fixed delta > 0 when passing from the original channel W to the truncated channel V. The theorem statement only says lambda_1 < 1 in the Stein regime (and lambda_2 < 1 in the Sanov regime), which does not exclude sequences with lambda_1(n) -> 1. Please state explicitly that the bounded error is assumed to be uniformly bounded away from 1 by a positive constant, or provide an additional argument for the case where the bounded error approaches 1.
  3. [Section V, proof of Theorem 15] In the paragraph after Eq. (88), the sentence 'Therefore, any DI code for V in the Stein error regime is a code for W...' appears to state the reverse of the implication needed for the upper bound. The inequalities in Eqs. (84)-(88) show that a code for W is also a code for V with slightly larger errors, which is the direction required to upper-bound N_W by N_V; the text should be corrected to avoid confusion.
  4. [Throughout] There are several typos and small presentation issues: 'realted' in Section III-C, 'Ann Harbor' in the header should be 'Ann Arbor', 'For the converse can we take' in the proof of Theorem 10 should be 'For the converse we can take', and the abstract phrase 'a certain parametrisation the channel output set' is missing an 'of'. These do not affect the mathematics.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the new bounds are proved from packing/covering and typicality lemmas; prior capacity results are recovered as corollaries, not assumed.

full rationale

The derivation chain is self-contained in the relevant sense. The new rate-reliability bounds (Theorems 4 and 7, Corollaries 6 and 8) are proved directly from packing and covering numbers, the fidelity-total-variation inequalities in Eqs. (8)-(9), and the typicality Lemmas 2-3 quoted from the authors' prior work [17]; those lemmas are published results with proofs and are used as tools, not as the target conclusion. The recovery of the linearithmic capacities in Theorems 9-10 proceeds by substituting slowly vanishing error exponents into the new bounds, not by assuming the [17] bounds; the paper explicitly derives those earlier results as corollaries. No parameter is fitted to data and renamed a prediction, no uniqueness theorem is imported, and no known result is merely relabeled. The manuscript itself flags the main scope limitation: the abstract's 'arbitrary memoryless channels' is narrowed in Section I-A to finite output alphabets ('For the rest of the paper we will in fact assume that Y is finite'), which is an overstatement of scope rather than a circularity. One mathematical gap exists but is not circular: in the converse of Theorem 9, Eq. (48) applies the 'bad subset' bound Eq. (41) to E1(n)=E2(n)=C/n without proving that this particular sequence lies in the set Eb defined by Eq. (40), while the capacity supremum in Eq. (44) ranges over all admissible exponent sequences. That is an unproved step in the recovery argument, not a reduction of the conclusion to its own input, and it does not affect the fixed-positive-exponent bounds of Theorems 4 and 7.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

No empirical fitting or ad hoc physical entities appear. The arbitrary technical parameters t, eta, and delta are optimization slack that vanish in the limits; the central claims depend only on the channel's output set and its dimension.

assumptions (7)
  • standard math Lemma 2 from [17]: typical sets have probability at least 1 - 2 exp(-delta^2/36K(|Y|)).
    Used in the achievability proof of Theorem 4 to control the error of the first kind. The lemma is quoted from the authors' prior published work and not reproved.
  • standard math Lemma 3 from [17]: a second-kind error bound for entropy typical sets with a separation condition on output distributions.
    Used in the proof of Theorem 4 to bound the error of the second kind. Relies on the published lemma rather than a derivation inside this paper.
  • standard math Minkowski dimension, packing numbers, and covering numbers with the limits in Equations (14)-(16).
    The definitions and the equivalence of packing and covering asymptotics are taken from the fractal geometry literature and are used to convert geometric bounds into dimension bounds.
  • standard math Fidelity versus total variation distance bounds and the square-root metric relation in Equations (8) and (9).
    These inequalities connect statistical distance to Euclidean distance on square-root probability vectors and are used in both achievability and converse directions.
  • standard math Gilbert-Varshamov bound and Hamming ball counting for codes over a finite alphabet.
    Used in Theorem 4 to construct many codewords with large Hamming distance from a letter-wise packing.
  • standard math Hypothesis testing relative entropy, Renyi relative entropy, and the bound in Equation (76) from [28].
    Used in Section V to prove converses in the Stein and Sanov regimes by converting error bounds into sums of letter-wise Renyi entropies.
  • standard math Fuchs-van-de-Graaf inequalities and the continuity bound for sandwiched Renyi divergences (Lemma 19, from [40]).
    Used in the quantum extension in Section VI to adapt the classical converse arguments to classical-quantum channels.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Rate-reliability tradeoff for deterministic identification." pith.science (2026). https://pith.science/paper/VBINBURH

@misc{pith2026250202389,
  author       = {Pith},
  title        = {Pith review of: Rate-reliability tradeoff for deterministic identification},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VBINBURH}},
  note         = {Machine review of arXiv:2502.02389}
}
abstract

We investigate deterministic identification over arbitrary memoryless channels under the constraint that the error probabilities of first and second kind are exponentially small in the block length $\mathbf{n}$, controlled by reliability exponents $\mathbf{E_1,E_2 \geq 0}$. In contrast to the regime of slowly vanishing errors, where the identifiable message length scales linearithmically as $\mathbf{\Theta(n\log n)}$, here we find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents. We give upper and lower bounds on the ensuing rate-reliability function in terms of (the logarithm of) the packing and covering numbers of the channel output set, which for small error exponents $\mathbf{E_1,E_2>0}$ can be expanded in leading order as the product of the Minkowski dimension of a certain parametrisation the channel output set and $\mathbf{\log\min\{E_1,E_2\}}$. These allow us to recover the previously observed slightly superlinear identification rates, and offer a different perspective for understanding them in more traditional information theory terms. We also show that even if only one of the two errors is required to be exponentially small, the linearithmic scaling is lost. We further illustrate our results with a discussion of the case of dimension zero, and extend them to classical-quantum channels and quantum channels with tensor product input restriction.

Figures

Figures reproduced from arXiv: 2502.02389 by the authors.

Figure 1
Figure 1. Schematic of the rate-reliability function for transmission and DI. The rate-reliability function for transmission (blue line) is monotonically non-increasing with different regions depending on the optimum coding strategies (see the tendency change from linear to quadratic behaviour marked by the grey dotted line). For error exponents going to zero (very slow error decrease with the block length n), the linear rate… view at source ↗
Figure 2
Figure 2. Tendency of the upper and lower rate bounds towards the capacity upper and lower bounds for increasing block length, in an example case with dM = 1 and E1 = E2 = E(n) = 1/n. The upper bound (blue line) is a plot of Eq. (36) with η(n) = 1/(log n), and the lower bound (black line) a plot of Eq. (25) with t(n) 2 = 3/(c log n) and η(n) = 1/n, following the conditions described in the proofs of Theorems 9 and 10 above [… view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Identification for Molecular Communication Based on Diffusion Channel with Poisson Reception Process

    cs.IT 2025-06 reject novelty 4.0 of 10

    The paper claims a 1/4 rate lower bound for deterministic identification over a diffusion-based Poisson molecular communication channel, but the proof's sphere-packing volume calculation is internally inconsistent.

Reference graph

Works this paper leans on

43 extracted references · 29 canonical work pages · cited by 1 Pith paper

  1. [17]

    Deterministic identification over channels with finite output: A dimensional perspective on superlinear rates,

    Pau Colomer, Christian Deppe, Holger Boche, and Andreas Winter, “Deterministic identification over channels with finite output: A dimensional perspective on superlinear rates,” IEEE Transactions on Information Theory , vol. 71, no. 5, pp. 3373–3396, 2025. DOI: 10. 1109/TIT.2025.3531301

    work page arXiv 2025

  2. [1]

    Rate-reliability tradeoff for deterministic identification,

    Pau Colomer, Christian Deppe, Holger Boche, and Andreas Winter, “Rate-reliability tradeoff for deterministic identification,” in Proc. 2025 IEEE International Conference on Communications, 8–12 June 2025, Montreal, Canada , IEEE

    work page 2025

  3. [2]

    A mathematical theory of communication,

    Claude E. Shannon, “A mathematical theory of communication,” The Bell System Technical Journal, vol. 27, no. 3&4, 379-423 & 623–656,

    work page

  4. [3]

    The coding of messages subject to chance errors,

    Jacob Wolfowitz, “The coding of messages subject to chance errors,” Illinois Journal of Mathematics, vol. 1, no. 4, pp. 591–606, Dec. 1957. DOI: 10.1215/ijm/1255380682

    arXiv 1957

  5. [4]

    Identification is easier than decoding,

    Joseph JaJa, “Identification is easier than decoding,” in Proc. 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), 1985, pp. 43–50. DOI: 10.1109/SFCS.1985.32

    work page doi:10.1109/sfcs.1985.32 1985

  6. [5]

    Identification via channels,

    Rudolf Ahlswede and Gunter Dueck, “Identification via channels,” IEEE Transactions on Information Theory , vol. 35, no. 1, pp. 15–29,

    work page

  7. [6]

    Berlin, Vladivostok: Springer Verlag, 1993

    Te Sun Han, Information-Spectrum Methods in Information Theory . Berlin, Vladivostok: Springer Verlag, 1993

    work page 1993

  8. [7]

    Information- Theoretical Analysis of Event-Triggered Molecular Communication,

    Wafa Labidi, Christian Deppe, and Holger Boche, “Information- Theoretical Analysis of Event-Triggered Molecular Communication,” in Proc. European Wireless 2024 , arXiv[cs.IT]: 2310.16507, IEEE,

    arXiv 2024

Show all 43 references
  1. [8]

    Identification without randomiza- tion,

    Rudolf Ahlswede and Ning Cai, “Identification without randomiza- tion,” IEEE Transactions on Information Theory , vol. 45, no. 7, pp. 2636–2642, Nov. 1999. DOI: 10.1109/18.796419

    1999 doi

  2. [9]

    Deterministic Identification Over Channels With Power Con- straints,

    Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche, and Christian Deppe, “Deterministic Identification Over Channels With Power Con- straints,” IEEE Transactions on Information Theory , vol. 68, no. 1, pp. 1–24, Jan. 2022. DOI: 10.1109/TIT.2021.3122811

    2022

  3. [10]

    Parallel programming must be deterministic by default,

    Robert L. Bocchino, Vikram S. Adve, Sarita V . Adve, and Marc Snir, “Parallel programming must be deterministic by default,” in Proc. 1st USENIX Conference on Hot Topics in Parallelism (HotPar), Berkeley, California: USENIX Association, 2009, p. 4

    2009

  4. [11]

    Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels,

    Erdal Arıkan, “Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Transactions on Information Theory , vol. 55, no. 7, pp. 3051–3073, 2009. DOI: 10.1109/TIT.2009.2021379

    2009

  5. [13]

    Deterministic Identification Over Fading Channels,

    Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche, and Christian Deppe, “Deterministic Identification Over Fading Channels,” in Proc. 2020 IEEE Information Theory Workshop (ITW) , 2021, pp. 1–5. DOI: 10.1109/ITW46852.2021.9457587

    2020

  6. [14]

    Deterministic identification codes for fading channels,

    Ilya V orobyev, Christian Deppe, and Holger Boche, “Deterministic identification codes for fading channels,” arXiv[cs.IT]:2404.02723, Apr. 2024. DOI: 10.48550/arXiv.2404.02723

    2024 doi arXiv

  7. [15]

    Deterministic Identification Over Pois- son Channels,

    Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche, Christian Deppe, and Robert Schober, “Deterministic Identification Over Pois- son Channels,” in Proc. 2021 IEEE Globecom Workshops , 2021, pp. 1–6. DOI: 10.1109/GCWkshps52748.2021.9682110

    2021

  8. [16]

    Deterministic Identification for Molecular Communications Over the Poisson Channel,

    Mohammad J. Salariseddigh, Vahid Jamali, Uzi Pereg, Holger Boche, Christian Deppe, and Robert Schober, “Deterministic Identification for Molecular Communications Over the Poisson Channel,” IEEE Transactions on Molecular, Biological and Multi-Scale Communica- tions, vol. 9, no....

    2023

  9. [18]

    Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear Rates,

    Pau Colomer, Christian Deppe, Holger Boche, and Andreas Win- ter, “Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear Rates,” in Proc. 2024 IEEE International Symposium on Information Theory (ISIT) , 2024, pp. 297–302. DOI: ...

    2024

  10. [20]

    Gallager, Information Theory and Reliable Communication (CIMS – International Centre for Mechanical Sciences, Courses and Lectures), 1st ed

    Robert G. Gallager, Information Theory and Reliable Communication (CIMS – International Centre for Mechanical Sciences, Courses and Lectures), 1st ed. Vienna: Springer Verlag, 1972, vol. 30. DOI: 10. 1007/978-3-7091-2945-6

    1972

  11. [21]

    Coding Theorems of Quantum Information Theory,

    Andreas Winter, “Coding Theorems of Quantum Information Theory,” Ph.D. dissertation, University of Bielefeld, Mathematics Department, Jul. 1999. DOI: 10.48550/arXiv.quant-ph/9907077

    1999 doi arXiv

  12. [22]

    Falconer, Fractal Geometry: Mathematical Foundations and Applications (3rd ed.) Wiley & Sons, 2014

    Kenneth J. Falconer, Fractal Geometry: Mathematical Foundations and Applications (3rd ed.) Wiley & Sons, 2014. DOI: 10 . 1002 / 0470013850

    2014

  13. [23]

    Robinson, Dimensions, Embeddings, and Attractors

    James C. Robinson, Dimensions, Embeddings, and Attractors . Cam- bridge University Press, 2010. DOI: 10.1017/CBO9780511933912

    2010 doi

  14. [24]

    Fraser, Assouad Dimension and Fractal Geometry

    Jonathan M. Fraser, Assouad Dimension and Fractal Geometry . Cambridge University Press, 2020. DOI: 10.1017/9781108778459

    2020 doi

  15. [25]

    A comparison of signalling alphabets,

    Edgar N. Gilbert, “A comparison of signalling alphabets,” The Bell System Technical Journal , vol. 31, no. 3, pp. 504–522, 1952. DOI: 10.1002/j.1538-7305.1952.tb01393.x

    1952

  16. [26]

    Estimate of the number of signals in error correcting codes,

    Rom R. Varshamov, “Estimate of the number of signals in error correcting codes,” Doklady Akademii Nauk SSSR , vol. 117, no. 5, pp. 739–741, 1957. [Online]. Available: https://www.mathnet.ru/eng/ dan/v117/i5/p739

    1957

  17. [27]

    Cambridge University Press, 2011

    Imre Csisz ´ar and J ´anos K ¨orner, Information Theory: Coding Theo- rems for Discrete Memoryless Systems, 2nd ed. Cambridge University Press, 2011. DOI: 10.1017/CBO9780511921889

    2011 doi

  18. [28]

    Strong Con- verse Exponents for a Quantum Channel Discrimination Problem and Quantum-Feedback-Assisted Communication,

    Tom Cooney, Mil ´an Mosonyi, and Mark M. Wilde, “Strong Con- verse Exponents for a Quantum Channel Discrimination Problem and Quantum-Feedback-Assisted Communication,” Communications in Mathematical Physics , vol. 344, no. 3, pp. 797–829, May 2016. DOI: 10.1007/s00220-016-2645-4

    2016 doi

  19. [29]

    Wilde, Quantum Information Theory (2nd ed.) Cambridge University Press, 2017

    Mark M. Wilde, Quantum Information Theory (2nd ed.) Cambridge University Press, 2017. DOI: 10.1017/CBO9781139525343

    2017 doi

  20. [30]

    Holevo, Statistical Structure of Quantum Theory (Lec- ture Notes in Physics Monographs)

    Alexander S. Holevo, Statistical Structure of Quantum Theory (Lec- ture Notes in Physics Monographs). Springer Verlag, 2001, vol. 67. DOI: 10.1007/3-540-44998-1

    2001 doi

  21. [31]

    Quantum Channels and Simultaneous ID Coding,

    Peter L ¨ober, “Quantum Channels and Simultaneous ID Coding,” Ph.D. dissertation, University of Bielefeld, Mathematics Department, Jul. 1999. [Online]. Available: http://nbn- resolving.de/urn:nbn:de: hbz:361-1473

    1999

  22. [32]

    Strong converse for identi- fication via quantum channels,

    Rudolf Ahlswede and Andreas Winter, “Strong converse for identi- fication via quantum channels,” IEEE Transactions on Information Theory, vol. 48, no. 3, pp. 569–579, Mar. 2002, Addendum: IEEE Trans. Inf. Theory, vol. 49, no. 1, p. 346, Jan. 2003. DOI: 10.1109/ 18.985947

    2002

  23. [33]

    Quantum and Classical Message Identification via Quantum Channels,

    Andreas Winter, “Quantum and Classical Message Identification via Quantum Channels,” Quantum Information and Computation , vol. 4, no. 6-7, pp. 563–578, Dec. 2004, Erratum: Quantum Inf. Comp., vol. 5, no. 7, pp. 605-605, Nov. 2005. DOI: 10.26421/QIC4.6-7-14

    2004 doi

  24. [34]

    Identification via Quantum Channels in the Presence of Prior Correlation and Feedback,

    Andreas Winter, “Identification via Quantum Channels in the Presence of Prior Correlation and Feedback,” in General Theory of Information Transfer and Combinatorics, ser. Lecture Notes in Computer Science (LNCS), R. Ahlswede, L. B ¨aumer, N. Cai, H. K. Aydinian, V . Blinovsky,...

    2006 doi

  25. [35]

    Identification via Quantum Channels,

    Andreas Winter, “Identification via Quantum Channels,” in Infor- mation Theory, Combinatorics, and Search Theory , Springer Berlin Heidelberg, 2013, pp. 217–233. DOI: 10.1007/978-3-642-36899-8 9

    2013 doi

  26. [36]

    Zero-entropy encoders and simultaneous decoders in identification via quantum channels,

    Pau Colomer, Christian Deppe, Holger Boche, and Andreas Winter, “Zero-entropy encoders and simultaneous decoders in identification via quantum channels,” in Information Theory and Related Fields: Essays in Memory of Ning Cai , ser. LNCS, vol. 14620, arXiv[quant- ph]:2402.09116...

    2025 arXiv

  27. [37]

    Zero-entropy encoders and simultaneous decoders in identification via quantum channels,

    Pau Colomer, Christian Deppe, Holger Boche, and Andreas Winter, “Zero-entropy encoders and simultaneous decoders in identification via quantum channels,” in Proc. 2024 IEEE International Conference on Communications, 9–13 June 2024, Denver, CO , IEEE, 2024, pp. 1776–1781. DOI:...

    2024

  28. [38]

    Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels,

    Pau Colomer, Christian Deppe, Holger Boche, and Andreas Winter, “Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels,” arXiv[cs.IT]:2504.20991, Apr. 2025. DOI: 10.48550/arXiv.2504.20991

    2025 doi arXiv

  29. [39]

    Cryptographic distinguishability measures for quantum-mechanical states,

    Christopher A. Fuchs and Jeroen van de Graaf, “Cryptographic distinguishability measures for quantum-mechanical states,” IEEE Transactions on Information Theory , vol. 45, no. 4, pp. 1216–1227, Jul. 1999. DOI: 10.1109/18.761271

    1999 doi

  30. [40]

    Uni- fied Framework for Continuity of Sandwiched R ´enyi Divergences,

    Andreas Bluhm, ´Angela Capel, Paul Gondolf, and Tim M ¨obus, “Uni- fied Framework for Continuity of Sandwiched R ´enyi Divergences,” Annales Henri Poincar ´e, 2024. DOI: 10.1007/s00023-024-01519-x

    2024 doi

  31. [41]

    Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels,

    Holger Boche, Christian Deppe, Safieh Mahmoodi, and Golamreza Omidi, “Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels,” arXiv[cs.IT]:2501.12548, Jan

    arXiv

  32. [1948]

    DOI: 10.1002/j.1538-7305.1948.tb01338.x. 16

    1948

  33. [1989]

    DOI: 10.1109/18.42172

    doi

  34. [2024]

    DOI: 10.48550/arXiv.2310.16507

    doi arXiv

  35. [2025]

    DOI: 10.48550/arXiv.2501.12548

    doi arXiv

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.