当前位置:
X-MOL 学术
›
Des. Codes Cryptogr.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
Designs, Codes and Cryptography ( IF 1.4 ) Pub Date : 2024-09-17 , DOI: 10.1007/s10623-024-01485-9 Sascha Kurz
中文翻译:
与固定字母大小的钻石网络相关的无限网络系列的容量
更新日期:2024-09-17
Designs, Codes and Cryptography ( IF 1.4 ) Pub Date : 2024-09-17 , DOI: 10.1007/s10623-024-01485-9 Sascha Kurz
We consider the problem of error correction in a network where the errors can occur only on a proper subset of the network edges. For a generalization of the so-called Diamond Network we consider lower and upper bounds for the network’s (1-shot) capacity for fixed alphabet sizes.
中文翻译:
与固定字母大小的钻石网络相关的无限网络系列的容量
我们考虑网络中的纠错问题,其中错误只能发生在网络边缘的适当子集上。为了推广所谓的钻石网络,我们考虑固定字母大小的网络(1-shot)容量的下限和上限。