Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Hi-index | 0.00 |
Answering a question of Körner and Simonyi, this paper gives a strongly consecutive repeat-free code of maximal size in [b]n.