IEEE journal on selected areas in information theory最新文献

An End-to-End Coding Scheme for DNA-Based Data Storage With Nanopore-Sequenced Reads 基于dna的数据存储与纳米孔测序读取端到端编码方案

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-19 DOI: 10.1109/JSAIT.2026.3655592

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}

引用次数: 0

Fundamental Limits of Integrated Sensing and Communication Over Interference Channels 干扰信道上集成传感和通信的基本限制

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-12 DOI: 10.1109/JSAIT.2026.3652624

Yao Liu;Min Li;Yanze Han;Lawrence Ong

{"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}

引用次数: 0

2025 Index Journal on Selected Areas in Information Theory 2025信息论选定领域索引期刊

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-09 DOI: 10.1109/JSAIT.2026.3652821

引用次数: 0

Joint Communication and Parameter Estimation in MIMO Channels MIMO信道中的联合通信及参数估计

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-01 Epub Date: 2026-03-19 DOI: 10.1109/JSAIT.2026.3675819

Gökhan Yılmaz;Franz Lampel;Hamdi Joudeh;Giuseppe Caire

引用次数: 0

Efficient Near-Field Channel Feature Estimation: Criteria and Algorithms 有效的近场信道特征估计：准则和算法

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-01 Epub Date: 2025-12-31 DOI: 10.1109/JSAIT.2025.3649807

Hyeonjin Chung;Hanvit Kim;Sunwoo Kim;Andrea Conti;Moe Z. Win

{"title":"Efficient Near-Field Channel Feature Estimation: Criteria and Algorithms","authors":"Hyeonjin Chung;Hanvit Kim;Sunwoo Kim;Andrea Conti;Moe Z. Win","doi":"10.1109/JSAIT.2025.3649807","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3649807","url":null,"abstract":"When the radio signal propagates in the near-field (NF), the distance can be estimated by the curvature of the wavefront. This brings new opportunities for sensing and communication, but a computational burden as well. This paper first establishes a theoretical foundation for computationally efficient NF feature (i.e., angle-of-arrival (AOA) and distance) estimation. We reveal that the computation of feature estimates can be reduced without sacrificing the estimation accuracy, if the distance between the receiver and transmitter (or scatterer) exceeds approximately one quarter of the Rayleigh distance. Based on this criterion, we introduce a zone-wise search-based algorithm that reduces computation by restricting the high-dimensional (HD) search to the angle-distance search space where the criterion is not met. In the other search space, sequential low-dimensional (LD) searches are carried out. Along with the algorithm, the estimation-theoretic analysis for NF feature estimation is provided to present the theoretical performance limit. The simulation results demonstrate that even under severe NF effect, the accuracy of the proposed algorithm reaches that of the HD search-based algorithm, which represents a realistically achievable upper bound. Nevertheless, the computation complexity of the proposed algorithm is significantly lower than the HD search-based algorithm.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"75-90"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147665231","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}

引用次数: 0

Secure Semantic Communication Over Wiretap Channels: Rate-Distortion-Equivocation Tradeoff 窃听信道上的安全语义通信：速率失真-歧义权衡

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-01 Epub Date: 2026-03-23 DOI: 10.1109/JSAIT.2026.3676713

Denis Kozlov;Mahtab Mirmohseni;Rahim Tafazolli

{"title":"Secure Semantic Communication Over Wiretap Channels: Rate-Distortion-Equivocation Tradeoff","authors":"Denis Kozlov;Mahtab Mirmohseni;Rahim Tafazolli","doi":"10.1109/JSAIT.2026.3676713","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3676713","url":null,"abstract":"This paper investigates an information-theoretic model of secure semantic-aware communication. For this purpose, we consider the lossy joint source-channel coding (JSCC) of a memoryless semantic source transmitted over a memoryless wiretap channel. The source consists of two correlated parts that represent semantic and observed aspects of the information. Our model assumes separate fidelity and secrecy constraints on each source component and, in addition, encompasses two cases for the source output, in order to evaluate the performance gains if the encoder has an extended access to the source. Specifically, in Case 1, the encoder has direct access only to the samples from a single (observed) source component, while in Case 2 it has additional direct access to the samples of the underlaying semantic information. We derive single-letter converse and achievability bounds on the rate-distortion-equivocation region. The converse bound explicitly contains rate-distortion functions, making it easy to evaluate, especially for some common distributions. The proposed achievability coding scheme involves novel stochastic superposition coding with two private parts to enable analysis of the equivocation for each source component, separately. Our results generalise some of the previously established source and source-channel coding problems. The general results are further specialised to Gaussian and Bernoulli sources transmitted over Gaussian and binary wiretap channels, respectively. The numerical evaluations illustrate the derived bounds for these distributions.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"120-133"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147796120","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}

引用次数: 0

Fundamental Limits of Learning Under Erasure-Constrained Communication Channels 在擦除约束的通信渠道下学习的基本限制

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-01 Epub Date: 2026-03-25 DOI: 10.1109/JSAIT.2026.3677413

Merve Karakas;Osama Hanna;Lin F. Yang;Christina Fragouli

引用次数: 0

Coherence-Aware Over-the-Air Distributed Learning Under Heterogeneous Link Impairments 异构链路损伤下的相干感知空中分布式学习

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-01 Epub Date: 2026-03-11 DOI: 10.1109/JSAIT.2026.3672794

Mehdi Karbalayghareh;David J. Love;Christopher G. Brinton

{"title":"Coherence-Aware Over-the-Air Distributed Learning Under Heterogeneous Link Impairments","authors":"Mehdi Karbalayghareh;David J. Love;Christopher G. Brinton","doi":"10.1109/JSAIT.2026.3672794","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3672794","url":null,"abstract":"Distributed machine learning (ML) over wireless networks hinges on accurate channel state information (CSI) and efficient exchange of high-dimensional model updates. These demands are governed by channel coherence time and bandwidth, which vary across devices (links) due to heterogeneous mobility and scattering, causing degraded downlink delivery and distorted uplink over-the-air (OTA) aggregation. We propose a coherence-aware federated learning (FL) framework that jointly addresses impairments on downlink and uplink with communication-efficient strategies. In the downlink, we employ product superposition to multiplex global model symbols for long-coherence (static) devices onto the pilot tones required by short-coherence (dynamic) devices for channel estimation, turning pilot overhead into payload while preserving estimation fidelity. In the proposed scheme, an orthogonal frequency-division multiplexing (OFDM) super-block is partitioned into sub-blocks aligned with the smallest coherence time and bandwidth, enabling consistent channel estimation and stabilizing OTA aggregation across heterogeneous devices. Partial model reception at dynamic devices is mitigated via previous local model filling (PLMF), which reuses prior updates. We establish convergence guarantees under heterogeneous link impairments, imperfect CSI, and aggregation noise. The proposed framework enables efficient scheduling under coherence heterogeneity; analysis and experiments demonstrate notable gains in communication efficiency, latency, and learning accuracy over conventional FL baselines.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"46-61"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557852","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}

引用次数: 0

On Gaussian Codes and Mismatched Decoding for Fading MIMO Multiple-Access Channels 衰落MIMO多址信道高斯码与错配译码

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-01 Epub Date: 2026-03-19 DOI: 10.1109/JSAIT.2026.3675858

Mehrangiz Ensan;Hamdi Joudeh;Frans M. J. Willems

引用次数: 0

Array Configuration and Scaling Laws in Near-Field Uplink Multiuser MIMO 近场上行多用户MIMO中的阵列配置和缩放规律

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2026-01-01 Epub Date: 2026-03-17 DOI: 10.1109/JSAIT.2026.3674909

Jiyoung Yun;Wan Choi;Jeffrey G. Andrews

{"title":"Array Configuration and Scaling Laws in Near-Field Uplink Multiuser MIMO","authors":"Jiyoung Yun;Wan Choi;Jeffrey G. Andrews","doi":"10.1109/JSAIT.2026.3674909","DOIUrl":"https://doi.org/10.1109/JSAIT.2026.3674909","url":null,"abstract":"Future wireless networks must deliver high spectral efficiency in dense environments where many users require simultaneous high-rate communication. Higher carrier frequencies offer more bandwidth but suffer from shorter range and lower channel rank, making new capacity enhancing strategies essential. This paper studies joint antenna array design at the base station (BS) and user devices in line-of-sight (LoS) uplink multiuser multiple-input multiple-output (MU-MIMO) systems with the goal of exploiting radiative near-field effects to unlock full multiplexing gains. In particular, we establish a scaling law under which there exist uniform sparse array configurations whose sum rate gap to an interference-free upper bound decays with the number of BS antennas. For dense user deployments beyond this scaling regime, we propose a joint array design algorithm with provable performance guarantees, in which each user array is configured to maximize its single-user achievable rate conditioned on the BS array, followed by non-uniform BS array optimization using a submodular surrogate. Our simulation results verify that uniform sparse arrays achieve the interference-free regime predicted by the scaling law. Outside this regime, the proposed joint design closely tracks the interference-free upper bound, demonstrating the benefit of non-uniform BS array optimization.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"7 ","pages":"62-74"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557873","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}

引用次数: 0