Bounds for the capacity error function for unidirectional channels with noiseless feedback

被引:1
作者
Deppe, Christian [1 ]
Lebedev, Vladimir [2 ]
Maringer, Georg [1 ]
机构
[1] Tech Univ Munich, Inst Commun Engn, D-80333 Munich, Germany
[2] Kharkevich Inst Informat Transmiss Problems, Moscow 127051, Russia
基金
俄罗斯基础研究基金会;
关键词
Error-correcting codes; Uni-directional errors; Feedback; CODES;
D O I
10.1016/j.tcs.2020.11.049
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In digital systems such as fiber optical communications, the ratio between probability of errors of type 1 -> 0 and 0 -> 1 can be large. Practically, one can assume that only one type of error can occur. These errors are called asymmetric. Unidirectional errors differ from asymmetric type of errors; here both 1 -> 0 and 0 -> 1 type of errors are possible, but in any submitted codeword all the errors are of the same type. This can be generalized for the q-ary case. We consider q-ary unidirectional channels with feedback where the errors have magnitude one and give bounds for the capacity error function. It turns out that the bounds depend on the parity of the alphabet size q. Furthermore, we show that for feedback, the capacity error function for the binary asymmetric channel is different from the symmetric channel. This is in contrast to the behavior of the function without feedback. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 13
页数:13
相关论文
共 18 条
  • [1] Ahlswede R., 2005, Annals of European Academy of Sciences, V1, P285
  • [2] Ahlswede R., 2004, P 9 INT WORKSH ALG C, P1
  • [3] Bassalygo L. A., 1965, Problems of Information Transmission, V1, P32
  • [4] Berlekamp E.R., 1968, P S ERR CORR COD
  • [5] Brualdi RA., 2010, Introductory Combinatorics, V5
  • [6] Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories
    Cassuto, Yuval
    Schwartz, Moshe
    Bohossian, Vasken
    Bruck, Jehoshua
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (04) : 1582 - 1595
  • [7] Cicalese F., 2013, EATCS SERIES
  • [8] D'yachkov A.G., 1975, PROBL CONTR INFORM T, V11, P13
  • [9] Deppe C., 2007, Entropy, Search, Complexity, V16, P27
  • [10] Algorithms for q-ary error-correcting codes with limited magnitude and feedback
    Deppe, Christian
    Lebedev, Vladimir
    [J]. DISCRETE MATHEMATICS, 2021, 344 (02)