2020/01/24 by Christian Deppe, Deppe, Christian, V. V. Lebedev +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Coding theory and cryptography #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2001.09030
openalex publication_date 2020/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In digital systems such as fiber optical communications, the ratio between\nprobability of errors of type 1\→ 0 and 0 \→ 1 can be large. Practically,\none can assume that only one type of error can occur. These errors arecalled\nasymmetric. Unidirectional errors differ from asymmetric type of errors; here\nboth 1 \→ 0 and 0 \→ 1 type of errors are possible, but in any\nsubmittedcodeword all the errors are of the same type. This can be generalized\nfor the q-ary case. We consider q-ary unidirectional channels with feedback\nand give bounds for the capacity error function. It turns out that the bounds\ndepend on the parity of the alphabet q. Furthermore, we show that for\nfeedback, the capacity error function for the binary asymmetric channel is\ndifferent from the symmetric channel. This is in contrast to the behavior of\nthe function without feedback.\n