Pith. sign in

REVIEW 4 major objections 5 minor 44 references

Identification Over Noisy Permutation Channels

T0 review · 4 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

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

Pith's one-line read The number of messages identifiable over a shuffled noisy channel grows at a rate set by the rank of the noise matrix, and for full-rank noise a strong converse matches it.

desk verdict The strong converse in Theorem 2(ii) rests on an algebraically false pigeonhole bound; the central claim is unproven as written, though the achievability and deterministic results look salvageable. read the letter →

arxiv 2412.11091 v2 pith:YF4MPEH5 submitted 2024-12-15 cs.IT math.IT

Abhishek Sarkar , Bikash Kumar Dey This is my paper · ORCID
classification cs.ITmath.IT MSC 94A2494A1560C05
keywords identificationviachannelsnoisypermutationchannelq-arycompositionresolvabilityM-typedistributionsstrongconversetotalvariationdistancemultinomial
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 asks how many messages can be identified, rather than reliably decoded, when a q-ary block is randomly permuted and then passed through a discrete memoryless channel U with strictly positive entries. The paper establishes that with stochastic encoding, the number of identifiable messages grows as $2^{\epsilon_n (n/\log n)^{(r-1)/2}}$ for any $\epsilon_n\to 0$, where $r$ is the rank of $U$. For full-rank $U$, it proves a matching strong converse: any sequence of codes with $2^{R_n n^{(q-1)/2}(\log n)^{1+(q-1)(q-2)/2}}$ messages and $R_n\to\infty$ must have Type-I plus Type-II error probability approaching 1. This fixes the identification capacity of the full-rank noisy permutation channel at $(q-1)/2$, the same second-order growth rate as reliable communication over that channel. If true, it settles the identification picture for a channel class relevant to DNA storage and multipath routing.

What carries the argument

The load-bearing object is the q-ary noisy composition channel, denoted q-NCC$_{n,U}$: its input and output alphabets are the set of compositions of n-length q-ary vectors, and its transition probability is the probability that a vector of composition t, after passing through the DMC U, has output composition w. The argument then runs through a deterministic two-stage quantization scheme: partition the composition simplex into cubic cells of side a, redistribute probability mass inside each cell so that all but one mass per cell become multiples of 1/M, and then sweep residual masses through the cells in a Gray-like order. This machinery approximates any input distribution by an M-type distribution whose output over the composition channel is within vanishing total-variation distance, which is exactly what channel resolvability needs to force a pigeonhole collision among codeword output distributions. The engine that makes the TV bound small is Lemma 4: moving one unit of mass between neighboring compositions changes the output distribution by at most $C(\log n)^{(q-2)/2}/\sqrt{n}$.

What would settle it

Compute $d_{TV}(W_{(x,a)},W_{(x,b)})$ for a concrete strictly positive $U$ and $q=3$ at large finite $n$; if the decay is slower than $C(\log n)^{1/2}/\sqrt{n}$, Lemma 4 fails. Separately, test Lemma 14 by evaluating its recursion for small $m$ and $s$: the final listed endpoint $(s-m+1,1,\dots,1)$ must be adjacent to its predecessor in the Gray-like order, and the currently written endpoint calculation should be checked for that adjacency.

Watch

Extended reading notes

Core claim

The central discovery is that the composition of the transmitted block, the vector of symbol counts, is the only information that survives the permutation stage, and that this reduction exactly determines identification performance. The paper proves that an identification code for the noisy permutation channel is equivalent to an identification code for the q-ary noisy composition channel, whose inputs and outputs are compositions and whose transition law is the convolution of multinomials. On this reduced channel it shows that $2^{\epsilon_n (n/\log n)^{(r-1)/2}}$ messages are identifiable with vanishing error, and that for strictly positive full-rank $U$ any code family whose message size grows as $2^{R_n n^{(q-1)/2}(\log n)^{1+(q-1)(q-2)/2}}$ with $R_n\to\infty$ has sum error probability approaching 1. The achievability and converse meet in identification rate, giving capacity $(q-1)/2$ for full-rank channels. The same framework also yields tight achievability and converse bounds for deterministic encoders and decoders, with message sizes of order $(n/(c\log n))^{(r-1)/2}$ and converses at $R\,n^{(q-1)/2}(\log n)^{(q-1)(q-2)/2}$.

Load-bearing premise

The whole converse leans on the decay bound $C(\log n)^{(q-2)/2}/\sqrt{n}$ for the output change caused by shifting one unit of mass between neighboring compositions, and on Lemma 14's Gray-like cell ordering, whose proof contains an endpoint calculation that appears inconsistent; if this bound or that ordering fails, the quantization scheme no longer gives vanishing distortion and the pigeonhole converse collapses.

Editorial extensions

If this is right

  • For strictly positive full-rank $U$, the identification capacity is exactly $(q-1)/2$: message sizes below $2^{\epsilon_n(n/\log n)^{(q-1)/2}}$ with $\epsilon_n\to 0$ are achievable, and larger sizes force the sum of both error probabilities to 1.
  • For rank $r<q$, the achievability bound $2^{\epsilon_n(n/\log n)^{(r-1)/2}}$ still holds, while the paper's converse does not exploit rank deficiency; the exact identification rate for rank-deficient $U$ remains open.
  • With deterministic encoders and decoders, $(n/(c\log n))^{(r-1)/2}$ messages are identifiable, and the weak and strong converses show that message sizes growing like $R\,n^{(q-1)/2}(\log n)^{(q-1)(q-2)/2}$ cannot have vanishing error for large enough constant $R$, or any bounded error when $R_n\to\infty$.
  • The full-rank identification rate matches the reliable-communication rate of the same channel, so in this model identification does not increase the second-order growth exponent over ordinary transmission.

Reading between the lines

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

  • The same quantization plus pigeonhole strategy should yield a matching converse for rank-deficient $U$ if the output-perturbation bound can be made to depend on $r$ instead of $q$; the paper states this as an open problem and already phrases several lemmas for arbitrary rank.
  • For $q=2$, the main theorem reduces to a statement about Hamming-weight distributions under a bit-flip channel, and the quantization algorithm is fully explicit; one could numerically verify the $1/\sqrt{n}$ sensitivity of the output Hamming-weight distribution as a binary shadow of the main claim.
  • The deterministic two-stage quantization scheme is a channel-dependent alternative to randomized resolvability, and it is natural to try the same cell-then-Gray-order construction for other channels whose output distributions are Lipschitz in small shifts of the input type.
  • Because the achievability and converse message sizes differ only by powers of $\log n$, a finer second-order analysis could pin down the exact logarithmic exponents; the paper's multinomial tail bounds and convolution estimates are the ingredients such an analysis would need.
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

4 major / 5 minor

Summary. The paper studies message identification over q-ary noisy permutation channels, where an input vector is uniformly permuted and then passed through a DMC with strictly positive transition probabilities. The main claims are: (i) for any ε_n→0, codes with 2^{ε_n(n/log n)^{(r-1)/2}} messages can be identified with vanishing errors, where r is the rank of the DMC; (ii) for full-rank strictly positive U, any code with roughly 2^{c_n n^{(q-1)/2}(log n)^{1+(q-1)(q-2)/2}} messages and c_n→∞ has Type-I plus Type-II error at least 1 asymptotically, giving identification capacity (q-1)/2; and (iii) analogous achievability and converse statements for deterministic encoders. The proof introduces a q-ary noisy composition channel (q-NCC) and a two-stage deterministic quantization scheme that approximates input distributions by M-type distributions while controlling the total-variation distortion of the output distributions. The paper also contains supporting sensitivity bounds for multinomial distributions and a packing argument for the deterministic-encoder converse.

Significance. If the results are correct, they settle the identification capacity of noisy permutation channels with full-rank strictly positive DMCs and give tight exponents up to log factors for general rank. The identification-size exponents and the proposed channel-resolvability-style converse are nontrivial, and the two-stage quantization of composition distributions is an interesting technique that could be reused. The paper is also honest about the gap between achievability and converse when U is rank-deficient. However, several load-bearing steps in the current manuscript are not yet established: the pigeonhole counting in the strong converse contains a false inequality, the strong-converse proof is written for deterministic decoders while the theorem states stochastic decoders, and Lemma 1 is asserted without proof. These issues are fixable in principle, but they prevent the main converse claim from being accepted as written.

major comments (4)
  1. [Section VI, Eqs. (41)–(43)] The counting step in the pigeonhole argument is algebraically wrong. Since |N_{q,n_i}| ≤ (2n_i)^{q-1}, the logarithm of the crude M-type count is (q-1)M_i(1+log n_i), not M_i(1+log n_i). With M_i = c_i n_i^{(q-1)/2}(log n_i)^{(q-1)(q-2)/2} as used in (135), this is (q-1)c_i n_i^{(q-1)/2}(log n_i)^{1+(q-1)(q-2)/2}(1+o(1)), which is a factor (q-1) larger than the message-size exponent in Γ_i. Hence the transition from (41) to (43) drops the factor (q-1), and the claimed inequality is false for every q≥2 and all large n_i. Even replacing the crude bound by the exact count binom(M_i+|N_{q,n_i}|-1, |N_{q,n_i}|-1) of M-type distributions does not rescue the argument as written: for q≥4 the leading exponent is ((q-1)/2)c_i n_i^{(q-1)/2}(log n_i)^{1+(q-1)(q-2)/2}, which still exceeds the message exponent. The conclusion in (44) that two messages share the same quantized distribution therefore does not follow, and Theorem 2(ii) is not proved. This is load-bearing; a correction requires either a smaller scaling of M_i that still tends to infinity so that δ_i vanishes, or a substantially sharper count with the constants aligned.
  2. [Section VI and Lemma 2] Theorem 2(ii) is stated for identification codes with stochastic decoders, but the proof in Section VI begins by considering 'a sequence of ... ID codes with deterministic decoders', and Lemma 2 is proved only for deterministic decoders. The reduction from a stochastic decoder for Σ_{n,U} to a stochastic decoder for q-NCC is not supplied. The gap is likely fixable by averaging the stochastic decision rule over each output type class, i.e. defining P_i'(1|w) = (1/|C_w|)∑_{y∈C_w} P_i(1|y), and checking that the error expressions coincide, but this extension must appear in the paper for the stated theorem to be covered by the proof.
  3. [Section III, Lemma 1] Lemma 1 is asserted without proof. The cited capacity theorem of [21], [34] identifies the reliable-communication capacity in the asymptotic rate sense, which alone gives message sizes n^{(r-1)/2-o(1)}, not the precise scale (n/(c log n))^{(r-1)/2} with a logarithmic loss. This exact scale is used in the exponents of Theorems 2(i) and 3(i), so the achievability results are conditional on an unproved refinement. The paper should either give a proof of Lemma 1 or cite a result that proves exactly this statement.
  4. [Section IX-C, proof of Lemma 14, Case I] In the transition from an odd slice x to the next slice x+1, the next slice is traversed in reverse order by construction, so the first element of slice x+1 is the endpoint g^{(m-1,s-x-1)}(|V|), not the start g^{(m-1,s-x-1)}(1) used in (106)–(107). With the printed formulas, for example m=2, s=5, x=1, the two consecutive points differ by (1,-3) in L1 norm, violating the adjacency conditions (92)–(93). This invalidates the bound (94) and hence the distortion estimate (130) that depends on it. The lemma itself is plausible and the error appears local, but the proof must be corrected before Proposition 2 can be used.
minor comments (5)
  1. [Notation throughout] The constants C_4, C_4^1, and C_1^4 are used inconsistently; please unify the notation for the constants appearing in Proposition 2 and in the proof of that proposition.
  2. [Abstract and Section IV] The abstract writes message sizes as 2^{R_n(n/log n)^{(r-1)/2}}, while Theorem 2(i) uses ε_n in place of R_n and the converse uses c_i; please align the notation.
  3. [Section V, Eq. (23)] The definition of ε'_n includes the terms 1/N and 1/(N log N), but the subsequent lower bound for L appears to neglect the subtraction of 1+log N in the exponent; the algebra should be checked.
  4. [Section V] The displayed chain 'L ≥ 2^{ε'_n N -1-\log N} = 2^{ε_n N (r-1)! c^{(r-1)/2}} = 2^{ε_n(n/\log n)^{(r-1)/2}}' drops a factor (r-1)! in the last equality; as a lower bound the inequality direction is harmless, but the equality is not exact.
  5. [Lemma 2] There is a typo in the final sentence of Lemma 2: 'determnistic' should be 'deterministic'.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the identification exponents are derived from external reliable-communication capacity results, internal multinomial TV bounds, and a constructive quantization scheme; self-citations are contextual only.

full rationale

The central claims do not reduce to their inputs by construction. Achievability (Theorem 2(i)) combines the external reliable-communication capacity result of [21,34] (Lemma 1) with the standard set-system construction of [2, Proposition 1]; the identification message-size exponent (r-1)/2 is inherited from a genuinely external capacity theorem, not from the identification statement itself, so this is a reduction rather than a definitional tautology. The strong converse (Theorem 2(ii)) proceeds independently: Lemma 2 translates an ID code for the noisy permutation channel into one for the q-NCC; Lemmas 3, 4, 9, and 11 bound the TV sensitivity of output composition distributions using strong unimodality of binomials and the convolution bound of Lemma 8; Proposition 2 proves a deterministic two-stage quantization scheme whose TV-distortion bound decays because a and M are chosen as c_n-dependent asymptotic parameters (a = sqrt(n)/(c_n^{1/(q-1)} (log n)^{(q-2)/2}), M = c_n n^{(q-1)/2} (log n)^{(q-1)(q-2)/2}), not fitted to data. The pigeonhole step compares the number of M-type distributions against the message count using the same exponent; this is a proof parameter choice, not a hidden fit. No fitted constants, data-dependent parameters, or imported uniqueness theorems appear. The self-citations [37,38] describe the authors' noiseless permutation-channel results and serve as background/context, but the noisy-channel achievability and converse do not rest on those results. The manuscript's own Remark 1 explicitly flags the rank-deficient case as open, which is a limitation rather than circular reasoning. The reader-flagged issues (the algebra in inequality (43) and the endpoint calculation in Lemma 14's Gray-like ordering proof) are correctness concerns about whether the converse proof is valid as written; they are not instances of a claim being equivalent to its inputs by definition or by fit. For that reason the circularity score is low despite possible technical gaps.

Assumptions & free parameters 0 free parameters · 5 assumptions · 1 invented entities

The proofs introduce no fitted numerical parameters. The identification rate (r-1)/2 is inherited from the external reliable-communication capacity theorem, so the paper is a reduction rather than a derivation that assumes its own conclusion. The quantization parameters a and M are asymptotic proof variables, not data-fitted constants.

assumptions (5)
  • domain assumption Reliable communication capacity of Σ_U is (r-1)/2 for a DMC U with strictly positive entries and rank r (Theorem 1 of [21,34]).
    Used in Lemma 1 and Theorem 2(i) to build the reliable inner code; if this capacity were false, the achievability rate would change.
  • standard math Proposition 1 of Ahlswede-Dueck: for a finite set Z and small ε, λ there exist many subsets with controlled intersections.
    Used in Section V to create many identification messages from one reliable code.
  • domain assumption All entries of U are strictly positive.
    Assumed throughout Theorems 2(ii) and 3; it removes zero-probability edges in multinomial bounds and keeps the channel full-support.
  • standard math Binomial distributions are strongly unimodal (Keilson-Gerber).
    Used in Lemma 7 to identify the sum of successive differences of a binomial with twice its peak value, which feeds Lemma 3 and Lemma 4.
  • standard math Stirling bounds, Pinsker's inequality, and standard multinomial tail estimates.
    Used in the appendices for peak and tail bounds on multinomial distributions.
invented entities (1)
  • q-ary noisy composition channel (q-NCC_{n,U})
    purpose: A derived channel whose input and output are composition vectors, capturing the effect of the noisy permutation channel; it converts identification over Σ_U into identification over compositions.
    This is a mathematical abstraction introduced for the converse proof, not a new physical entity; the paper claims no independent experimental handle for it.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Identification Over Noisy Permutation Channels." pith.science (2026). https://pith.science/paper/YF4MPEH5

@misc{pith2026241211091,
  author       = {Pith},
  title        = {Pith review of: Identification Over Noisy Permutation Channels},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YF4MPEH5}},
  note         = {Machine review of arXiv:2412.11091}
}
abstract

We study message identification over the noisy permutation channel. For discrete memoryless channels (DMCs), the number of identifiable messages grows doubly exponentially, and the maximum second-order exponent is same as the Shannon capacity of the DMC. We consider a $q$-ary noisy permutation channel where the transmitted vector is first permuted by a permutation chosen uniformly at random, and then passed through a DMC with strictly positive entries in its transition probability matrix $U$. In an earlier work, we showed that over $q$-ary noiseless permutation channel, $2^{c_n n^{q-1}}$ messages can be identified if $c_n\rightarrow 0$, and a strong converse holds for $2^{c_n n^{q-1}}$ messages if $c_n\rightarrow \infty$. For the $q$-ary noisy permutation channel, we show that message sizes growing as $2^{R_n \left( \frac{n}{\log n}\right)^{(r-1)/2}}$, where $r$ be the rank of $U$, are identifiable for any $R_n\rightarrow 0$. We also prove a strong converse result showing that for any sequence of identification codes with $$2^{\left(R_n n^{(q-1)/2}(\log n)^{1+\frac{(q-1)(q-2)}{2}}\right)},$$ messages, where $R_n \rightarrow \infty$, the sum of Type-I and Type-II error probabilities approaches at least $1$ as $n\rightarrow \infty$. Our converse proof uses the idea of channel resolvability. We propose a novel deterministic quantization scheme for quantization of a distribution over the set of all compositions/types by an $M$-type input distribution when the distortion is measured on the output distribution in total variation distance. This plays a key role in the converse proof. We have also studied identification with deterministic encoder and decoder, and proved tight achievability, weak converse, and strong converse.

Figures

Figures reproduced from arXiv: 2412.11091 by the authors.

Figure 1
Figure 1. The noisy permutation channel: Σn,U Πq U n pnq x v y [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 3
Figure 3. The noisy composition channel q-NCCn,U C. Identification codes Definition 1. An L-sized identification (ID) code with deterministic decoders for any channel P P PpB|Aq is a set tpQi , Diq | i “ 1, . . . , Lu of pairs with Qi P PpAq, and Di Ă B, for i “ 1, . . . , L. For such a code, a message i is encoded to a symbol x P A with probability Qipxq, and the decoder for message i outputs 1 (“Accept”) if and only if the … view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

44 extracted references · 43 canonical work pages

  1. [21]

    Coding theorems for noisy permutation channels.IEEE Transactions on Information Theory, 66(11):6723–6748, 2020

    Anuran Makur. Coding theorems for noisy permutation channels.IEEE Transactions on Information Theory, 66(11):6723–6748, 2020

    work page 2020

  2. [34]

    Capacity of noisy permutation channels.IEEE Transactions on Information Theory, 2023

    Jennifer Tang and Yury Polyanskiy. Capacity of noisy permutation channels.IEEE Transactions on Information Theory, 2023

    work page 2023

  3. [1]

    Identification is easier than decoding

    Joseph J `aJ`a. Identification is easier than decoding. In26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pages 43–50. IEEE, 1985

    work page 1985

  4. [2]

    Identification via channels.IEEE Transactions on Information Theory, 35(1):15–29, 1989

    Rudolf Ahlswede and Gunter Dueck. Identification via channels.IEEE Transactions on Information Theory, 35(1):15–29, 1989

    work page 1989

  5. [3]

    Identification in the presence of feedback-a discovery of new capacity formulas.IEEE Transactions on Information Theory, 35(1):30–36, 1989

    Rudolf Ahlswede and Gunter Dueck. Identification in the presence of feedback-a discovery of new capacity formulas.IEEE Transactions on Information Theory, 35(1):30–36, 1989

    work page 1989

  6. [4]

    New results in the theory of identification via channels.IEEE transactions on information theory, 38(1):14–25, 1992

    Te Sun Han and Sergio Verdu. New results in the theory of identification via channels.IEEE transactions on information theory, 38(1):14–25, 1992

    work page 1992

  7. [5]

    Approximation theory of output statistics.IEEE Transactions on Information Theory, 39(3):752–772, 1993

    Te Sun Han and Sergio Verd ´u. Approximation theory of output statistics.IEEE Transactions on Information Theory, 39(3):752–772, 1993

    work page 1993

  8. [6]

    New converses in the theory of identification via channels.IEEE Transactions on Information Theory, 44(3):984–998, 1998

    Yossef Steinberg. New converses in the theory of identification via channels.IEEE Transactions on Information Theory, 44(3):984–998, 1998

    work page 1998

Show all 44 references
  1. [7]

    Minimax converse for identification via channels.IEEE Transactions on Information Theory, 68(1):25–34, 2021

    Shun Watanabe. Minimax converse for identification via channels.IEEE Transactions on Information Theory, 68(1):25–34, 2021

    2021

  2. [8]

    Springer Science & Business Media, 2002

    H Koga et al.Information-spectrum methods in information theory, volume 50. Springer Science & Business Media, 2002

    2002

  3. [9]

    New directions in the theory of identification via channels.IEEE transactions on information theory, 41(4):1040–1050, 1995

    Rudolf Ahlswede and Zhen Zhang. New directions in the theory of identification via channels.IEEE transactions on information theory, 41(4):1040–1050, 1995

    1995

  4. [10]

    Information-theoretically secret reed-muller identification with affine designs.arXiv preprint arXiv:2310.16217, 2023

    Mattia Spandri, Roberto Ferrara, Christian Deppe, Moritz Wiese, and Holger Boche. Information-theoretically secret reed-muller identification with affine designs.arXiv preprint arXiv:2310.16217, 2023

    2023 arXiv

  5. [11]

    Capacity bounds for identification with effective secrecy

    Johannes Rosenberger, Abdalla Ibrahim, Boulat A Bash, Christian Deppe, Roberto Ferrara, and Uzi Pereg. Capacity bounds for identification with effective secrecy. In2023 IEEE International Symposium on Information Theory (ISIT), pages 1202–1207. IEEE, 2023

    2023

  6. [12]

    Identification via the broadcast channel.IEEE Transactions on Information Theory, 63(6):3480–3501, 2017

    Annina Bracher and Amos Lapidoth. Identification via the broadcast channel.IEEE Transactions on Information Theory, 63(6):3480–3501, 2017. 40

    2017

  7. [13]

    Identification over compound multiple-input multiple-output broadcast channels

    Johannes Rosenberger, Uzi Pereg, and Christian Deppe. Identification over compound multiple-input multiple-output broadcast channels. IEEE Transactions on Information Theory, 2023

    2023

  8. [14]

    On identification via multiway channels with feedback.IEEE transactions on information theory, 37(6):1519–1526, 1991

    Rudolf Ahlswede and Bart Verboven. On identification via multiway channels with feedback.IEEE transactions on information theory, 37(6):1519–1526, 1991

    1991

  9. [15]

    Deterministic identification over fading channels

    Mohammad J Salariseddigh, Uzi Pereg, Holger Boche, and Christian Deppe. Deterministic identification over fading channels. In2020 IEEE Information Theory Workshop (ITW), pages 1–5. IEEE, 2021

    2021

  10. [16]

    Identification over the gaussian channel in the presence of feedback

    Wafa Labidi, Holger Boche, Christian Deppe, and Moritz Wiese. Identification over the gaussian channel in the presence of feedback. In 2021 IEEE International Symposium on Information Theory (ISIT), pages 278–283. IEEE, 2021

    2021

  11. [17]

    Identification without randomization.IEEE Transactions on Information Theory, 45(7):2636–2642, 1999

    Rudolf Ahlswede and Ning Cai. Identification without randomization.IEEE Transactions on Information Theory, 45(7):2636–2642, 1999

    1999

  12. [18]

    Identification over additive noise channels in the presence of feedback

    Moritz Wiese, Wafa Labidi, Christian Deppe, and Holger Boche. Identification over additive noise channels in the presence of feedback. IEEE Transactions on Information Theory, 2022

    2022

  13. [19]

    Deterministic identification over channels with power constraints.IEEE Transactions on Information Theory, 68(1):1–24, 2021

    Mohammad J Salariseddigh, Uzi Pereg, Holger Boche, and Christian Deppe. Deterministic identification over channels with power constraints.IEEE Transactions on Information Theory, 68(1):1–24, 2021

    2021

  14. [20]

    Deterministic identification for molecular communications over the poisson channel.IEEE Transactions on Molecular, Biological and Multi-Scale Communications, 2023

    Mohammad Javad 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 Communications, 2023

    2023

  15. [22]

    A theory of goal-oriented communication.Journal of the ACM (JACM), 59(2):1–65, 2012

    Oded Goldreich, Brendan Juba, and Madhu Sudan. A theory of goal-oriented communication.Journal of the ACM (JACM), 59(2):1–65, 2012

    2012

  16. [23]

    Binary codes for packet error and packet loss correction in store and forward

    Maximilien Gadouleau and Alban Goupil. Binary codes for packet error and packet loss correction in store and forward. In2010 International ITG Conference on Source and Channel Coding (SCC), pages 1–6. IEEE, 2010

    2010

  17. [24]

    Optimal rate–delay tradeoffs and delay mitigating codes for multipath routed and network coded networks.IEEE Transactions on Information Theory, 55(12):5491–5510, 2009

    John MacLaren Walsh, Steven Weber, and Ciira wa Maina. Optimal rate–delay tradeoffs and delay mitigating codes for multipath routed and network coded networks.IEEE Transactions on Information Theory, 55(12):5491–5510, 2009

    2009

  18. [25]

    Perfect codes in the discrete simplex.Designs, Codes and Cryptography, 75:81–95, 2015

    Mladen Kova ˇcevi´c and Dejan Vukobratovi ´c. Perfect codes in the discrete simplex.Designs, Codes and Cryptography, 75:81–95, 2015

    2015

  19. [26]

    Codes in the space of multisets—coding for permutation channels with impairments.IEEE Transactions on Information Theory, 64(7):5156–5169, 2018

    Mladen Kova ˇcevi´c and Vincent YF Tan. Codes in the space of multisets—coding for permutation channels with impairments.IEEE Transactions on Information Theory, 64(7):5156–5169, 2018

    2018

  20. [27]

    Fundamentals of molecular information and communication science.Proceedings of the IEEE, 105(2):306–318, 2016

    Ozgur B Akan, Hamideh Ramezani, Tooba Khan, Naveed A Abbasi, and Murat Kuscu. Fundamentals of molecular information and communication science.Proceedings of the IEEE, 105(2):306–318, 2016

    2016

  21. [28]

    Fundamentals of diffusion-based molecular communication in nanonetworks.Foundations and Trends® in Networking, 8(1-2):1–147, 2014

    Massimiliano Pierobon, Ian F Akyildiz, et al. Fundamentals of diffusion-based molecular communication in nanonetworks.Foundations and Trends® in Networking, 8(1-2):1–147, 2014

    2014

  22. [29]

    Error correction for dna storage.ArXiv, abs/2310.01729, 2023

    Jin Sima, Netanel Raviv, Moshe Schwartz, and Jehoshua Bruck. Error correction for dna storage.ArXiv, abs/2310.01729, 2023

    2023 arXiv

  23. [30]

    Robust indexing for the sliced channel: Almost optimal codes for substitutions and deletions

    Jin Sima, Netanel Raviv, and Jehoshua Bruck. Robust indexing for the sliced channel: Almost optimal codes for substitutions and deletions. arXiv preprint arXiv:2308.07793, 2023

    2023 arXiv

  24. [31]

    Information-theoretic foundations of dna data storage.Foundations and Trends® in Communications and Information Theory, 19(1):1–106, 2022

    Ilan Shomorony, Reinhard Heckel, et al. Information-theoretic foundations of dna data storage.Foundations and Trends® in Communications and Information Theory, 19(1):1–106, 2022

    2022

  25. [32]

    Coding for thel 8-limited permutation channel.IEEE Transactions on Information Theory, 63(12):7676–7686, 2017

    Michael Langberg, Moshe Schwartz, and Eitan Yaakobi. Coding for thel 8-limited permutation channel.IEEE Transactions on Information Theory, 63(12):7676–7686, 2017

    2017

  26. [33]

    String concatenation construction for chebyshev permutation channel codes

    Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Xiande Zhang, et al. String concatenation construction for chebyshev permutation channel codes. In2016 IEEE International Symposium on Information Theory (ISIT), pages 2824–2828. IEEE, 2016

    2016

  27. [35]

    The bee-identification problem: Bounds on the error exponent.IEEE Transactions on Communications, 67(11):7405–7416, 2019

    Anshoo Tandon, Vincent YF Tan, and Lav R Varshney. The bee-identification problem: Bounds on the error exponent.IEEE Transactions on Communications, 67(11):7405–7416, 2019

    2019

  28. [36]

    The bee-identification error exponent with absentee bees.IEEE Transactions on Information Theory, 66(12):7602–7614, 2020

    Anshoo Tandon, Vincent YF Tan, and Lav R Varshney. The bee-identification error exponent with absentee bees.IEEE Transactions on Information Theory, 66(12):7602–7614, 2020

    2020

  29. [37]

    Identification over permutation channels.arXiv preprint arXiv:2405.09309v3, 2024

    Abhishek Sarkar and Bikash Kumar Dey. Identification over permutation channels.arXiv preprint arXiv:2405.09309v3, 2024

    2024 arXiv

  30. [38]

    Identification via binary uniform permutation channels

    Abhishek Sarkar and Bikash Kumar Dey. Identification via binary uniform permutation channels. In2024 IEEE Information Theory Workshop (ITW). IEEE, 2024

    2024

  31. [39]

    Optimal quantization for distribution synthesis.IEEE Transactions on Information Theory, 62(11):6162–6172, 2016

    Georg B ¨ocherer and Bernhard C Geiger. Optimal quantization for distribution synthesis.IEEE Transactions on Information Theory, 62(11):6162–6172, 2016. 41

    2016

  32. [40]

    PhD thesis, Massachusetts Institute of Technology, 2022

    Jennifer Tang.Divergence covering. PhD thesis, Massachusetts Institute of Technology, 2022

    2022

  33. [41]

    Some results for discrete unimodality.Journal of the American Statistical Association, 66(334):386–389, 1971

    Julian Keilson and Hans Gerber. Some results for discrete unimodality.Journal of the American Statistical Association, 66(334):386–389, 1971

    1971

  34. [42]

    John Wiley & Sons, 1999

    Thomas M Cover.Elements of information theory. John Wiley & Sons, 1999

    1999

  35. [43]

    An introduction to probability theory and its applications, 1958

    William Feller and Philip M Morse. An introduction to probability theory and its applications, 1958. APPENDIXA PROOF OFLEMMA2 We will construct an ID codetpQ 1 i, Piq|i“1, . . . , Muwith stochastic decoders forq-NCCn,U . For everyiP r1 :Ms,kPN q,n, we define Q1 ipkq :“Q ipCkq“...

    1958

  36. [44]

    We consider two cases: Case I(t j“0,@jPrk`1 :qs) : For anypt 1,

    The resulting distribution is a multinomial distribution onkcategories, with the success probability distribution ur1:ks“pu 1, u2,¨¨¨, u kqhaving strictly positive entries. We consider two cases: Case I(t j“0,@jPrk`1 :qs) : For anypt 1, . . . , tqqPN q,n such thatt j“0for allj...

Pith tools

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