2020/10/27 by Christian Deppe, Deppe, Christian, В. С. Лебедев +2
Computer Science · Engineering · #Coding theory and cryptography #Cryptography and Data Security #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2010.14257
openalex publication_date 2020/10/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Berlekamp and Zigangirov completely determined the capacity error function\nfor binary error correcting codes with noiseless feedback. It is still an\nunsolved problem if the upper bound for the capacity error function in the\nnon-binary case of Ahlswede, Lebedev, and Deppe is sharp. We consider\nwraparound channels with limited magnitude and noiseless feedback. We\ncompletely determine the capacity error function for all q-ary wraparound\nchannels with a magnitude of level r. All of our algorithms use partial\nnoiseless feedback. Furthermore, a special case of the problem is equivalent to\nShannon's zero-error problem.\n