Deterministic $K$-identification For Slow Fading Channel

@article{Salariseddigh2022DeterministicF,
  title={Deterministic \$K\$-identification For Slow Fading Channel},
  author={Mohammad J. Salariseddigh and Muris Spahovic and Christian Deppe},
  journal={ArXiv},
  year={2022},
  volume={abs/2212.02732}
}
, 
[PDF] Semantic Reader

Figures from this paper

References

SHOWING 1-10 OF 25 REFERENCES

Deterministic Identification Over Fading Channels

It is established that the number of messages scales as 2n log(n)R, where n is the block length and R is the coding rate, and the DI capacity is infinite in the exponential scale and zero in the double-exponential scale, regardless of the channel noise.

Capacity of fading channels with channel side information

The Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone is obtained, analogous to water-pouring in frequency for time-invariant frequency-selective fading channels.

Deterministic Identification Over Poisson Channels

It is established that the code size scales as 2(nlogn)R, where n and R are the block length and coding rate, respectively, and lower and upper bounds on the DI capacity of the Poisson channel are developed in this scale.

Fading Channels: Information-Theoretic and Communication Aspects

This paper describes the statistical models of fading channels which are frequently used in the analysis and design of communication systems, and focuses on the information theory of fading channel, by emphasizing capacity as the most important performance measure.

Fundamentals of Wireless Communication

This paper presents a meta-modelling architecture for multiuser communication based on the MIMO model, which combines spatial multiplexing, channel modeling, and diversity-multiplexing techniques.

Deterministic Identification Over Channels With Power Constraints

Full characterization is established for the deterministic identification capacity for the Gaussian channel and for the general discrete memoryless channel (DMC) with and without constraints.

Nearest Neighbor Decoding in MIMO Block-Fading Channels With Imperfect CSIR

The achievability of the generalized outage probability, the probability that the generalized mutual information (GMI) is less than the data rate, is proved, and this probability is the fundamental limit for independent and identically distributed (i.i.d.) codebooks.

Deterministic Identification for Molecular Communications over the Poisson Channel

This paper studies deterministic identification (DI) for the discrete-time Poisson channel (DTPC), subject to an average and a peak power constraint, which serves as a model for MC systems employing molecule counting receivers and achieves large capacity.

Impact of Correlated Fading Channels on Cognitive Relay Networks With Generalized Relay Selection

This paper investigates the secrecy performance of dual-hop decode-and-forward cognitive relay networks taking into account the channel correlation between the main and wiretapping channels and derives the exact closed-form expression for secrecy outage probability of the considered networks.

Identification via channels

The authors' main finding is that any object among doubly exponentially many objects can be identified in blocklength n with arbitrarily small error probability via a discrete memoryless channel…