Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research Pub Date : 2024-09-17 DOI:10.1007/s10623-024-01485-9

Sascha Kurz

引用次数: 0

Abstract

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.

Abstract Image

查看原文本刊更多论文

在字母大小固定的情况下，与钻石网络相关的无限网络族的容量

我们考虑的是网络中的纠错问题，在这种网络中，错误只能发生在网络边的适当子集上。对于所谓钻石网络的推广，我们考虑了在字母大小固定的情况下，网络（1 次）容量的下限和上限。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.