pith. machine review for the scientific record. sign in

arxiv: 2604.05694 · v1 · submitted 2026-04-07 · 💻 cs.IT · math.IT

Recognition: 2 theorem links

· Lean Theorem

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

Christian Deppe , Eduard Jorswieck , Pin-Hsun Lin , Vida Gholamian , Marcel A. Mross
Authors on Pith no claims yet

Pith reviewed 2026-05-10 18:38 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords information theoryquantum communicationmolecular communicationsemantic communicationconference reportpost-Shannon theorysecure networksfoundations of communication
0
0 comments X

The pith

This report compiles all abstracts from the FFCS conference to document current research on foundations of future communication systems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper assembles abstracts of invited talks, contributed presentations, and posters presented at the Foundations of Future Communication Systems conference. These span information theory, quantum communication, molecular communication, semantic communication, and secure network design. The collection shows researchers re-examining foundational limits under physical, architectural, and security constraints rather than focusing solely on rates. A sympathetic reader would care because the report supplies a single structured snapshot of how the field is expanding into identification, semantics, resource efficiency, and trust in heterogeneous networks.

Core claim

The report establishes that the collected works reflect a broad move beyond classical Shannon theory toward post-Shannon paradigms, quantum information science, and physically grounded models, with contributions examining identification-based communication, entanglement-assisted networks, semantic and goal-oriented communication, coding for molecular systems, secure authentication, and information-theoretic limits of novel physical-layer architectures.

What carries the argument

The systematic compilation and thematic organization of every invited talk, contributed presentation, and poster abstract into an overview of research frontiers.

Load-bearing premise

The selected abstracts faithfully represent the full scope of the conference without omission or selection bias.

What would settle it

An independent complete list of all FFCS presentations that reveals multiple omitted talks or posters would show the compilation is incomplete.

Figures

Figures reproduced from arXiv: 2604.05694 by Christian Deppe, Eduard Jorswieck, Marcel A. Mross, Pin-Hsun Lin, Vida Gholamian.

Figure 1
Figure 1. Figure 1: Presentation of the poster award to Ghislaine [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Presentation of the poster award to Marcel. development of future communication systems, with applications ranging from 6G and quantum communication to molecular communication, network opti￾mization, resilience, low-latency systems, post-Shannon paradigms, and secure as well as privacy-preserving communication. A distinctive feature of the poster sessions was the close interplay between deep theoretical in… view at source ↗
Figure 3
Figure 3. Figure 3 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Igor Bernard the poster contribution “One-Shot Distributed Instrument Simulation,” which studies the distributed simu￾lation of quantum instruments in a one-shot setting. Quantum measure￾ments generate both classical out￾comes and post-measurement quan￾tum states, thereby establishing corre￾lations between measurement results and the resulting quantum system. Quantum instruments generalize POVMs by produci… view at source ↗
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Holger Boche this poster contribution, which stud￾ies the algorithmic computability of the secrecy capacity of fast-fading Gaussian wiretap channels from a foundational perspective [30]. The reliable design of wireless commu￾nication systems, particularly for emerging 6G applications, requires a precise understanding of channel capacity under realistic fading con￾ditions. The work investigates the algorith… view at source ↗
Figure 8
Figure 8. Figure 8: Holger Boche this poster contribution, which in￾vestigates the algorithmic limits of convexification procedures in continu￾ous optimization problems. Optimiza￾tion techniques play a central role in communications, signal process￾ing, information theory, and control, where convex optimization is partic￾ularly attractive due to its computa￾tional tractability and the availabil￾ity of efficient numerical algo… view at source ↗
Figure 9
Figure 9. Figure 9: Minglai Cai poster contribution “Quantum Byzan￾tine Multiple Access Channels,” which studies classical–quantum multiple￾access channels in the presence of an adversarial transmitter. In such Byzantine communication scenarios, one of the legitimate senders may behave maliciously and attempt to disrupt the communication of hon￾est users. The model extends the Byzantine multiple-access channel in￾troduced in … view at source ↗
Figure 10
Figure 10. Figure 10: Ghislaine Coulter-de Wit ( [PITH_FULL_IMAGE:figures/full_fig_p011_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Christian Eckrich ( [PITH_FULL_IMAGE:figures/full_fig_p012_11.png] view at source ↗
Figure 12
Figure 12. Figure 12 [PITH_FULL_IMAGE:figures/full_fig_p013_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Rami Ezzine the poster entitled “Common Ran￾domness Generation from Sources with Infinite Polish Alphabet Aided by Unidirectional Communication.” The work studies the generation of com￾mon randomness (CR) between com￾municating parties observing corre￾lated sources while using limited com￾munication. CR is a fundamental re￾source in several information-theoretic applications, including message iden￾tifica… view at source ↗
Figure 14
Figure 14. Figure 14 [PITH_FULL_IMAGE:figures/full_fig_p015_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Fatma Gouiaa achievable rate regions for classi￾cal–quantum broadcast and inter￾ference channels using coset codes, emphasizing structured coding tech￾niques that exploit algebraic proper￾ties to manage interference and at￾tain improved trade-offs. Fatma un￾dertakes a Shannon-theoretic study of communicating classical bit streams over multi-terminal quantum chan￾nels, specifically the three-user quan￾tum … view at source ↗
Figure 16
Figure 16. Figure 16: Rodrigo Kloster Albarracín ( [PITH_FULL_IMAGE:figures/full_fig_p017_16.png] view at source ↗
Figure 17
Figure 17. Figure 17 [PITH_FULL_IMAGE:figures/full_fig_p018_17.png] view at source ↗
Figure 18
Figure 18. Figure 18 [PITH_FULL_IMAGE:figures/full_fig_p019_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: Marcel Mross addressed second-order coding rates for identification with feedback, refin￾ing asymptotic identification results by quantifying dispersion-type terms and the role of feedback. Second-order coding rates show how quickly the rates converge towards capacity as the blocklength n approaches infinity. In this case, these rates were given for identification via channels, where the receiver asks whe… view at source ↗
Figure 20
Figure 20. Figure 20: Husein Natur the poster contribution “Quantum Se￾cret Sharing Rates,” which investi￾gates achievable rates for quantum se￾cret sharing (QSS) over noisy quan￾tum channels. Secret sharing is a fun￾damental cryptographic primitive in which a secret is distributed among multiple parties such that only quali￾fied subsets of participants can recon￾struct the secret, while non-qualified subsets obtain no informa… view at source ↗
Figure 21
Figure 21. Figure 21: Kumar Nilesh the poster “From Hardware to Trust: Quantum Biometrics for the Next Generation,” focusing on quantum￾enhanced biometric systems for se￾cure identification and authentication. Classical biometric systems, while widely used, rely on heuristic secu￾rity assumptions and are vulnerable to spoofing and privacy leakage. In con￾trast, quantum biometrics leverage in￾trinsic physical randomness and qua… view at source ↗
Figure 22
Figure 22. Figure 22 [PITH_FULL_IMAGE:figures/full_fig_p023_22.png] view at source ↗
Figure 23
Figure 23. Figure 23 [PITH_FULL_IMAGE:figures/full_fig_p024_23.png] view at source ↗
Figure 24
Figure 24. Figure 24: Moritz Wiese improved upper and lower bounds for the security performance of wiretap channels. When assessing the security of a wiretap code, one usually has to rely on theoretical upper bounds and on the assumption that the un￾derlying channel model is accurate. An overview of recent work in [160], [161], [162] is given, where such as￾sumptions are unnecessary. This ap￾proach is based on the “distinguish… view at source ↗
Figure 25
Figure 25. Figure 25 [PITH_FULL_IMAGE:figures/full_fig_p026_25.png] view at source ↗
Figure 26
Figure 26. Figure 26 [PITH_FULL_IMAGE:figures/full_fig_p027_26.png] view at source ↗
Figure 27
Figure 27. Figure 27 [PITH_FULL_IMAGE:figures/full_fig_p028_27.png] view at source ↗
Figure 28
Figure 28. Figure 28: Yaning Zhao the molecular communication (MC) testbed developed at the Institute for Communications Technology (IfN), TU Braunschweig, for the undergrad￾uate Communication Engineering lab￾oratory course. The primary objective of this experiment is to provide stu￾dents with an intuitive, reproducible, and practically accessible introduc￾tion to key MC concepts through a low-cost fluidic setup. The system is… view at source ↗
Figure 29
Figure 29. Figure 29 [PITH_FULL_IMAGE:figures/full_fig_p030_29.png] view at source ↗
Figure 30
Figure 30. Figure 30 [PITH_FULL_IMAGE:figures/full_fig_p031_30.png] view at source ↗
Figure 31
Figure 31. Figure 31: Daniel Kilper an overview of current trends in quan￾tum network systems research, focus￾ing on the architectural and engineer￾ing challenges that arise when mov￾ing from point-to-point quantum com￾munication experiments toward large￾scale quantum networks [90]. While many theoretical results in quantum networking originate from physics and information theory, the development of practical network systems r… view at source ↗
Figure 32
Figure 32. Figure 32 [PITH_FULL_IMAGE:figures/full_fig_p033_32.png] view at source ↗
Figure 33
Figure 33. Figure 33: René Schwonnek overview of device-independent quan￾tum key distribution, describing se￾curity guarantees derived from ob￾served statistics, the assumptions that can be removed compared to stan￾dard QKD, and the practical barriers and opportunities on the path toward implementations. Device-independent quantum key distribution (DI-QKD) is widely regarded as the most strin￾gent form of quantum cryptography,… view at source ↗
Figure 34
Figure 34. Figure 34: Ilja Gerhardt the talk discussing how individual molecules can act as quantum optical emitters and building blocks for quan￾tum communication experiments. Al￾though molecules are typically asso￾ciated with chemistry, the presenta￾tion showed that many of their opti￾cal properties closely resemble those of well-known quantum emitters such as atoms, ions, or quantum dots. The talk began with an introduction… view at source ↗
Figure 35
Figure 35. Figure 35 [PITH_FULL_IMAGE:figures/full_fig_p036_35.png] view at source ↗
Figure 36
Figure 36. Figure 36: Frank Fitzek a presentation on the evolution of the 6G-life initiative toward its suc￾cessor program, 6G-life2 . In his talk, he outlined that whereas 6G-life pri￾marily focused on foundational re￾search and architectural concepts for next-generation communication sys￾tems, 6G-life2 places stronger empha￾sis on structured technology trans￾fer and implementation pathways. A comprehensive summary of the sci… view at source ↗
Figure 37
Figure 37. Figure 37: Yanling Chen results on non-adaptive coding strate￾gies for the two-way wiretap chan￾nel (TW-WC) with an external eaves￾dropper, based on joint work with Prof. Masahito Hayashi [83,39]. The talk addressed reliable and secure communication over the TW-WC and discussed different encoder–decoder configurations, both with and without cost constraints, as well as various cri￾teria used to measure reliability a… view at source ↗
Figure 38
Figure 38. Figure 38: Ugo Vaccaro recent results on Superimposed Codes (SCs) and their applications to syn￾chronization and security problems in communication systems. A (t, n, k)- superimposed code can be represented as a t×n binary matrix with the prop￾erty that, for every column and every set of k−1 other columns, there exists a row in which the selected column has a 1 while the other k−1 columns have 0. In communication se… view at source ↗
Figure 39
Figure 39. Figure 39: Hannes Bartz recent work on the security of code￾based private information retrieval (PIR) schemes, based on joint work with Svenja Lage [102]. Private infor￾mation retrieval allows a user to ob￾tain a file from a database without re￾vealing to the server which file is re￾quested. While information-theoretic PIR requires multiple non-colluding servers, single-server solutions typi￾cally rely on computatio… view at source ↗
Figure 40
Figure 40. Figure 40: Matteo Nerini analog computing, which has recently been revived due to its potential for energy-efficient and highly paral￾lel computations. In this talk, ana￾log computers that linearly process microwave signals, referred to as mi￾crowave linear analog computers (Mi￾LACs), and their applications in sig￾nal processing and communications were discussed [125,126]. In the first part, a MiLAC is mod￾eled as a… view at source ↗
Figure 41
Figure 41. Figure 41 [PITH_FULL_IMAGE:figures/full_fig_p042_41.png] view at source ↗
Figure 42
Figure 42. Figure 42: Falko Dressler the talk “Molecular Communication in Different Fluids”, discussing how the physical properties of the transmission medium affect molecular communica￾tion systems. The presentation was based on recent experimental work evaluating molecular communication channels in realistic biological envi￾ronments, particularly blood [52]. Molecular communication has been proposed as a key technol￾ogy for … view at source ↗
Figure 43
Figure 43. Figure 43: Massimiliano Pierobon presented a talk exploring how information-theoretic concepts can be extended to better describe communication processes in living systems. Molecular communication (MC) studies how information is encoded, transmitted, and decoded using molecules as physical carriers. In contrast to classical electromag￾netic communication, molecules are discrete physical entities whose propagation is… view at source ↗
Figure 44
Figure 44. Figure 44: Liubov Bakhchova presented a talk related to the characterization of organic mixed ionic–electronic conduc￾tors (OMIECs) and their role in bioelectronic devices. The presen￾tation focused on experimental methods for understanding the in￾ternal electrochemical and structural processes occurring in organic elec￾trochemical transistors (OECTs), which are promising components for next-generation bioelectronic… view at source ↗
Figure 45
Figure 45. Figure 45 [PITH_FULL_IMAGE:figures/full_fig_p046_45.png] view at source ↗
Figure 46
Figure 46. Figure 46: Martin Korte a talk discussing how molecular sig￾nalling processes in the brain regu￾late neural function, protection, and disease. The presentation highlighted the central role of microglia—the res￾ident immune cells of the central ner￾vous system—in sensing and process￾ing molecular signals within neural tissue. In the brain, communication does not occur solely through electri￾cal synapses between neuro… view at source ↗
Figure 47
Figure 47. Figure 47 [PITH_FULL_IMAGE:figures/full_fig_p048_47.png] view at source ↗
Figure 48
Figure 48. Figure 48 [PITH_FULL_IMAGE:figures/full_fig_p049_48.png] view at source ↗
Figure 49
Figure 49. Figure 49 [PITH_FULL_IMAGE:figures/full_fig_p050_49.png] view at source ↗
Figure 50
Figure 50. Figure 50: Armin Dekorsy recent perspectives on semantic com￾munication (SemCom) from the view￾point of human decision-making and multi-tasking. Semantic communica￾tion shifts the focus of communica￾tion system design from transmit￾ting raw data reliably to transmitting task-relevant meaning, thereby align￾ing communication with application goals and human cognition. Build￾ing on Shannon’s information theory, modern… view at source ↗
Figure 51
Figure 51. Figure 51: Neha Sangwan models of Byzantine channels and sys￾tems, focusing on communication and inference when components may be￾have adversarially, and discussing cod￾ing and system-level strategies that provide robustness against worst-case manipulations. 5G networks offer exceptional reli￾ability and availability, ensuring con￾sistent performance and user satisfac￾tion. Yet, they may still fail when con￾fronted … view at source ↗
Figure 52
Figure 52. Figure 52: Marc Geitz ideas on bringing identification codes closer to practical communication sys￾tems. Identification via channels dif￾fers fundamentally from classical mes￾sage transmission: instead of decod￾ing a full message, the receiver only decides whether a specific message was sent. This change in the decod￾ing task allows the number of identi￾fiable messages to grow doubly expo￾nentially with the blocklen… view at source ↗
Figure 53
Figure 53. Figure 53: Stefan Wegele recent work on the use of quantum annealing for automated dispatching in railway operations, focusing on how large-scale scheduling conflicts can be formulated and solved using quadratic unconstrained binary opti￾mization (QUBO) models [164]. The railway dispatching problem arises when delays propagate through a network and conflicts occur between trains competing for limited infras￾tructure… view at source ↗
Figure 54
Figure 54. Figure 54: Stefano Buzzi recent advances on overcoming hard￾ware impairments in cell-free massive MIMO (CF-mMIMO) systems using differential space–time block coding (DSTBC), addressing practical limita￾tions caused by phase misalignments across distributed access points [69]. CF-mMIMO is considered a promis￾ing architecture for future wireless networks because it replaces con￾ventional cellular deployments with many… view at source ↗
Figure 55
Figure 55. Figure 55 [PITH_FULL_IMAGE:figures/full_fig_p056_55.png] view at source ↗
Figure 56
Figure 56. Figure 56 [PITH_FULL_IMAGE:figures/full_fig_p057_56.png] view at source ↗
Figure 57
Figure 57. Figure 57: Mohammad Soleymani presented recent work on multi￾objective optimization for emerging 6G wireless systems, with a focus on reconfigurable intelligent surface (RIS)-assisted communications. Fu￾ture wireless networks must simul￾taneously improve multiple key per￾formance indicators such as spectral efficiency, energy efficiency, latency, and reliability. Since these objectives are often conflicting, the tal… view at source ↗
Figure 58
Figure 58. Figure 58: Sándor Fekete an overview of algorithmic methods for reconfiguring large swarms of ob￾jects under constraints on coordi￾nation, communication, and connec￾tivity. The talk addressed a broad spectrum of scenarios, ranging from small-scale systems to extremely large swarms, and highlighted the chal￾lenges of achieving efficient collective behavior in high-dimensional settings [61]. Starting from fundamental … view at source ↗
Figure 59
Figure 59. Figure 59 [PITH_FULL_IMAGE:figures/full_fig_p060_59.png] view at source ↗
Figure 60
Figure 60. Figure 60 [PITH_FULL_IMAGE:figures/full_fig_p061_60.png] view at source ↗
Figure 61
Figure 61. Figure 61 [PITH_FULL_IMAGE:figures/full_fig_p062_61.png] view at source ↗
Figure 62
Figure 62. Figure 62 [PITH_FULL_IMAGE:figures/full_fig_p063_62.png] view at source ↗
Figure 63
Figure 63. Figure 63: Saikat Guha talk addressing the challenge of dis￾tributing high-quality entanglement over long distances in quantum com￾munication networks. Entanglement distribution is a fundamental resource for quantum key distribution, dis￾tributed quantum computing, and quantum sensing. However, optical losses and noise in long-distance chan￾nels significantly degrade entangle￾ment and limit the achievable commu￾nica… view at source ↗
Figure 64
Figure 64. Figure 64: Rawad Bitar secure and private federated learn￾ing with low communication over￾head, focusing on cryptographic and information-theoretic techniques that reduce the number of transmitted bits while maintaining privacy, robustness, and model utility. Federated learning has emerged as a ubiquitous paradigm for train￾ing a central model on data gener￾ated and owned by multiple partici￾pating users. Despite it… view at source ↗
Figure 65
Figure 65. Figure 65 [PITH_FULL_IMAGE:figures/full_fig_p066_65.png] view at source ↗
Figure 66
Figure 66. Figure 66: Igor Bjelaković recent results on physical-layer se￾curity and privacy in quantum and analog communication systems, focus￾ing on classical–quantum (cq) wire￾tap channels and secure over-the-air computation. The motivation stems from quantum side-channel attacks, where physical processes such as pho￾ton emissions from electronic devices can leak information that can be mod￾eled as cq bosonic channels. This… view at source ↗
Figure 67
Figure 67. Figure 67 [PITH_FULL_IMAGE:figures/full_fig_p068_67.png] view at source ↗
Figure 68
Figure 68. Figure 68: Aydin Sezgin a talk discussing how emerging pro￾grammable radio technologies can strengthen security mechanisms di￾rectly at the physical layer of wire￾less systems. Physical layer security exploits the inherent randomness of wireless channels to protect confi￾dential communication against eaves￾dropping, providing an alternative or complement to conventional crypto￾graphic methods. The talk focused on th… view at source ↗
Figure 69
Figure 69. Figure 69 [PITH_FULL_IMAGE:figures/full_fig_p070_69.png] view at source ↗
Figure 70
Figure 70. Figure 70 [PITH_FULL_IMAGE:figures/full_fig_p071_70.png] view at source ↗
Figure 71
Figure 71. Figure 71: Paolo Santini recent advances in code-based post￾quantum cryptography, focusing on LDPC and QC-MDPC codes and the challenge of decoding failures in the McEliece framework. Post-quantum cryptography aims to develop cryp￾tographic systems that remain secure against both classical and quantum adversaries, and coding-theoretic con￾structions constitute one of the main candidate approaches [115,116]. BIKE is a… view at source ↗
Figure 72
Figure 72. Figure 72 [PITH_FULL_IMAGE:figures/full_fig_p073_72.png] view at source ↗
Figure 73
Figure 73. Figure 73 [PITH_FULL_IMAGE:figures/full_fig_p074_73.png] view at source ↗
Figure 74
Figure 74. Figure 74 [PITH_FULL_IMAGE:figures/full_fig_p075_74.png] view at source ↗
Figure 75
Figure 75. Figure 75 [PITH_FULL_IMAGE:figures/full_fig_p076_75.png] view at source ↗
Figure 76
Figure 76. Figure 76 [PITH_FULL_IMAGE:figures/full_fig_p077_76.png] view at source ↗
Figure 77
Figure 77. Figure 77 [PITH_FULL_IMAGE:figures/full_fig_p078_77.png] view at source ↗
Figure 78
Figure 78. Figure 78 [PITH_FULL_IMAGE:figures/full_fig_p079_78.png] view at source ↗
Figure 79
Figure 79. Figure 79: Boulat Bash work on the emulation of entan￾glement distribution networks using quantum computers, with the goal of supporting distributed quantum com￾puting across multiple quantum pro￾cessing units (QPUs). Current quan￾tum computers are largely limited to local operations with classical com￾munication (LOCC), which restricts the direct implementation of large￾scale distributed quantum algorithms. The pre… view at source ↗
read the original abstract

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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 0 minor

Summary. The manuscript is a conference report on the Foundations of Future Communication Systems (FFCS) event. It compiles the abstracts of all invited talks, contributed presentations, and poster contributions, covering research in information theory, quantum communication, molecular communication, semantic communication, and secure network design. Key themes include identification-based communication, entanglement-assisted networks, semantic and goal-oriented communication, coding for molecular and nanoscale systems, secure authentication, and information-theoretic limits of novel physical-layer architectures under realistic constraints.

Significance. If the compilation is complete and accurate, the report serves as a useful archival record documenting the breadth of current work on post-Shannon paradigms and physically grounded communication models. It highlights the shift toward reliability, semantics, resource efficiency, and trust in heterogeneous networks. However, as it contains no original derivations, theorems, empirical results, or interpretive synthesis, its contribution is limited to documentation and does not advance the theoretical or experimental state of the art.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their review of our manuscript, which is intended as an archival conference report compiling abstracts from the FFCS event. We address the key points in the report below.

read point-by-point responses

  1. Referee: The manuscript compiles abstracts of invited talks, presentations, and posters but contains no original derivations, theorems, empirical results, or interpretive synthesis.

    Authors: We agree that the manuscript is a compilation of abstracts rather than a vehicle for new theoretical results. Its explicit purpose, as stated in the abstract, is to document the intellectual landscape of the conference, including emerging directions in identification-based communication, semantic communication, quantum networks, and molecular systems. Such reports provide a structured archival record that is otherwise unavailable in a single source. revision: no

  2. Referee: Its contribution is limited to documentation and does not advance the theoretical or experimental state of the art; recommendation is to reject.

    Authors: While we acknowledge the absence of new theorems, the report captures the breadth of post-Shannon paradigms and physically grounded models presented at FFCS. Conference reports of this type serve the community by preserving the full set of contributions (including posters) for future reference, especially in rapidly evolving interdisciplinary areas. We believe this fulfills a legitimate archival function distinct from original research articles. revision: no

Circularity Check

0 steps flagged

No circularity: factual conference report with no derivations or predictions

full rationale

The document is explicitly a conference report whose sole claim is compilation of abstracts from invited talks, presentations, and posters at FFCS. No original theorems, equations, predictions, fitted parameters, or interpretive syntheses are advanced. The text functions purely as an archival listing with no load-bearing assumptions or derivation chain that could reduce to its inputs by construction. No self-citations, ansatzes, or uniqueness claims appear in any scientific argument.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No mathematical derivations, fitted parameters, or new physical entities are introduced; the document rests only on the factual premise that the conference occurred and the abstracts were collected.

pith-pipeline@v0.9.0 · 5539 in / 1004 out tokens · 35026 ms · 2026-05-10T18:38:12.271144+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

170 extracted references · 91 canonical work pages

  1. [1]

    In: Cabello, S., Chen, D.Z

    Abdel-Rahman, A., Becker, A.T., Biediger, D., Cheung, K.C., Fekete, S.P., Gershenfeld, N.A., Hugo, S., Jenett, B., Keldenich, P., Niehs, E., Rieck, C., Schmidt, A., Scheffer, C., Yannuzzi, M.: Space ants: Constructing and recon- figuring large-scale structures with finite automata. In: Cabello, S., Chen, D.Z. (eds.) Symposium on Computational Geometry (So...

    work page doi:10.4230/lipics.socg.2020.73 2020

  2. [2]

    Aghaee, H., Deppe, C., Boche, H.: Network oblivious transfer via noisy broadcast channels (2025),https://arxiv.org/abs/2510.25343

    work page arXiv 2025

  3. [3]

    IEEE Trans

    Ahlswede, R., Han, T.S.: On source coding with side information via a multiple- access channel and related problems in multi-user information theory. IEEE Trans. Inform. Theory29(3), 396–412 (May 1983)

    1983

  4. [4]

    Ahlswede, R., Cai, N.: Arbitrarily varying multiple-access channels. I. Ericson’s symmetrizability is adequate, Gubner’s conjecture is true. IEEE Transactions on Information Theory45(2), 742–749 (1999)

    1999

  5. [5]

    Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryp- tography. ii. cr capacity. IEEE Transactions on Information Theory44(1), 225– 240 (1998).https://doi.org/10.1109/18.651037

    work page doi:10.1109/18.651037 1998

  6. [6]

    Computer Networks254, 110727 (2024).https://doi.org/https://doi.org/10.1016/j.comnet.2024.110727, https://www.sciencedirect.com/science/article/pii/S1389128624005590

    Amiri, Z., Dehdashti, S., El-Safty, K.H., Litvin, I., Munar-Vallespir, P., Nötzel, J., Sekavčnik, S.: Quantum advantages for data transmis- sion in future networks: An overview. Computer Networks254, 110727 (2024).https://doi.org/https://doi.org/10.1016/j.comnet.2024.110727, https://www.sciencedirect.com/science/article/pii/S1389128624005590

    work page doi:10.1016/j.comnet.2024.110727 2024

  7. [7]

    Theoretical Computer Science895, 151–177 (2021).https://doi.org/10.1016/j.tcs.2021.09.041

    Auletta, V., Ferraioli, D., Rai, A., Scarpa, G., Winter, A.: Belief-invariant and quantum equilibria in games of incomplete information. Theoretical Computer Science895, 151–177 (2021).https://doi.org/10.1016/j.tcs.2021.09.041

    work page doi:10.1016/j.tcs.2021.09.041 2021

  8. [9]

    IEEE Wireless Commun

    Bahingayi, E.E., Lin, S., Uysal, M., Di Renzo, M., Tran, L.N.: A refined alter- nating optimization for sum rate maximization in SIM-aided multiuser MISO systems. IEEE Wireless Commun. Lett.15, 1250–1254 (2026)

    2026

  9. [10]

    IEEE Wireless Commun

    Bahingayi, E.E., Stefan Perović, N., Tran, L.N.: Scaling achievable rates in SIM- Aided MIMO systems with metasurface layers: A hybrid optimization framework. IEEE Wireless Commun. Lett.14(9), 2773–2777 (2025)

    2025

  10. [11]

    In: 2025 IEEE International Symposium on Information Theory (ISIT)

    Baldelli, A., Baldi, M., Chiaraluce, F., Santini, P.: Bf-max: an efficient bit flip- ping decoder with predictable decoding failure rate. In: 2025 IEEE International Symposium on Information Theory (ISIT). pp. 1–6. IEEE (2025)

    2025

  11. [12]

    Entropy24(5), 639 (2022).https://doi.org/10

    Barker, T.S., Pierobon, M., Thomas, P.J.: Subjective information and survival in a simulated biological system. Entropy24(5), 639 (2022).https://doi.org/10. 3390/e24050639

    2022

  12. [13]

    IEEE Journal on Selected Areas in Communications31(9), 1921–1930 (2013).https://doi.org/10.1109/JSAC

    Bash, B.A., Goeckel, D., Towsley, D.: Limits of reliable communication with low probability of detection on AWGN channels. IEEE Journal on Selected Areas in Communications31(9), 1921–1930 (2013).https://doi.org/10.1109/JSAC. 2013.130923

    work page doi:10.1109/jsac 1921

  13. [14]

    Deppe, E

    Beck, E.: Advancing Semantic and Digital Communications through Machine Learning, Dissertations from the Department of Communications Engineering, 86 C. Deppe, E. Jorswieck, P-H. Lin, V. Gholamian, M. A. Mross University of Bremen, vol. 15. Shaker Verlag, Düren (Dec 2025).https://doi. org/10.26092/elib/4791

    work page doi:10.26092/elib/4791 2025

  14. [15]

    Zenodo (Feb 2026).https://doi.org/10.5281/zenodo.8006567,https: //github.com/ant-uni-bremen/SINFONY

    Beck, E.: Semantic Information Transmission and Recovery (SINFONY) Software v2.0.2. Zenodo (Feb 2026).https://doi.org/10.5281/zenodo.8006567,https: //github.com/ant-uni-bremen/SINFONY

    work page doi:10.5281/zenodo.8006567 2026

  15. [16]

    Sensors23(14), 6347 (Jul 2023).https://doi.org/10.3390/ s23146347

    Beck, E., Bockelmann, C., Dekorsy, A.: Semantic Information Recovery in Wire- less Networks. Sensors23(14), 6347 (Jul 2023).https://doi.org/10.3390/ s23146347

    2023

  16. [17]

    In: 1st IEEE International Conference on Machine Learning for Communication and Networking (ICMLCN 2024)

    Beck, E., Bockelmann, C., Dekorsy, A.: Model-free Reinforcement Learning of Se- mantic Communication by Stochastic Policy Gradient. In: 1st IEEE International Conference on Machine Learning for Communication and Networking (ICMLCN 2024). pp. 367–373. Stockholm, Sweden (May 2024).https://doi.org/10.1109/ ICMLCN59089.2024.10625190

    work page arXiv 2024

  17. [18]

    IEEE Open Journal of the Communications Society7, 748–768 (Jan 2026).https://doi.org/10.1109/ OJCOMS.2026.3652845

    Beck, E., Lin, H.Y., Rückert, P., Bao, Y., von Helversen, B., Fehrler, S., Tra- cht, K., Dekorsy, A.: Integrating Semantic Communication and Human Decision- Making into an End-to-End Sensing-Decision Framework. IEEE Open Journal of the Communications Society7, 748–768 (Jan 2026).https://doi.org/10.1109/ OJCOMS.2026.3652845

    work page arXiv 2026

  18. [19]

    Natural Computing18(1), 181–201 (2019).https://doi.org/10.1007/S11047-017-9666-6,https://doi

    Becker, A.T., Demaine, E.D., Fekete, S.P., Lonsford, J., Morris-Wright, R.: Par- ticle computation: complexity, algorithms, and logic. Natural Computing18(1), 181–201 (2019).https://doi.org/10.1007/S11047-017-9666-6,https://doi. org/10.1007/s11047-017-9666-6

    work page doi:10.1007/s11047-017-9666-6 2019

  19. [20]

    In: International Conference on Robotics and Automation, ICRA

    Becker, A.T., Demaine, E.D., Fekete, S.P., McLurkin, J.: Particle computa- tion: Designing worlds to control robot swarms with only global signals. In: International Conference on Robotics and Automation, ICRA. pp. 6751–6756 (2014).https://doi.org/10.1109/ICRA.2014.6907856,https://doi.org/10. 1109/ICRA.2014.6907856

    work page doi:10.1109/icra.2014.6907856 2014

  20. [21]

    In: Symposium on Computational Geometry (SoCG)

    Becker, A.T., Demaine, E.D., Fekete, S.P., Shad, H.M., Morris-Wright, R.: Tilt: The video - designing worlds to control robot swarms with only global sig- nals. In: Symposium on Computational Geometry (SoCG). pp. 16–18 (2015). https://doi.org/10.4230/LIPICS.SOCG.2015.16,https://doi.org/10.4230/ LIPIcs.SOCG.2015.16

    work page doi:10.4230/lipics.socg.2015.16 2015

  21. [22]

    Sundaresan, J

    Becker, A.T., Fekete, S.P., Huang, L., Keldenich, P., Kleist, L., Krupke, D., Rieck, C., Schmidt, A.: Targeted drug delivery: Algorithmic methods for collecting a swarm of particles with uniform, external forces. In: In- ternational Conference on Robotics and Automation (ICRA). pp. 2508– 2514 (2020).https://doi.org/10.1109/ICRA40945.2020.9196551,https:// ...

    work page doi:10.1109/icra40945.2020.9196551 2020

  22. [23]

    In: Symposium on Computational Ge- ometry (SoCG)

    Becker, A.T., Fekete, S.P., Keldenich, P., Konitzny, M., Lin, L., Scheffer, C.: Coordinated motion planning: The video. In: Symposium on Computational Ge- ometry (SoCG). pp. 74:1–74:6 (2018).https://doi.org/10.4230/LIPICS.SOCG. 2018.74,https://doi.org/10.4230/LIPIcs.SoCG.2018.74

    work page doi:10.4230/lipics.socg 2018

  23. [24]

    Algorithmica82(2), 165–187 (2020).https://doi.org/ 10.1007/S00453-018-0483-9,https://doi.org/10.1007/s00453-018-0483-9

    Becker, A.T., Fekete, S.P., Keldenich, P., Krupke, D., Rieck, C., Scheffer, C., Schmidt, A.: Tilt assembly: Algorithms for micro-factories that build objects with uniform external forces. Algorithmica82(2), 165–187 (2020).https://doi.org/ 10.1007/S00453-018-0483-9,https://doi.org/10.1007/s00453-018-0483-9

    work page doi:10.1007/s00453-018-0483-9 2020

  24. [25]

    3329211 Foundations of Future Communication Systems 87

    Besser, K.L., Schaefer, R.F., Poor, H.V.: Reliability and latency analysis for wire- lesscommunicationsystemswithasecret-keybudget.IEEETransactionsonCom- munications72(2), 1033–1044 (2 2024).https://doi.org/10.1109/TCOMM.2023. 3329211 Foundations of Future Communication Systems 87

    work page doi:10.1109/tcomm.2023 2024

  25. [26]

    IEEE Transactions on Communications 73(11), 12473–12486 (11 2025).https://doi.org/10.1109/TCOMM.2025.3577649

    Besser, K.L., Schaefer, R.F., Poor, H.V.: Building resilience in wireless communi- cation systems with a secret-key budget. IEEE Transactions on Communications 73(11), 12473–12486 (11 2025).https://doi.org/10.1109/TCOMM.2025.3577649

    work page doi:10.1109/tcomm.2025.3577649 2025

  26. [27]

    IEEE Transactions on Information Theory70(7), 4655–4666 (Jul 2024)

    Bhattacharya, S., Narayan, P.: Shared information for a markov chain on a tree. IEEE Transactions on Information Theory70(7), 4655–4666 (Jul 2024)

    2024

  27. [28]

    In: Proc

    Boche, H., Pohl, V., Poor, H.V.: On the convexification of non-linear optimization problems under performance guarantees. In: Proc. 64th IEEE Conf. on Decision and Control (CDC). Rio de Janeiro, Brazil (Dec 2025)

    2025

  28. [29]

    H.et al.Dynamically controlled charge sensing of a few-electron silicon quantum dot.AIP Advances1, 042111 (2011)

    Boche, H., Cai, M., Deppe, C., Nötzel, J.: Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks. Journal of Mathematical Physics58(10), 102203 (10 2017).https://doi.org/10.1063/1. 5005947,https://doi.org/10.1063/1.5005947

    work page doi:10.1063/1 2017

  29. [30]

    Boche, H., Grigorescu, A., Schaefer, R.F., Poor, H.V.: Characterization of the arithmetic complexity of the secrecy capacity of fast-fading gaussian channels (2025),https://arxiv.org/abs/2501.11636

    work page arXiv 2025

  30. [31]

    In: IEEE Information Theory Workshop (ITW) (2023)

    Bouette, C., Luzzi, L., Wang, L.: Covert communication over two types of additive noise channels. In: IEEE Information Theory Workshop (ITW) (2023)

    2023

  31. [32]

    IEEE Transactions on Information Theory (2025)

    Bouette, C., Luzzi, L., Wang, L.: Covert communication over additive-noise chan- nels. IEEE Transactions on Information Theory (2025)

    2025

  32. [33]

    In: Symposium on Computational Geometry (SoCG)

    Bourgeois, J., Fekete, S.P., Kosfeld, R., Kramer, P., Piranda, B., Rieck, C., Schef- fer, C.: Space ants: Episode II - coordinating connected catoms. In: Symposium on Computational Geometry (SoCG). pp. 65:1–65:6 (2022).https://doi.org/10. 4230/LIPICS.SOCG.2022.65,https://doi.org/10.4230/LIPIcs.SoCG.2022.65

    work page doi:10.4230/lipics.socg.2022.65 2022

  33. [34]

    In: IEEE Global Communications Conference (GLOBECOM)

    Brand, L., Wang, Y., Magarini, M., Schober, R., Lotter, S.: Semantic informa- tion in molecular communication: Chemotaxis beyond shannon. In: IEEE Global Communications Conference (GLOBECOM). IEEE (2024)

    2024

  34. [35]

    In: 57th Asilomar Conference on Signals, Systems, and Computers

    Brune, J.J., Frey, M., Klement, F., Bjelaković, I., Katzenbeisser, S., Stańczak, S.: Private and secure over-the-air multi-party communication. In: 57th Asilomar Conference on Signals, Systems, and Computers. pp. 1697–1701 (2023).https: //doi.org/10.1109/IEEECONF59524.2023.10477045

    work page doi:10.1109/ieeeconf59524.2023.10477045 2023

  35. [36]

    submitted (2026)

    Bruno, R., Rescigno, A., Vaccaro, U.: Robust shift-invariant superimposed codes. submitted (2026)

    2026

  36. [37]

    IEEE Transactions on Information Theory52(2), 489–509 (2006)

    Candès, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory52(2), 489–509 (2006)

    2006

  37. [38]

    npj Quantum Information10, 7 (2024)

    Chaturvedi, A., Viola, G., Pawłowski, M.: Extending loophole-free nonlocal cor- relations to arbitrarily large distances. npj Quantum Information10, 7 (2024). https://doi.org/10.1038/s41534-023-00799-1

    work page doi:10.1038/s41534-023-00799-1 2024

  38. [39]

    In: Deppe, C., Winter, A., Yeung, R.W., Boche, H., Althöfer, I., Stoye, J., Tamm, U., Ezzine, R

    Chen, Y., Hayashi, M.: Adaptive coding for two-way wiretap channel under strong secrecy. In: Deppe, C., Winter, A., Yeung, R.W., Boche, H., Althöfer, I., Stoye, J., Tamm, U., Ezzine, R. (eds.) Information Theory and Related Fields: Festschrift in Memory of Ning Cai. pp. 243–273. Springer Nature Switzerland, Cham (2025)

    2025

  39. [40]

    In: ICC 2025-IEEE Interna- tional Conference on Communications

    Chen, Y., Boche, H., Oechtering, T.J., Skoglund, M.: Integrated sensing and com- munication with distributed rate-limited helpers. In: ICC 2025-IEEE Interna- tional Conference on Communications. pp. 3723–3728. IEEE (2025)

    2025

  40. [41]

    IEEE Transactions on Information Theory70(5), 3499–3511 (2024)

    Cheng, H.C., Gao, L.: Error exponent and strong converse for quantum soft cov- ering. IEEE Transactions on Information Theory70(5), 3499–3511 (2024)

    2024

  41. [42]

    Wiley, Hoboken, NJ, USA, 2 edn

    Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Hoboken, NJ, USA, 2 edn. (2006)

    2006

  42. [43]

    IEEE Trans

    Csiszár, I., Narayan, P.: Secrecy capacities for multiple terminals. IEEE Trans. Inf. Theory50, 3047–3061 (2004).https://doi.org/10.1109/TIT.2004.838380 88 C. Deppe, E. Jorswieck, P-H. Lin, V. Gholamian, M. A. Mross

    work page doi:10.1109/tit.2004.838380 2004

  43. [44]

    IEEE Transac- tions on Information Theory50(12), 3047–3061 (Dec 2004)

    Csiszár, I., Narayan, P.: Secrecy capacities for multiple terminals. IEEE Transac- tions on Information Theory50(12), 3047–3061 (Dec 2004)

    2004

  44. [45]

    IEEE Transactions on Information Theory54(6), 2437–2452 (Jun 2008), special Issue on Information Theoretic Security

    Csiszár, I., Narayan, P.: Secrecy capacities for multiterminal channel models. IEEE Transactions on Information Theory54(6), 2437–2452 (Jun 2008), special Issue on Information Theoretic Security

    2008

  45. [46]

    IEEE Transactions on Information Theory59(1), 17–31 (Jan 2013)

    Csiszár, I., Narayan, P.: Secrecy generation for multiaccess channel models. IEEE Transactions on Information Theory59(1), 17–31 (Jan 2013)

    2013

  46. [47]

    IEEE Transactions on Information Theory41(1), 26–34 (1995)

    Csiszár, I.: Generalized cutoff rates and Rényi’s information measures. IEEE Transactions on Information Theory41(1), 26–34 (1995)

    1995

  47. [48]

    Cambridge Mathematical Library, Cambridge University Press (2011)

    Csiszár, I., Körner, J.: Information theory: Coding theorems for discrete mem- oryless systems. Cambridge Mathematical Library, Cambridge University Press (2011)

    2011

  48. [49]

    Dalai, M., Fiore, S.D., Rescigno, A.A., Vaccaro, U.: An efficient algorithm for group testing with runlength constraints. Discret. Appl. Math.360, 181– 187 (2025).https://doi.org/10.1016/J.DAM.2024.09.001,https://doi.org/ 10.1016/j.dam.2024.09.001

    work page doi:10.1016/j.dam.2024.09.001 2025

  49. [50]

    Physical Review X11(4), 041016 (2021).https://doi.org/10.1103/PhysRevX.11.041016,https://doi.org/10

    Das, S., Bäuml, S., Winczewski, M., Horodecki, K.: Universal limitations on quantum key distribution over a network. Physical Review X11(4), 041016 (2021).https://doi.org/10.1103/PhysRevX.11.041016,https://doi.org/10. 1103/PhysRevX.11.041016

    work page doi:10.1103/physrevx.11.041016 2021

  50. [51]

    arXiv:2409.05619 (2024), arXiv preprint

    Dasgupta, A., Warsi, N.A., Hayashi, M.: Universal tester for multiple indepen- dence testing and classical-quantum arbitrarily varying multiple access channel. arXiv:2409.05619 (2024), arXiv preprint

    work page arXiv 2024

  51. [52]

    IEEE Transactions on Molecular, Biological andMulti-Scale Communications11(4), 493–499(2025).https://doi

    Debus, L.Y., Wilhelm, M.J., Wolff, H., Wille, L.C.P., Rese, T., Lommel, M., Kirchner, J., Dressler, F.: Blood makes a difference: Experimental evaluation of molecular communication in different fluids. IEEE Transactions on Molecular, Biological andMulti-Scale Communications11(4), 493–499(2025).https://doi. org/10.1109/TMBMC.2025.3602650

    work page doi:10.1109/tmbmc.2025.3602650 2025

  52. [53]

    Demaine, E.D., Fekete, S.P., Keldenich, P., Meijer, H., Scheffer, C.: Coordi- nated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch. SIAM J. Comput.48(6), 1727–1762 (2019).https://doi.org/10.1137/ 18M1194341,https://doi.org/10.1137/18M1194341

    work page doi:10.1137/18m1194341 2019

  53. [54]

    In: Symposium on Computational Geometry (SoCG)

    Demaine, E.D., Fekete, S.P., Keldenich, P., Scheffer, C., Meijer, H.: Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch. In: Symposium on Computational Geometry (SoCG). pp. 29:1–29:15 (2018). https://doi.org/10.4230/LIPICS.SOCG.2018.29,https://doi.org/10.4230/ LIPIcs.SoCG.2018.29

    work page doi:10.4230/lipics.socg.2018.29 2018

  54. [55]

    IEEE Transactions on Information Theory 52(4), 1289–1306 (2006)

    Donoho, D.L.: Compressed sensing. IEEE Transactions on Information Theory 52(4), 1289–1306 (2006)

    2006

  55. [56]

    Kolmogorov-arnold networks (kans) for time series analysis, in: 2024 IEEE Globecom Workshops (GC Wkshps), IEEE

    Eckrich, C., Zoubir, A.M., Jamali, V.: Fronthaul-constrained distributed radar sensing. In: 2024 IEEE Globecom Workshops (GC Wkshps). pp. 1–6 (2024). https://doi.org/10.1109/GCWkshp64532.2024.11100768

    work page doi:10.1109/gcwkshp64532.2024.11100768 2024

  56. [57]

    In: ICML ES-FoMo III: 3rd Workshop on Efficient Systems for Foundation Models (2025)

    Egger, M., Bakshi, M., Bitar, R.: Byzantine-resilient zero-order optimization for scalable federated fine-tuning of large language models. In: ICML ES-FoMo III: 3rd Workshop on Efficient Systems for Foundation Models (2025)

    2025

  57. [58]

    In: 2025 IEEE Information Theory Workshop (ITW)

    Egger, M., Bitar, R.: Private aggregation for byzantine-resilient heterogeneous federated learning. In: 2025 IEEE Information Theory Workshop (ITW). pp. 1–6. IEEE (2025)

    2025

  58. [59]

    Farré, P.J., Schneider, C.A., Deppe, C.: Secure hybrid key growing via coherence witnessing and bipartite encoding (2025),https://arxiv.org/abs/2508.06294 Foundations of Future Communication Systems 89

    work page arXiv 2025

  59. [60]

    Fekete, S., Tessars, C., Schmidt, C., Wegener, A., Fischer, S., Hellbrueck, H.: Method and apparatus for determining a driving strategy (2014), uS Patent 8,666,629

    2014

  60. [61]

    In: Interna- tional Workshop on Combinatorial Algorithms

    Fekete, S.P.: Coordinating swarms of objects at extreme dimensions. In: Interna- tional Workshop on Combinatorial Algorithms. pp. 3–13. Springer (2020)

    2020

  61. [62]

    Algorithmica83(1), 387–412 (2021).https://doi.org/10.1007/ S00453-020-00761-Z,https://doi.org/10.1007/s00453-020-00761-z

    Fekete, S.P., Gmyr, R., Hugo, S., Keldenich, P., Scheffer, C., Schmidt, A.: Cadbots: Algorithmic aspects of manipulating programmable matter with fi- nite automata. Algorithmica83(1), 387–412 (2021).https://doi.org/10.1007/ S00453-020-00761-Z,https://doi.org/10.1007/s00453-020-00761-z

    work page doi:10.1007/s00453-020-00761-z 2021

  62. [63]

    In: Proceedings of the Symposium on Computational Geometry (SoCG) (2026), to appear

    Fekete, S.P., Hoffmann, M., Loi, C.M., Perk, M.: Tracking a set of moving ob- jects with minimal power. In: Proceedings of the Symposium on Computational Geometry (SoCG) (2026), to appear

    2026

  63. [64]

    Fekete, S.P., Keldenich, P., Kosfeld, R., Rieck, C., Scheffer, C.: Connected co- ordinated motion planning with bounded stretch. Auton. Agents Multi Agent Syst.37(2), 43(2023).https://doi.org/10.1007/S10458-023-09626-5,https: //doi.org/10.1007/s10458-023-09626-5

    work page doi:10.1007/s10458-023-09626-5 2023

  64. [65]

    A., 1922, @doi [Philosophical Transactions of the Royal Society of London Series A] 10.1098/rsta.1922.0009 , http://adsabs.harvard.edu/abs/1922RSPTA.222..309F 222, 309

    Fisher, R.A.: On the mathematical foundations of theoretical statistics. Philo- sophical Transactions of the Royal Society of London. Series A222, 309–368 (1922).https://doi.org/10.1098/rsta.1922.0009

    work page doi:10.1098/rsta.1922.0009 1922

  65. [66]

    (eds.): 6G-life: Unveiling the Future of Technological Sovereignty, Sustainability, and Trustworthiness

    Fitzek, F.H.P., Boche, H., Kellerer, W., Seeling, P. (eds.): 6G-life: Unveiling the Future of Technological Sovereignty, Sustainability, and Trustworthiness. Aca- demic Press, 1 edn. (Feb 2026), eBook ISBN: 9780443274114

    2026

  66. [67]

    IEEE Transactions on Information Theory41(5), 1379–1396 (1995).https://doi.org/10.1109/18.412683

    Fossorier, M., Lin, S.: Soft-decision decoding of linear block codes based on or- dered statistics. IEEE Transactions on Information Theory41(5), 1379–1396 (1995).https://doi.org/10.1109/18.412683

    work page doi:10.1109/18.412683 1995

  67. [68]

    IEEE Transactions on Communications (2026),https://arxiv.org/abs/2601

    Fotock, R.K., Zappone, A., Imoize, A.L., Di Renzo, M.: Energy efficiency max- imization of MIMO systems through reconfigurable holographic beamforming. IEEE Transactions on Communications (2026),https://arxiv.org/abs/2601. 00780, submitted

    2026

  68. [69]

    IEEE Wireless Communica- tions Letters (2025)

    Freitas, M.M.M., Buzzi, S., Interdonato, G.: Eliminating phase misalignments in cell-free massive mimo via differential transmission. IEEE Wireless Communica- tions Letters (2025)

    2025

  69. [70]

    IEEE Transactions on Information Theory71(4), 2662–2697 (2025).https://doi.org/10.1109/TIT.2025.3531250

    Frey, M., Bjelaković, I., Nötzel, J., Stańczak, S.: Semantic security with infinite- dimensional quantum eavesdropping channel. IEEE Transactions on Information Theory71(4), 2662–2697 (2025).https://doi.org/10.1109/TIT.2025.3531250

    work page doi:10.1109/tit.2025.3531250 2025

  70. [71]

    Gaedeken, A., Wietfeld, A., Zhao, Y., Deppe, C., Jorswieck, E., Kellerer, W.: A hands-on molecular communication testbed for undergraduate education (2025), https://arxiv.org/abs/2512.01904

    work page arXiv 2025

  71. [72]

    New York: Wiley (1968)

    Gallager, R.G.: Information Theory and Reliable Communication. New York: Wiley (1968)

    1968

  72. [73]

    In: 2026 IEEE Wireless Communications and Networking Conference (WCNC)

    Gholipour, J., Schaefer, R.F., Fettweis, G.P.: Semantic communication: From philosophical conceptions towards a mathematical framework. In: 2026 IEEE Wireless Communications and Networking Conference (WCNC). Kuala Lumpur, Malaysia (Apr 2026)

    2026

  73. [74]

    Gholipour, J., Schaefer, R.F., Fettweis, G.P.: Semantic communication through the lens of context-dependent channel modeling (2026),https://arxiv.org/abs/ 2602.22934

    work page arXiv 2026

  74. [75]

    In: 2025 IEEE International Conference on Communications Workshops (ICC Work- shops)

    Giovannetti, C., Decarli, N., Zanella, A., Dardari, D.: Asymptotic behavior of localization and sensing in the near field of extremely large aperture arrays. In: 2025 IEEE International Conference on Communications Workshops (ICC Work- shops). pp. 330–335. IEEE (2025) 90 C. Deppe, E. Jorswieck, P-H. Lin, V. Gholamian, M. A. Mross

    2025

  75. [76]

    Guha, S.: Structured optical receivers to attain superadditive capacity and the holevo limit. Phys. Rev. Lett.106, 240502 (Jun 2011).https://doi. org/10.1103/PhysRevLett.106.240502,https://link.aps.org/doi/10.1103/ PhysRevLett.106.240502

    work page doi:10.1103/physrevlett.106.240502 2011

  76. [77]

    IEEE Journal on Selected Areas in Communications41(1), 5–41 (2023).https://doi.org/10.1109/JSAC.2022.3223408

    Gündüz, D., Qin, Z., Aguerri, I.E., Dhillon, H.S., Yang, Z., Yener, A., Wong, K.K., Chae, C.B.: Beyond transmitting bits: Context, semantics, and task-oriented com- munications. IEEE Journal on Selected Areas in Communications41(1), 5–41 (2023).https://doi.org/10.1109/JSAC.2022.3223408

    work page doi:10.1109/jsac.2022.3223408 2023

  77. [78]

    IEEE Wireless Com- munications Letters13(10), 2867–2871 (Oct 2024).https://doi.org/10.1109/ LWC.2024.3451139

    Halimi Razlighi, A., Bockelmann, C., Dekorsy, A.: Semantic communication for cooperative multi-task processing over wireless networks. IEEE Wireless Com- munications Letters13(10), 2867–2871 (Oct 2024).https://doi.org/10.1109/ LWC.2024.3451139

    work page arXiv 2024

  78. [79]

    Context-aware set dueling for dynamic policy arbitration,

    Halimi Razlighi, A., Bockelmann, C., Dekorsy, A.: Semantic communication for cooperativemulti-taskingoverrate-limitedwirelesschannelswithimplicitoptimal prior. IEEE Open Journal of the Communications Society6, 8523–8538 (Oct 2025).https://doi.org/10.1109/OJCOMS.2025.3617156

    work page doi:10.1109/ojcoms.2025.3617156 2025

  79. [80]

    In: ICC 2025 - IEEE International Conference on Communications

    Halimi Razlighi, A., Tillmann, M.H.V., Beck, E., Bockelmann, C., Dekorsy, A.: Cooperative and collaborative multi-task semantic communication for distributed sources. In: ICC 2025 - IEEE International Conference on Communications. pp. 3966–3971 (Jun 2025).https://doi.org/10.1109/ICC52391.2025.11161271

    work page doi:10.1109/icc52391.2025.11161271 2025

  80. [81]

    IEEE Trans

    Han, T.S., Kobayashi, K.: A dichotomy of functionsF(X, Y)of correlated sources (X, Y)from the viewpoint of the achievable rate region. IEEE Trans. Inform. Theory33(1), 69–76 (January 1987)

    1987

Showing first 80 references.