Zero-Error Sum Modulo Two with a Common Observation

Secure Modulo Sum via Multiple Access Channel

We discuss secure computation of modular sum when multiple access channel from distinct players $A_1, \ldots, A_c$ to a third party (Receiver) is given. Then, we define the secure modulo sum capacity as the supremum of the transmission rate of modulo sum without information leakage of other information. We derive its useful lower bound, which is numerically calculated under a realistic model that can be realizable as a Gaussian multiple access channel (MAC).

On Modulo-Sum Computation over an Erasure Multiple Access Channel

We study computation of a modulo-sum of two binary source sequences over a two-user erasure multiple access channel. The channel is modeled as a binary-input, erasure multiple access channel, which can be in one of three states - either the channel output is a modulo-sum of the two input symbols, or the channel output equals the input symbol on the first link and an erasure on the second link, or vice versa. The associated state sequence is independent and identically distributed. We develop a new upper bound on the sum-rate by revealing only part of the state sequence to the transmitters. Our…

Capacity of a Class of Modulo-Sum Relay Channels

This paper characterizes the capacity of a class of modulo additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination. The capacity is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay. This result confirms a conjecture by Ahlswede and Han about the capacity of channels with rate limited state information at the destination for this particular class of channels.

在二进制模和问题中结构化编码改进随机编码的条件

The Condition for Structured Coding to Improve Random Coding in the Binary Modulo-sum Problem

本文分析刻画了多字母扩展AH编码优于Slepian-Wolf编码的条件，通过类型方法将多字母表达式简化为单字母散度的比较。