Search

In contrast to Shannon transmission codes, the size of identification (ID) codes for discrete memoryless channels (DMCs) experiences doubly exponential growth with the block length when randomized encoding is used. Additional enhancements within the ID paradigm can be realized through supplementary resources such as quantum entanglement, common randomness (CR), and feedback. Joint transmission and sensing demonstrate significant benefits over separation-based methods. Inspired by the significant impact of feedback on the ID capacity, our work delves into the realm of joint ID and sensing (JIDAS) for state-dependent multiple access channels (SD-MACs) with noiseless strictly casual feedback. Here, the senders aim to convey ID messages to the receiver while simultaneously sensing the channel states. We establish a lower bound on the capacity-distortion region of the SD-MACs. An example shows that JIDAS outperforms the separation-based approach.

We investigate message identification over a K-sender Gaussian multiple access channel (K-GMAC). Unlike conventional Shannon transmission codes, the size of randomized identification (ID) codes experiences a doubly exponential growth in the code length. Improvements in the ID approach can be attained through additional resources such as quantum entanglement, common randomness (CR), and feedback. It has been demonstrated that an infinite capacity can be attained for a single-user Gaussian channel with noiseless feedback, irrespective of the chosen rate scaling. We establish the capacity region of both the K-sender Gaussian multiple access channel (K-GMAC) and the K-sender state-dependent Gaussian multiple access channel (K-SD-GMAC) when strictly causal noiseless feedback is available.

Sadly, our esteemed colleague and friend Ning Cai passed away on 25th May, 2023. In his memory, Ingo Alth\"ofer, Holger Boche, Christian Deppe, Jens Stoye, Ulrich Tamm, Andreas Winter, and Raymond Yeung have organized the "Workshop on Information Theory and Related Fields" at the Bielefeld ZiF (Center for Interdisciplinary Research). This special event will be held from 24th November to 26th November, 2023. The workshop aims to celebrate Ning Cai's remarkable contributions to the field of information theory and to provide a platform for discussing current research in related areas. Ning Cai's work has had a significant impact on many domains, and this gathering will bring together colleagues, collaborators, and young researchers who have been influenced by his pioneering efforts.

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.

CryptoGPT: a 7B model competing with GPT-4 in a specific task -- The Impact of Automatic Annotation and Strategic Fine-Tuning via QLoRAIn this article, we present a method aimed at refining a dedicated LLM of reasonable quality with limited resources in an industrial setting via CryptoGPT. It is an LLM designed for financial news analysis for the cryptocurrency market in real-time. This project was launched in an industrial context. This model allows not only for the classification of financial information but also for providing comprehensive analysis. We refined different LLMs of the same size such as Mistral-7B and LLama-7B using semi-automatic annotation and compared them with various LLMs such as GPT-3.5 and GPT-4. Our goal is to find a balance among several needs: 1. Protecting data (by avoiding their transfer to external servers), 2. Limiting annotation cost and time, 3. Controlling the model's size (to manage deployment costs), and 4. Maintaining better analysis quality., Comment: Journ{\'e}e Nationale sur la Fouille de Textes, Pascal CUXAC; Adrien GUILLE; C{\'e}dric LOPEZ, Jun 2024, Lyon (Universit{\'e} Lumi{\`e}re Lyon 2), France

We investigate the problem of common randomness (CR) generation in the basic two-party communication setting in which a sender and a receiver aim to agree on a common random variable with high probability. The terminals observe independent and identically distributed (i.i.d.) samples of sources with an arbitrary distribution defined on a Polish alphabet and are allowed to communicate as little as possible over a noisy, memoryless channel. We establish single-letter upper and lower bounds on the CR capacity for the specified model. The derived bounds hold with equality except for at most countably many points where discontinuity issues might arise., Comment: arXiv admin note: text overlap with arXiv:2210.04556

Numerous applications in the field of molecular communications (MC) such as healthcare systems are often event-driven. The conventional Shannon capacity may not be the appropriate metric for assessing performance in such cases. We propose the identification (ID) capacity as an alternative metric. Particularly, we consider randomized identification (RI) over the discrete-time Poisson channel (DTPC), which is typically used as a model for MC systems that utilize molecule-counting receivers. In the ID paradigm, the receiver's focus is not on decoding the message sent. However, he wants to determine whether a message of particular significance to him has been sent or not. In contrast to Shannon transmission codes, the size of ID codes for a Discrete Memoryless Channel (DMC) grows doubly exponentially fast with the blocklength, if randomized encoding is used. In this paper, we derive the capacity formula for RI over the DTPC subject to some peak and average power constraints. Furthermore, we analyze the case of state-dependent DTPC.

In the identification (ID) scheme proposed by Ahlswede and Dueck, the receiver only checks whether a message of special interest to him has been sent or not. In contrast to Shannon transmission codes, the size of ID codes for a Discrete Memoryless Channel (DMC) grows doubly exponentially fast with the blocklength, if randomized encoding is used. This groundbreaking result makes the ID paradigm more efficient than the classical Shannon transmission in terms of necessary energy and hardware components. Further gains can be achieved by taking advantage of additional resources such as feedback. We study the problem of joint ID and channel state estimation over a DMC with independent and identically distributed (i.i.d.) state sequences. The sender simultaneously sends an ID message over the DMC with a random state and estimates the channel state via a strictly causal channel output. The random channel state is available to neither the sender nor the receiver. For the proposed system model, we establish a lower bound on the ID capacity-distortion function.

We study a standard two-source model for common randomness (CR) generation in which Alice and Bob generate a common random variable with high probability of agreement by observing independent and identically distributed (i.i.d.) samples of correlated sources on countably infinite alphabets. The two parties are additionally allowed to communicate as little as possible over a noisy memoryless channel. In our work, we give a single-letter formula for the CR capacity for the proposed model and provide a rigorous proof of it. This is a challenging scenario because some of the finite alphabet properties, namely of the entropy can not be extended to the countably infinite case. Notably, it is known that the Shannon entropy is in fact discontinuous at all probability distributions with countably infinite support., Comment: arXiv admin note: text overlap with arXiv:2201.11078

The composition the atmosphere of Venus results from the integration of many processes entering into play over the entire geological history of the planet. Determining the elemental abundances and isotopic ratios of noble gases (He, Ne, Ar, Kr, Xe) and stable isotopes (H, C, N, O, S) in the Venus atmosphere is a high priority scientific target since it could open a window on the origin and early evolution of the entire planet. This chapter provides an overview of the existing dataset on noble gases and stable isotopes in the Venus atmosphere. The current state of knowledge on the origin and early and long-term evolution of the Venus atmosphere deduced from this dataset is summarized. A list of persistent and new unsolved scientific questions stemming from recent studies of planetary atmospheres (Venus, Earth and Mars) are described. Important mission requirements pertaining to the measurement of volatile elements in the atmosphere of Venus as well as potential technical difficulties are outlined., Comment: 40 pages, 10 figures, 1 table

It is widely agreed that phase change materials (PCMs) are of high interest for sustainable energy future. Many of the applications require anti-leakage properties of PCM, that can be accomplished through PCM encapsulation. In this study, scalable and considerably simplified approach based on the microfluidics principles was successfully designed for polyvinylidene fluoride (PVDF) hollow- and for leakage-free paraffin-core/PVDF-sheath fibers production. The required device can be as simple as syringe+tube+glass capillary. The fibers were created by PVDF/N,NDimethylformamide (DMF) solution and PVDF/DMF/paraffin emulsion injection in water followed by solvent extraction process. The proposed approach results in a hollow PVDF or PVDF/paraffin composite fibers with the PCM content between 32-47.5% according to DSC and TGA measurements. SEM study of the fibers morphology has shown that PCM is in the form of slugs along the fibers. Such PCM distribution is maintained until the first melting cycle. Later, molten PCM spreads within the fiber under capillary forces that was captured by infrared camera. Elastic modules and stress vs. strain were measured to characterise mechanical properties of designed fibers. Finally, the composite fibers have shown outstanding retention capacity with only 3.5% of PCM mass loose after 1000 melting/crystallisation cycles., Comment: 16 pages, 10 figures