channel capacity 1combinatorial coding 1q-ary channels 1repeat channels 1sticky channels 1zero-error capacity 1
From the 1 of 4 linked papers with an AI index.
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026
The Capacity of a Family of Sticky Channels
Mladen KovaÄeviÄ
The paper exactly determines the Shannon and zero‑error capacity of a family of q‑ary sticky‑insertion (repeat) channels, showing it equals log₂ λ bits per symbol under specific re…
cs.IT2024
An Information-Theoretic Analog of the Twin Paradox
Mladen KovaÄeviÄ, Iosif Pinelis, Marios Kountouris
We revisit the familiar scenario involving two parties in relative motion, in which Alice stays at rest while Bob goes on a journey at speed along an arbitrary trajectory and…