Partition Information and its Transmission Over Boolean Multi-Access Channels

DOI10.1109/TIT.2014.2375211MaRDI QIDQ2978785zbMATH OpenOpenAlexFDO

Authors Shuhang Wu, Shuangqing Wei, Yue Wang, Jian Yuan, Ramachandran Vaidyanathan

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.0425

Mathematics Subject Classification ID

Communication theory (94A05) Applications of graph theory to circuits and networks (94C15) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Abstract: In this paper, we propose a novel partition reservation system to study the partition information and its transmission over a noise-free Boolean multi-access channel. The objective of transmission is not message restoration, but to partition active users into distinct groups so that they can, subsequently, transmit their messages without collision. We first calculate (by mutual information) the amount of information needed for the partitioning without channel effects, and then propose two different coding schemes to obtain achievable transmission rates over the channel. The first one is the brute force method, where the codebook design is based on centralized source coding; the second method uses random coding where the codebook is generated randomly and optimal Bayesian decoding is employed to reconstruct the partition. Both methods shed light on the internal structure of the partition problem. A novel hypergraph formulation is proposed for the random coding scheme, which intuitively describes the information in terms of a strong coloring of a hypergraph induced by a sequence of channel operations and interactions between active users. An extended Fibonacci structure is found for a simple, but non-trivial, case with two active users. A comparison between these methods and group testing is conducted to demonstrate the uniqueness of our problem.

Recommendations

• Asymptotic Error Free Partitioning Over Noisy Boolean Multiaccess Channels
• On multi-partition communication complexity
• Partition arguments in multiparty communication complexity
• Partition Arguments in Multiparty Communication Complexity
• Randomized communication versus partition number
• Publication:3476739
• Deterministic communication vs. partition number
• scientific article; zbMATH DE number 1688365
• Partitioned encryption and achieving simultaneity by partitioning

This page was built for publication: Partition Information and its Transmission Over Boolean Multi-Access Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978785)