Pith. Sign in

RECORD

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Information Theory · Submitted 18 Jul 2024

abstract compiled · 2026-09-24 · no language-model review

The authors' main claim Matching achievable and converse results are presented.

how it is stated · asserted 0.99 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2407.13898 (version 3)
Pith ID5XPSN23H, Pith's permanent record of this paper and its review
CitationAmir Reza Ramtin, Dennis Goeckel, Don Towsley. "Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading." arXiv:2407.13898 (2024). https://pith.science/paper/5XPSN23H
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-24: 1 request, 4,144 input tokens.

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.09 · human participants 0.02 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.14 · compares with prior results 0.40 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; .

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Covert communication is the undetected transmission of sensitive information over a communication channel. background 1.00 0.05 0.02 asserted 1.00
s1 In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. background 1.00 0.05 0.02 asserted 1.00
s2 This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. contribution 1.00 0.90 0.21 asserted 0.98
s3 Critical to the investigation is characterizing the performance of optimal detectors at the adversary. method 0.75 0.41 0.05 asserted 0.99
s4 Matching achievable and converse results are presented. contribution 0.57 0.92 0.16 asserted 0.99

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v3
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.