Deterministic variable-length codes for downlink massive random access achieve an overhead of at most 1 + log₂e bits via covering array constructions from combinatorics.
Families of k-independent sets,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Remark on Downlink Massive Random Access
Deterministic variable-length codes for downlink massive random access achieve an overhead of at most 1 + log₂e bits via covering array constructions from combinatorics.