THE ZERO-ERROR CAPACITY OF BINARY CHANNELS WITH 2-MEMORIES

被引：1

作者：

Zhang, Guofen ^{[1
]}

Li, Ping ^{[1
]}

Hou, Jianfeng ^{[1
,2
]}

Bai, Bo ^{[1
]}

机构：

[1] Huawei Tech Investment Co Ltd, Theory Lab HK, Shatin, Hong Kong, Peoples R China

[2] Fuzhou Univ, Ctr Discrete Math, Fuzhou 350108, Fujian, Peoples R China

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2024年 / 18卷 / 01期

基金：

中国国家自然科学基金;

关键词：

zero-error capacity; binary channels; channels with memories; graph; SHANNON CAPACITY;

D O I：

10.3934/amc.2022009

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The zero-error capacity of a noisy channel is defined as the least upper bound of rate at which it is possible to transmit information with zero probability of error. It was posed by Shannon and extended to channels with memories by Ahlswede, Cai and Zhang. In this paper, we give a first step towards the zero-error capacity problems of binary channels with 2-memories, and determine the zero-error capacity of at least 2(24) possible cases in all 2(28) cases.

引用

页码：179 / 191

页数：13

共 16 条

[1] Zero-error capacity for models with memory and the enlightened dictator channel [J].

Ahlswede, R ;

Cai, N ;

Zhang, Z .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :1250-1252

[2] The Shannon capacity of a graph and the independence numbers of its powers [J].

Alon, N ;

Lubetzky, E .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2172-2176

[3] The Shannon capacity of a union [J].

Alon, N .

COMBINATORICA, 1998, 18 (03) :301-310

[4] A nontrivial lower bound on the Shannon capacities of the complements of odd cycles [J].

Bohman, T ;

Holzman, R .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (03) :721-722

[5] On Zero-Error Capacity of Binary Channels With One Memory [J].

Cao, Qi ;

Cai, Ning ;

Guo, Wangmei ;

Yeung, Raymond W. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (10) :6771-6778

[6] Zero-Error Capacity of Binary Channels With Memory [J].

Cohen, Gerard ;

Fachini, Emanuela ;

Koerner, Janos .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (01) :3-7

[7] SOME PROBLEMS OF LOVASZ CONCERNING THE SHANNON CAPACITY OF A GRAPH [J].

HAEMERS, W .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (02) :231-232

[8] A BOUND ON THE SHANNON CAPACITY VIA A LINEAR PROGRAMMING VARIATION [J].

Hu, Sihuang ;

Tamo, Itzhak ;

Shayevitz, Ofer .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (03) :2229-2241

[9]

Jurkiewicz M., 2014, J APPL COMPUT SCI, V22, P31

[10] On the Normalized Shannon Capacity of a Union [J].

Keevash, Peter ;

Long, Eoin .

COMBINATORICS PROBABILITY & COMPUTING, 2016, 25 (05) :766-767

← 1 2 →