2021/02/04 by Ke Wu, Wu, Ke, Aaron B. Wagner +1
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2102.02358
openalex publication_date 2021/02/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We provide a practical implementation of the rubber method of Ahlswede et al. for binary alphabets. The idea is to create the "skeleton" sequence therein via an arithmetic decoder designed for a particular k-th order Markov chain. For the stochastic binary symmetric channel, we show that the scheme is nearly optimal in a strong sense for certain parameters.