Pub Date : 2025-02-20DOI: 10.1109/TIT.2025.3539816
{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2025.3539816","DOIUrl":"https://doi.org/10.1109/TIT.2025.3539816","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10896911","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-20DOI: 10.1109/TIT.2025.3539818
{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2025.3539818","DOIUrl":"https://doi.org/10.1109/TIT.2025.3539818","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10896626","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-27DOI: 10.1109/TIT.2025.3534327
Dávid Bugár;Péter Vrana
This paper explores the trade-off relation between the rate and the strong converse exponent for asymptotic LOCC transformations between pure multipartite states. Any single-copy probabilistic transformation between a pair of states implies that an asymptotic transformation at rate 1 is possible with an exponentially decreasing success probability. However, it is possible that an asymptotic transformation is feasible with nonzero probability, but there is no transformation between any finite number of copies with the same rate, even probabilistically. In such cases it is not known if the optimal success probability decreases exponentially or faster. A fundamental tool for showing the feasibility of an asymptotic transformation is degeneration. Any degeneration gives rise to a sequence of stochastic LOCC transformations from copies of the initial state plus a sublinear number of GHZ states to the same number of copies of the target state. These protocols involve parameters that can be freely chosen, but the choice affects the success probability. In this paper, we characterize an asymptotically optimal choice of the parameters and derive a single-letter expression for the error exponent of the resulting protocol. In particular, this implies an exponential lower bound on the success probability when the stochastic transformation arises from a degeneration.
{"title":"Error Exponents for Entanglement Transformations From Degenerations","authors":"Dávid Bugár;Péter Vrana","doi":"10.1109/TIT.2025.3534327","DOIUrl":"https://doi.org/10.1109/TIT.2025.3534327","url":null,"abstract":"This paper explores the trade-off relation between the rate and the strong converse exponent for asymptotic LOCC transformations between pure multipartite states. Any single-copy probabilistic transformation between a pair of states implies that an asymptotic transformation at rate 1 is possible with an exponentially decreasing success probability. However, it is possible that an asymptotic transformation is feasible with nonzero probability, but there is no transformation between any finite number of copies with the same rate, even probabilistically. In such cases it is not known if the optimal success probability decreases exponentially or faster. A fundamental tool for showing the feasibility of an asymptotic transformation is degeneration. Any degeneration gives rise to a sequence of stochastic LOCC transformations from copies of the initial state plus a sublinear number of GHZ states to the same number of copies of the target state. These protocols involve parameters that can be freely chosen, but the choice affects the success probability. In this paper, we characterize an asymptotically optimal choice of the parameters and derive a single-letter expression for the error exponent of the resulting protocol. In particular, this implies an exponential lower bound on the success probability when the stochastic transformation arises from a degeneration.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1874-1895"},"PeriodicalIF":2.2,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have very recently been introduced for their potential application in quantum data storage. In this paper, we use classical LRCs to investigate quantum LRCs. We prove that the parameters of quantum LRCs are bounded by their classical counterparts. We deduce bounds on the parameters of quantum LRCs from bounds on the parameters of the classical ones. We establish a characterization of optimal pure quantum LRCs based on classical codes with specific properties. Using well-crafted classical LRCs as ingredients in the construction of quantum CSS codes, we offer the first construction of several families of optimal pure quantum LRCs.
{"title":"Bounds and Constructions of Quantum Locally Recoverable Codes From Quantum CSS Codes","authors":"Gaojun Luo;Bocong Chen;Martianus Frederic Ezerman;San Ling","doi":"10.1109/TIT.2025.3533494","DOIUrl":"https://doi.org/10.1109/TIT.2025.3533494","url":null,"abstract":"Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have very recently been introduced for their potential application in quantum data storage. In this paper, we use classical LRCs to investigate quantum LRCs. We prove that the parameters of quantum LRCs are bounded by their classical counterparts. We deduce bounds on the parameters of quantum LRCs from bounds on the parameters of the classical ones. We establish a characterization of optimal pure quantum LRCs based on classical codes with specific properties. Using well-crafted classical LRCs as ingredients in the construction of quantum CSS codes, we offer the first construction of several families of optimal pure quantum LRCs.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1794-1802"},"PeriodicalIF":2.2,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-24DOI: 10.1109/TIT.2025.3532625
Adway Patra;Alexander Barg
We consider regenerating codes in distributed storage systems where connections between the nodes are constrained by a graph. In this problem, the failed node downloads the information stored at a subset of vertices of the graph for the purpose of recovering the lost data. Compared to the standard setting, regenerating codes on graphs address two additional features. The repair information is moved across the network, and the cost of node repair is determined by the graphical distance from the helper nodes to the failed node. Accordingly, the helpers far away from the failed node may be expected to contribute less data for repair than the nodes in the neighborhood of that node. We analyze regenerating codes with nonuniform download for repair on graphs. Moreover, in the process of repair, the information moved from the helpers to the failed node may be combined through intermediate processing, reducing the repair bandwidth. We derive lower bounds for communication complexity of node repair on graphs, including repair schemes with nonuniform download and intermediate processing, and construct codes that attain these bounds. Additionally, some of the nodes may act as adversaries, introducing errors into the data moved in the network. For repair on graphs in the presence of adversarial nodes, we construct codes that support node repair and error correction in systematic nodes.
{"title":"Generalized Regenerating Codes and Node Repair on Graphs","authors":"Adway Patra;Alexander Barg","doi":"10.1109/TIT.2025.3532625","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532625","url":null,"abstract":"We consider regenerating codes in distributed storage systems where connections between the nodes are constrained by a graph. In this problem, the failed node downloads the information stored at a subset of vertices of the graph for the purpose of recovering the lost data. Compared to the standard setting, regenerating codes on graphs address two additional features. The repair information is moved across the network, and the cost of node repair is determined by the graphical distance from the helper nodes to the failed node. Accordingly, the helpers far away from the failed node may be expected to contribute less data for repair than the nodes in the neighborhood of that node. We analyze regenerating codes with nonuniform download for repair on graphs. Moreover, in the process of repair, the information moved from the helpers to the failed node may be combined through intermediate processing, reducing the repair bandwidth. We derive lower bounds for communication complexity of node repair on graphs, including repair schemes with nonuniform download and intermediate processing, and construct codes that attain these bounds. Additionally, some of the nodes may act as adversaries, introducing errors into the data moved in the network. For repair on graphs in the presence of adversarial nodes, we construct codes that support node repair and error correction in systematic nodes.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1613-1630"},"PeriodicalIF":2.2,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-24DOI: 10.1109/TIT.2025.3533947
Adeel Mahmood;Aaron B. Wagner
We consider channel coding for discrete memoryless channels (DMCs) with a novel cost constraint that constrains both the mean and the variance of the cost of the codewords. We show that the maximum (asymptotically) achievable rate under the new cost formulation is equal to the capacity-cost function; in particular, the strong converse holds. We further characterize the optimal second-order coding rate of these cost-constrained codes; in particular, the optimal second-order coding rate is finite. We then show that the second-order coding performance is strictly improved with feedback using a new variation of timid/bold coding, significantly broadening the applicability of timid/bold coding schemes from unconstrained compound-dispersion channels to all cost-constrained channels. Equivalent results on the minimum average probability of error are also given.
{"title":"Channel Coding With Mean and Variance Cost Constraints","authors":"Adeel Mahmood;Aaron B. Wagner","doi":"10.1109/TIT.2025.3533947","DOIUrl":"https://doi.org/10.1109/TIT.2025.3533947","url":null,"abstract":"We consider channel coding for discrete memoryless channels (DMCs) with a novel cost constraint that constrains both the mean and the variance of the cost of the codewords. We show that the maximum (asymptotically) achievable rate under the new cost formulation is equal to the capacity-cost function; in particular, the strong converse holds. We further characterize the optimal second-order coding rate of these cost-constrained codes; in particular, the optimal second-order coding rate is finite. We then show that the second-order coding performance is strictly improved with feedback using a new variation of timid/bold coding, significantly broadening the applicability of timid/bold coding schemes from unconstrained compound-dispersion channels to all cost-constrained channels. Equivalent results on the minimum average probability of error are also given.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1504-1532"},"PeriodicalIF":2.2,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-23DOI: 10.1109/TIT.2025.3527734
{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2025.3527734","DOIUrl":"https://doi.org/10.1109/TIT.2025.3527734","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 2","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10851796","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143361304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-23DOI: 10.1109/TIT.2025.3527732
{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2025.3527732","DOIUrl":"https://doi.org/10.1109/TIT.2025.3527732","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 2","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10851775","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143106993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-22DOI: 10.1109/TIT.2025.3532811
Ermes Franch;Chunlei Li
Low-rank parity-check (LRPC) codes are the rank-metric analogue of low-density parity-check codes and they found important applications in code-based cryptography. In this paper we investigate a sub-family of LRPC codes, which have a parity-check matrix defined over a subspace <inline-formula> <tex-math>${mathcal {V}}_{alpha,d}=langle 1,alpha, ldots, alpha ^{d-1} rangle _{mathbb {F}_{q}}subsetneq mathbb {F}_{q^{m}} $ </tex-math></inline-formula>, where <inline-formula> <tex-math>$mathbb {F}_{q^{m}}$ </tex-math></inline-formula> is the finite field of <inline-formula> <tex-math>$q^{m}$ </tex-math></inline-formula> elements, <inline-formula> <tex-math>$alpha in mathbb {F}_{q^{m}}$ </tex-math></inline-formula> is an element not in any proper subfield of <inline-formula> <tex-math>$mathbb {F}_{q^{m}}$ </tex-math></inline-formula>, and d is a positive integer significantly smaller than m. These codes are termed bounded-degree LRPC (BD-LRPC) codes. BD-LRPC codes are the same as the standard LRPC codes of density 2 when the degree <inline-formula> <tex-math>$d=2$ </tex-math></inline-formula>, while for degree <inline-formula> <tex-math>$dgt 2$ </tex-math></inline-formula> they constitute a proper subset of LRPC codes of density d. Exploiting the structure of <inline-formula> <tex-math>${mathcal {V}}_{alpha,d}$ </tex-math></inline-formula>, the BD-LRPC codes of degree d can uniquely correct errors of rank weight r when <inline-formula> <tex-math>$n-k geq r + u$ </tex-math></inline-formula> for certain <inline-formula> <tex-math>$u geq 1$ </tex-math></inline-formula>, in contrast to the condition <inline-formula> <tex-math>$n-kgeq dr$ </tex-math></inline-formula> required for the standard LRPC codes. This underscores the superior decoding capability of the BD-LRPC codes. Moreover, as the code length <inline-formula> <tex-math>$nrightarrow infty $ </tex-math></inline-formula>, when <inline-formula> <tex-math>$n/mrightarrow 0$ </tex-math></inline-formula>, the BD-LRPC codes with a code rate of <inline-formula> <tex-math>$R=k/n$ </tex-math></inline-formula> can be uniquely decodable with radius <inline-formula> <tex-math>$rho =r/n$ </tex-math></inline-formula> approaching the Singleton bound <inline-formula> <tex-math>$1-R$ </tex-math></inline-formula> by letting <inline-formula> <tex-math>$epsilon =u/nrightarrow 0$ </tex-math></inline-formula>; and when <inline-formula> <tex-math>$n/m$ </tex-math></inline-formula> is a constant, the BD-LRPC codes can have unique decoding radius <inline-formula> <tex-math>$rho = 1-R-epsilon $ </tex-math></inline-formula> for a small <inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>, allowing for <inline-formula> <tex-math>$rho gt (1-R)/2$ </tex-math></inline-formula> with properly chosen parameters. This superior decoding capability is theoretically proved for the case <inline-formula> <tex-math>$d=2$ </tex-math></inline-formula> and confirmed by experimental results for <inline-formula> <tex-math>$dgt 2$ </
{"title":"Bounded-Degree Low-Rank Parity-Check Codes","authors":"Ermes Franch;Chunlei Li","doi":"10.1109/TIT.2025.3532811","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532811","url":null,"abstract":"Low-rank parity-check (LRPC) codes are the rank-metric analogue of low-density parity-check codes and they found important applications in code-based cryptography. In this paper we investigate a sub-family of LRPC codes, which have a parity-check matrix defined over a subspace <inline-formula> <tex-math>${mathcal {V}}_{alpha,d}=langle 1,alpha, ldots, alpha ^{d-1} rangle _{mathbb {F}_{q}}subsetneq mathbb {F}_{q^{m}} $ </tex-math></inline-formula>, where <inline-formula> <tex-math>$mathbb {F}_{q^{m}}$ </tex-math></inline-formula> is the finite field of <inline-formula> <tex-math>$q^{m}$ </tex-math></inline-formula> elements, <inline-formula> <tex-math>$alpha in mathbb {F}_{q^{m}}$ </tex-math></inline-formula> is an element not in any proper subfield of <inline-formula> <tex-math>$mathbb {F}_{q^{m}}$ </tex-math></inline-formula>, and d is a positive integer significantly smaller than m. These codes are termed bounded-degree LRPC (BD-LRPC) codes. BD-LRPC codes are the same as the standard LRPC codes of density 2 when the degree <inline-formula> <tex-math>$d=2$ </tex-math></inline-formula>, while for degree <inline-formula> <tex-math>$dgt 2$ </tex-math></inline-formula> they constitute a proper subset of LRPC codes of density d. Exploiting the structure of <inline-formula> <tex-math>${mathcal {V}}_{alpha,d}$ </tex-math></inline-formula>, the BD-LRPC codes of degree d can uniquely correct errors of rank weight r when <inline-formula> <tex-math>$n-k geq r + u$ </tex-math></inline-formula> for certain <inline-formula> <tex-math>$u geq 1$ </tex-math></inline-formula>, in contrast to the condition <inline-formula> <tex-math>$n-kgeq dr$ </tex-math></inline-formula> required for the standard LRPC codes. This underscores the superior decoding capability of the BD-LRPC codes. Moreover, as the code length <inline-formula> <tex-math>$nrightarrow infty $ </tex-math></inline-formula>, when <inline-formula> <tex-math>$n/mrightarrow 0$ </tex-math></inline-formula>, the BD-LRPC codes with a code rate of <inline-formula> <tex-math>$R=k/n$ </tex-math></inline-formula> can be uniquely decodable with radius <inline-formula> <tex-math>$rho =r/n$ </tex-math></inline-formula> approaching the Singleton bound <inline-formula> <tex-math>$1-R$ </tex-math></inline-formula> by letting <inline-formula> <tex-math>$epsilon =u/nrightarrow 0$ </tex-math></inline-formula>; and when <inline-formula> <tex-math>$n/m$ </tex-math></inline-formula> is a constant, the BD-LRPC codes can have unique decoding radius <inline-formula> <tex-math>$rho = 1-R-epsilon $ </tex-math></inline-formula> for a small <inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>, allowing for <inline-formula> <tex-math>$rho gt (1-R)/2$ </tex-math></inline-formula> with properly chosen parameters. This superior decoding capability is theoretically proved for the case <inline-formula> <tex-math>$d=2$ </tex-math></inline-formula> and confirmed by experimental results for <inline-formula> <tex-math>$dgt 2$ </","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1593-1612"},"PeriodicalIF":2.2,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-22DOI: 10.1109/TIT.2025.3532649
Homa Nikbakht;Malcolm Egan;Jean-Marie Gorce;H. Vincent Poor
A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption fails when messages arrive rapidly and reliability constraints require that the number of channel uses exceed the time between arrivals. In this paper, we consider a broadcast setting in which a transmitter wishes to send two different messages to two receivers over Gaussian channels. Messages have different arrival times and decoding deadlines such that their transmission windows overlap. For this setting, we propose a coding scheme that exploits Marton’s coding strategy. We derive rigorous bounds on the achievable rate regions. Those bounds can be easily employed in point-to-point settings with one or multiple parallel channels. In the point-to-point setting with one or multiple parallel channels, the proposed achievability scheme is consistent with the normal approximation. In the broadcast setting, our scheme agrees with Marton’s strategy for sufficiently large numbers of channel uses and shows significant performance improvements over standard approaches based on time sharing for transmission of short packets.
{"title":"Broadcast Channels With Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability","authors":"Homa Nikbakht;Malcolm Egan;Jean-Marie Gorce;H. Vincent Poor","doi":"10.1109/TIT.2025.3532649","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532649","url":null,"abstract":"A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption fails when messages arrive rapidly and reliability constraints require that the number of channel uses exceed the time between arrivals. In this paper, we consider a broadcast setting in which a transmitter wishes to send two different messages to two receivers over Gaussian channels. Messages have different arrival times and decoding deadlines such that their transmission windows overlap. For this setting, we propose a coding scheme that exploits Marton’s coding strategy. We derive rigorous bounds on the achievable rate regions. Those bounds can be easily employed in point-to-point settings with one or multiple parallel channels. In the point-to-point setting with one or multiple parallel channels, the proposed achievability scheme is consistent with the normal approximation. In the broadcast setting, our scheme agrees with Marton’s strategy for sufficiently large numbers of channel uses and shows significant performance improvements over standard approaches based on time sharing for transmission of short packets.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1758-1776"},"PeriodicalIF":2.2,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：