Lorenz Welter;Roman Sokolovskii;Thomas Heinis;Antonia Wachter-Zeh;Eirik Rosnes;Alexandre Graell i Amat
{"title":"An End-to-End Coding Scheme for DNA-Based Data Storage With Nanopore-Sequenced Reads","authors":"Lorenz Welter;Roman Sokolovskii;Thomas Heinis;Antonia Wachter-Zeh;Eirik Rosnes;Alexandre Graell i Amat","doi":"10.1109/JSAIT.2026.3655592","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3655592","url":null,"abstract":"We consider error-correcting coding for deoxyribonucleic acid (DNA)-based storage using nanopore sequencing. We model the DNA storage channel as a sampling noise channel where the input data is chunked into <inline-formula> <tex-math>$M$ </tex-math></inline-formula> short DNA strands, which are copied a random number of times, and the channel outputs a random selection of <inline-formula> <tex-math>$N$ </tex-math></inline-formula> noisy DNA strands. The retrieved DNA reads are prone to strand-dependent insertion, deletion, and substitution (IDS) errors. We construct an index-based concatenated coding scheme, i.e., the concatenation of an outer code, an index code, and an inner code. We further propose a low-complexity (linear in <inline-formula> <tex-math>$N$ </tex-math></inline-formula>) maximum a posteriori probability decoder that takes into account the strand-dependent IDS errors and the randomness of the drawing to infer symbolwise a posteriori probabilities for the outer decoder. We present Monte-Carlo simulations for information-outage probabilities and frame error rates for different channel setups on experimental data. We finally evaluate the overall system performance using the read/write cost trade-off. A powerful combination of tailored channel modeling and soft information processing allows us to achieve excellent performance even with error-prone nanopore-sequenced reads outperforming state-of-the-art schemes.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"17-32"},"PeriodicalIF":2.2,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147299526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fundamental Limits of Integrated Sensing and Communication Over Interference Channels","authors":"Yao Liu;Min Li;Yanze Han;Lawrence Ong","doi":"10.1109/JSAIT.2026.3652624","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3652624","url":null,"abstract":"This paper focuses on integrated sensing and communication (ISAC) over interference channels. An information-theoretic modeling, where two interfering ISAC base stations (BSs) seek to communicate with their users while performing sensing estimation through received echo signals, is proposed. For the model considered, we establish both inner and outer bounds for the capacity-distortion region, with capacity and sensing distortion as the key performance metrics for communication and sensing, respectively. As for the inner bound, an achievable scheme utilizing superposition coding and joint compression of past transmitted codewords and echo signals is developed, and the corresponding achievable rate-distortion region is derived. The proposed outer bound is based on the ideas of cut-set bound on communication rate and rate-limited constraints on sensing distortion. Several numerical examples are constructed to illustrate the advantages of our proposed scheme. Our results highlight that interference links, in conjunction with echo signals, can be strategically leveraged to achieve unified cooperative sensing and communication between the two BS-user pairs.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"1-15"},"PeriodicalIF":2.2,"publicationDate":"2026-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146162236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"2025 Index Journal on Selected Areas in Information Theory","authors":"","doi":"10.1109/JSAIT.2026.3652821","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3652821","url":null,"abstract":"","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"470-478"},"PeriodicalIF":2.2,"publicationDate":"2026-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11344831","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145929578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Semantic Rate Distortion and Posterior Design: Compute Constraints, Multimodality, and Strategic Inference","authors":"Emrah Akyol","doi":"10.1109/JSAIT.2026.3699650","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3699650","url":null,"abstract":"We study strategic Gaussian semantic compression under rate and compute constraints, where an encoder and a decoder optimize distinct quadratic objectives. A latent Gaussian state generates a task-dependent semantic variable, and the decoder best responds via MMSE estimation, reducing the encoder’s problem to posterior covariance design under an information-rate constraint. We characterize the strategic rate-distortion function in direct, remote, and full-information regimes, derive semantic waterfilling and rate-constrained Gaussian persuasion solutions, and establish Gaussian optimality under misaligned objectives. We then show how these theoretical results govern scaling phenomena. When the encoder observes only imperfect semantic proxies, multimodal observations improve performance by recovering a larger component of the accessible proxy and can drive distortion to the remote benchmark. When architectural depth or inference-time reasoning is modeled as a sequence of per-step information budgets, the induced remote benchmark has excess distortion above the remote infinite-rate floor that decays exponentially in the total budget. Together, these results separate modern AI bottlenecks and offer a principled information-theoretic lens on modern multimodal language models as posterior-design mechanisms under resource constraints.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"246-262"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148236228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"AI/ML-Based Joint Source and Channel Coding for HARQ-ACK Payload","authors":"Akash Doshi;Pinar Sen;Kirill Ivanov;Wei Yang;June Namgoong;Runxin Wang;Rachel Wang;Taesang Yoo;Jing Jiang;Tingfang Ji","doi":"10.1109/JSAIT.2026.3695756","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3695756","url":null,"abstract":"Channel coding from 2G to 5G has assumed the inputs bits at the physical layer to be uniformly distributed. However, hybrid automatic repeat request acknowledgement (HARQ-ACK) bits transmitted in the uplink are inherently non-uniformly distributed. For such sources, significant performance gains could be obtained by employing joint source channel coding, aided by deep learning-based techniques. In this paper, we learn a transformer-based encoder using a novel “free-lunch” training algorithm and propose per-codeword power shaping to exploit the source prior at the encoder whilst being robust to small changes in the HARQ-ACK distribution. Furthermore, any HARQ-ACK decoder has to achieve a low negative acknowledgement (NACK) error rate to avoid radio link failures resulting from multiple NACK errors. We develop an extension of the Neyman-Pearson test to a coded bit system with multiple information bits to achieve Unequal Error Protection of NACK over ACK bits at the decoder. Finally, we apply the proposed encoder and decoder designs to a 5G New Radio (NR) compliant uplink setup under a fading channel, describing the optimal receiver design and a low complexity coherent approximation to it. Our results demonstrate 3–6 dB reduction in the average transmit power required to achieve the target error rates compared to the NR baseline, while also achieving a 2–3 dB reduction in the maximum transmit power, thus providing for significant coverage gains and power savings.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"229-245"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148171638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Active Sampling and Gaussian Reconstruction for Radio-Frequency Radiance Field","authors":"Chi-Shiang Gau;Xingyu Chen;Wuqiong Zhao;Xinyu Zhang;Tara Javidi","doi":"10.1109/JSAIT.2026.3688148","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3688148","url":null,"abstract":"Reconstructing Radio-Frequency (RF) Radiance Fields is essential for modeling signal propagation in wireless systems but remains challenging due to complex wave phenomena such as reflection, scattering, and diffraction—particularly when the environment’s geometry and material properties are unknown. Recent neural approaches, such as NeRF2, employ large differentiable models for RF reconstruction but require dense spatial sampling and compute-intensive per-environment training, limiting their practicality in dynamic or quasi-static scenarios. We propose a training-free, physics-assisted alternative based on a Gaussian Process (GP) with an adaptive spatio-temporal kernel, whose hyperparameters are estimated via maximum likelihood. Our model incorporates prior physical knowledge by representing the received signal as a linear combination of rays from different angles, allowing the GP to implicitly capture the spatial structure of the RF field in a physics-assisted manner. The kernel captures local structural and temporal patterns, while the GP framework naturally provides predictive uncertainty. Posterior variance guides active sampling, prioritizing regions of high information content to efficiently collect the most informative measurements. Experiments show that our method substantially reduces the number of required RF observations while maintaining high reconstruction fidelity, enabling real-time adaptation in dynamic environments and offering a scalable, data-efficient solution for RF field estimation.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"313-322"},"PeriodicalIF":2.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148481022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Thermodynamic Characterization of Message-Passing: Framework and Initial Study","authors":"Kalana G. Abeywardena;Stark C. Draper","doi":"10.1109/JSAIT.2026.3722113","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3722113","url":null,"abstract":"We study the thermodynamic efficiency of message-passing decoders using the mismatch cost framework. This framework quantifies the excess entropy generated when a system operates away from the thermodynamically optimal initial distribution. It provides a computable lower bound on irrecoverable energy loss. The decoder is modeled as a main decoding program with local message updates implemented as subroutines. Memory is treated as an external copying subsystem whose thermodynamic cost is excluded. Studying the <inline-formula> <tex-math>$[{7,4}]$ </tex-math></inline-formula> Hamming code transmitted over a binary erasure channel, we show how the channel-induced initialization statistics and the step-wise evolution of the algorithmic state distribution during decoding determine the total mismatch cost. We further show that different thermodynamically optimal state distributions, representing different underlying physical implementations of the decoder, can produce different thermodynamic costs for identical decoding dynamics. Conditioning the input distribution on correctable and non-correctable erasure patterns further reveals distinct thermodynamic signatures. These results demonstrate that thermodynamic cost is jointly governed by decoding dynamics, input statistics, and hardware characteristics. This points to opportunities for thermodynamically informed decoder design to realize energy-efficient physical implementations.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"396-410"},"PeriodicalIF":2.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148781113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Covert Capacity-Key Tradeoff Over Discrete Memoryless Networks","authors":"Abdelaziz Bounhar;Mireille Sarkiss;Michèle Wigger","doi":"10.1109/JSAIT.2026.3696919","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3696919","url":null,"abstract":"This paper characterizes the covert capacity-key tradeoffs for discrete memoryless channels (DMC) and discrete memoryless multiple-access channels (DMMAC). The focus is on channels where communication rates are measured as the number of transmitted bits divided by the square-root of the blocklength and by the square-root of the covertness constraint. Previous results had determined the largest achievable covert rates for these channels, as well as the minimum key rates required to achieve these largest covert rates. In this work, we additionally determine the minimum key rates required at reduced covert rates. Stated differently, we determine the set of all covert rates that are achievable for a given set of key rates. This is termed the covert capacity-key tradeoff. Our results on the covert capacity-key tradeoffs over DMCs and DMMACs show that for small key rates and when the adversary observes the inputs through a better channel than the legitimate receiver, binary signalling at all transmitters is optimal even for larger input alphabets and the capacity-key tradeoff grows linearly. Moreover, in this regime the covert capacity-key tradeoff of DMMACs is square implying that each of the transmitters can simultaneously achieve its own largest covert rate depending only on its own available key rate, irrespective of the other transmitter. For larger key rates or when the adversary is not uniformly stronger than the legitimate receiver over all inputs, the covert capacity-key tradeoff region of DMMACs is non-square and a tradeoff arises between the rates of the various transmitters.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"323-332"},"PeriodicalIF":2.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11535399","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148626500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DRIP: A Versatile Family of Space–Time ISAC Discrete-Time Sequences","authors":"Dexin Wang;Ahmad Bazzi;Marwa Chafii","doi":"10.1109/JSAIT.2026.3694721","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3694721","url":null,"abstract":"The following paper introduces Dual beam-similarity awaRe Integrated sensing and communications (ISAC) with controlled Peak-to-average power ratio (DRIP) discrete-time sequences. DRIP is a novel family of space-time ISAC discrete-time sequences designed for dynamic peak-to-average power ratio (PAPR) adjustment. The proposed DRIP sequences are designed to conform to specified PAPR levels while exhibiting beampattern properties, effectively targeting multiple desired directions and suppressing interference for multi-target sensing applications, while closely resembling radar chirps. For communication purposes, the proposed DRIP sequences aim to minimize multi-user interference across various constellations. Addressing the non-convexity of the optimization framework required for generating DRIP sequences, we introduce a block cyclic coordinate descent algorithm. This iterative approach ensures convergence to an optimal ISAC sequence solution. Simulation results validate the DRIP waveforms’ superior performance, versatility, and favorable ISAC trade-offs, highlighting their potential in advanced multi-target sensing and communication systems.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"205-220"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148171640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Joint Communication and Parameter Estimation in MIMO Channels","authors":"Gökhan Yılmaz;Franz Lampel;Hamdi Joudeh;Giuseppe Caire","doi":"10.1109/JSAIT.2026.3675819","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3675819","url":null,"abstract":"We study a joint communication and sensing setting comprising a transmitter, a receiver, and a sensor, all equipped with multiple antennas. The transmitter sends an encoded signal over the channel with the dual purpose of communicating an information message to the receiver, and enabling the sensor to estimate a target parameter vector by generating back-scattered signals. We assume that the transmitter and sensor are co-located, or fully connected, giving the latter access to the transmitted signal. The target parameter vector is randomly drawn from a continuous distribution, yet remains fixed throughout the transmission block. We establish the fundamental performance trade-off between the communication and sensing tasks, captured in terms of a capacity-MSE function. In doing so, we identify optimal coding schemes for this multi-antenna joint communication and sensing setting. Moreover, we particularize our result to two practically-inspired scenarios where we showcase optimal schemes and trade-offs.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"91-105"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147665229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}