Reliability-Dependent Scaling Laws of Deterministic Identification over Binary Symmetric Channels

Abstract

In this paper, we study the asymptotic behavior of deterministic identification (DID) over binary symmetric channels (BSCs) under vanishing error constraints. By introducing a minimum error parameter, we characterize how different error-decay regimes affect the achievable DID rate. General achievability and converse bounds are derived, with explicit asymptotic characterizations in the large-deviation, moderate-deviation, and central-limit regimes. The achievability analysis combines coding-theoretic constructions with probabilistic concentration techniques, while the converse links statistical distinguishability to the minimum-distance structure of DID codes via total variation and Hamming-type bounds. Our results show that the asymptotic behavior of DID over BSCs is governed by a Hamming-shell concentration geometry of channel outputs, offering insights into the finite-blocklength behavior of deterministic identification over discrete-output channels.

This work has been accepted by Information Theory Workshop 2026