Deterministic K-Identification For Binary Symmetric Channel

05/07/2023
by   Ons Dabbabi, et al.
0

Deterministic K-Identification (DKI) for the binary symmetric channel (BSC) is developed. A full characterization of the DKI capacity for such a channel, with and without the Hamming weight constraint, is established. As a key finding, we find that for deterministic encoding the number of identifiable messages K may grow exponentially with the codeword length n, i.e., K = 2^κ n, where κ is the target identification rate. Furthermore, the eligible region for κ as a function of the channel statistics, i.e., the crossover probability, is determined.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/06/2022

Deterministic K-identification For Slow Fading Channel

Deterministic K-identification (DKI) is addressed for Gaussian channels ...
research
07/12/2023

On the Binary Symmetric Channel with a Transition Probability Determined by a Poisson Distribution

The classical Binary Symmetric Channel has a fixed transition probabilit...
research
10/08/2020

Deterministic Identification Over Channels with Power Constraints

Identification capacity is developed without randomization at neither th...
research
11/20/2022

Deterministic Identification For MC ISI-Poisson Channel

Several applications of molecular communications (MC) feature an alarm-p...
research
09/13/2018

Channel Polarization through the Lens of Blackwell Measures

Each memoryless binary-input channel (BIC) can be uniquely described by ...
research
07/07/2022

Identification based on random coding

Ahlswede and Dueck showed possibility to identify with high probability ...
research
05/11/2023

The Cardinality Bound on the Information Bottleneck Representations is Tight

The information bottleneck (IB) method aims to find compressed represent...

Please sign up or login with your details

Forgot password? Click here to reset