Deterministic $K$-identification For Slow Fading Channel
Preprint
Abstract
Deterministic $K$-identification (DKI) is addressed for Gaussian channels with slow fading (GSF), where the transmitter is restricted to an average power constraint and channel side information is available at the decoder. We derive lower and upper bounds on the DKI capacity when the number identifiable messages $K$ may grow with the codeword length $n$. As a key finding, we establish that for deterministic encoding, the codebook size scales as $2^{(n\log n)R}$ assuming that the number of identifiable messages scales as $K = 2^{\kappa \log n}$, where $R$ is the coding rate and $\kappa \in [0,1)$ is the identification target rate.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Deterministic Identification for Molecular Communications Over the Poisson ChannelIEEE Transactions on Molecular, Biological, and Multi-Scale Communications, 2023
- Deterministic Identification for MC ISI-Poisson Channel2023
- Deterministic Identification Over Fading Channels2021
- Impact of Correlated Fading Channels on Cognitive Relay Networks With Generalized Relay SelectionIEEE Access, 2017
- Wide-area Wireless Communication Challenges for the Internet of ThingsIEEE Communications Magazine, 2017
- General theory of information transfer: UpdatedDiscrete Applied Mathematics, 2008
- Fading channels: information-theoretic and communications aspectsIEEE Transactions on Information Theory, 1998
- Capacity of fading channels with channel side informationIEEE Transactions on Information Theory, 1997
- Identification via channelsIEEE Transactions on Information Theory, 1989