Interlocked permutations

2018/03/14 by Gerard Cohen, Cohen, Gerard, Emanuela Fachini +3
Mathematics · #05C35 #05C62 #05D99 #94A24 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C35 #msc:05C62 #msc:05D99 #msc:94A24

paper · pdf · doi:10.48550/arxiv.1803.05187

8 pages

arxiv created 2018/07/14 · arxiv updated 2018/07/17

Abstract

The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.

Related

• Variable-Length Coding for Zero-Error Channel Capacity
• Computability of the Zero-Error Capacity of Noisy Channels
• New Converse Bounds for Discrete Memoryless Channels in the Finite Blocklength Regime
• Zero-error capacity of binary channels with memory
• Single-Letter Characterization of Epsilon-Capacity for Mixed Memoryless Channels