A Numerical Study of Multi-Letter Ahlswede-Han Scheme for Modulo-Sum Problem

被引：0

作者：

Kakishima, Takuto ^{[1
]}

Watanabe, Shun ^{[2
]}

机构：

[1] Univ Tsukuba, Grad Sch Sci & Technol, Tennoudai 1-1-1, Tsukuba, Ibaraki 3058573, Japan

[2] Tokyo Univ Agr & Technol, Dept Comp & Informat Sci, Nakamachi 2-24-16, Koganei, Tokyo 1848588, Japan

来源：

2022 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, ISITA | 2022年

基金：

日本学术振兴会;

关键词：

Achievable rate; Ahlswede-Han scheme; modulo-sum problem; source coding; INFORMATION;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The achievable sum rate of the multi-letter Ahlswede-Han scheme for the modulo-sum problem is investigated. For auxiliary random variables induced by the parity check matrix of the repetition code, a compact expression of the achievable sum rate in terms of the source distribution's parameters is obtained. It is numerically demonstrated that the multi-letter Ahlswede-Han scheme strictly improves the sum rate of the Slepian-Wolf scheme and the Korner-Marton scheme for wide ranges of parameters.

引用

页码：84 / 88

页数：5