Pith. sign in

REVIEW 1 cited by

Secrecy Capacity Bounds for Visible Light Communications With Signal-Dependent Noise

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.11097 v1 pith:CR5MSSNL submitted 2021-09-23 cs.IT math.IT

classification cs.ITmath.IT
keywords capacitysecrecyboundsasymptoticintensityloweropticalupper
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In physical-layer security, one of the most fundamental issues is the secrecy capacity. The objective of this paper is to determine the secrecy capacity for an indoor visible light communication system consisting of a transmitter, a legitimate receiver and an eavesdropping receiver. In such a system, both signal-independent and signal-dependent Gaussian noises are considered. Under non-negativity and average optical intensity constraints, lower and upper secrecy capacity bounds are first derived by the variational method, the dual expression of the secrecy capacity, and the concept of "the optimal input distribution that escapes to infinity". Numerical results show that the secrecy capacity upper and lower bounds are tight. By an asymptotic analysis at large optical intensity, there is a small performance gap between the asymptotic upper and lower bounds. Then, by adding a peak optical intensity constraint, we further analyze the exact and asymptotic secrecy capacity bounds. Finally, the tightness of the derived bounds is verified by numerical results.

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. The Rosetta Paradox: Domain-Specific Performance Inversions in Large Language Models

    cs.CL 2024-12 reject novelty 2.0 of 10

    Specialized language models can lose accuracy on general tasks, a trade-off the paper calls the Rosetta Paradox and tries to quantify with DSI and PIM.

Pith tools