arXiv subjects

Marcel A. Mross

Publications and source records attributed to Marcel A. Mross.

5 recordsLinked to original sources

arXiv2026

Foundations of Future Communication Systems: Innovations in Communication - A Report

The Foundations of Future Communication Systems (FFCS) conference brought together leading researchers from information theory, quantum communication, molecular communication, semantic communication, and secure network design to explore the fundamental principles shaping next-generation communication systems. The event serves as a platform for interdisciplinary exchange, bridging classical Shannon theory, post-Shannon paradigms, quantum information science, and emerging physically grounded communication models. This report compiles the abstracts of all invited talks, contributed presentations, and poster contributions presented at FFCS. The collected works reflect the breadth of contemporary research directions, including identification-based communication, entanglement-assisted networks, semantic and goal-oriented communication, coding for molecular and nanoscale systems, secure authentication mechanisms, and information-theoretic limits of novel physical-layer architectures. A central theme of the conference was the re-examination of foundational limits under realistic physical, architectural, and security constraints. Many contributions move beyond traditional rate-centric perspectives and instead investigate reliability, identification, semantics, resource efficiency, and trust in complex and heterogeneous networks. The inclusion of poster abstracts further highlights emerging ideas, early-stage research results, and innovative cross-disciplinary approaches that contribute to shaping future communication paradigms. By documenting the intellectual landscape presented at FFCS, this report aims to provide a structured overview of current research frontiers and to stimulate continued collaboration across theoretical and experimental domains.

cs.IT↗

arXiv2025

Age of Information in Short Packet Multi-Connectivity Links

In this paper, we investigate multi-connectivity schemes in the context of status update systems with short payloads. As the performance metric, we use the Age of Information (AoI). Due to short payloads, transmission errors must be taken into account. In addition to the well-known schemes of packet duplication, message splitting, and multiplexing, we propose a codeword splitting scheme, where each status update is jointly encoded across multiple channels. We derive closed-form expressions for the average AoI for the different schemes and optimize their corresponding parameters. We show that the AoI of the multiplexing scheme is a convex function in the offset parameters and use this result to prove that for homogeneous channels, the multiplexing scheme outperforms the packet duplication scheme, which is outperformed by the codeword splitting scheme. Analytical comparisons and numerical evaluations show that the codeword splitting scheme achieves the lowest average AoI when joint coding is feasible. In scenarios where joint coding is not feasible, whether message splitting or multiplexing results in a lower average AoI depends on the specific parameters.

cs.IT↗

arXiv2025

Wrap-Decoding in Asynchronous Unsourced Multiple Access With and Without Delay Information

An asynchronous $\ka$-active-user unsourced multiple access channel (AUMAC) is a key model for uncoordinated massive access in future networks. We focus on a scenario where each transmission is subject to the maximal delay constraint ($\dm$), and the precise delay of each user is unknown at the receiver. The combined effects of asynchronicity and uncertain delays require analysis over all possible delay-codeword combinations, making the complexity of the analysis grow with $\dm$ and $\ka$ exponentially. To overcome the complexity, we employ a wrap-decoder for the AUMAC and derive a uniform upper bound on the per-user probability of error (PUPE). The numerical result shows the trade-off between energy per bit and the number of active users under various delay constraints. Furthermore, in our considered AUMAC, decoding without explicit delay information is shown to achieve nearly the same energy efficiency as decoding with perfect delay knowledge.

cs.IT↗

arXiv2024

Converse Techniques for Identification via Channels

The model of identification via channels, introduced by Ahlswede and Dueck, has attracted increasing attention in recent years. One such promising direction is message identification via channels, introduced by Ahlswede and Dueck. Unlike in Shannon's classical model, where the receiver aims to determine which message was sent from a set of $M$ messages, message identification focuses solely on discerning whether a specific message $m$ was transmitted. The encoder can operate deterministically or through randomization, with substantial advantages observed particularly in the latter approach. While Shannon's model allows transmission of $M = 2^{nC}$ messages, Ahlswede and Dueck's model facilitates the identification of $M = 2^{2^{nC}}$ messages, exhibiting a double exponential growth in block length. In their seminal paper, Ahlswede and Dueck established the achievability and introduced a "soft" converse bound. Subsequent works have further refined this, culminating in a strong converse bound, applicable under specific conditions. Watanabe's contributions have notably enhanced the applicability of the converse bound. The aim of this survey is multifaceted: to grasp the formalism and proof techniques outlined in the aforementioned works, analyze Watanabe's converse, trace the evolution from earlier converses to Watanabe's, emphasizing key similarities and differences that underpin the enhancements. Furthermore, we explore the converse proof for message identification with feedback, also pioneered by Ahlswede and Dueck. By elucidating how their approaches were inspired by preceding proofs, we provide a comprehensive overview. This overview paper seeks to offer readers insights into diverse converse techniques for message identification, with a focal point on the seminal works of Hayashi, Watanabe, and, in the context of feedback, Ahlswede and Dueck.

cs.IT↗

arXiv2024

Worst-Case Per-User Error Bound for Asynchronous Unsourced Multiple Access

This work considers an asynchronous $\textsf{K}_\text{a}$-active-user unsourced multiple access channel (AUMAC) with the worst-case asynchronicity. The transmitted messages must be decoded within $n$ channel uses, while some codewords are not completely received due to asynchronicities. We consider a constraint of the largest allowed delay of the transmission. The AUMAC lacks the permutation-invariant property of the synchronous UMAC since different permutations of the same codewords with a fixed asynchronicity are distinguishable. Hence, the analyses require calculating all $2^{\textsf{K}_\text{a}}-1$ combinations of erroneously decoded messages. Moreover, transmitters cannot adapt the corresponding codebooks according to asynchronicity due to a lack of information on asynchronicities. To overcome this challenge, a uniform bound of the per-user probability of error (PUPE) is derived by investigating the worst-case of the asynchronous patterns with the delay constraint. Numerical results show the trade-off between the energy-per-bit and the number of active users for different delay constraints. In addition, although the asynchronous transmission reduces interference, the required energy-per-bit increases as the receiver decodes with incompletely received codewords, compared to the synchronous case.

cs.IT↗