Exact capacities are computed for coloring channel sequences forming uniform sunflowers, intersecting sets, and paths, with capacity determined solely by the pairs graph; bounds are given for cycles.
Efficient reconstruction of sequences from their subsequences or supersequences
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
-
On the Capacity of Sequences of Coloring Channels
Exact capacities are computed for coloring channel sequences forming uniform sunflowers, intersecting sets, and paths, with capacity determined solely by the pairs graph; bounds are given for cycles.