发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Asymptotically Good Generalized Quantum Tanner Codes 渐近良好广义量子Tanner码
IF 2.2
IEEE journal on selected areas in information theory Pub Date : 2025-07-30 DOI: 10.1109/JSAIT.2025.3594310
Olai Å. Mostad;Eirik Rosnes;Hsuan-Yin Lin
{"title":"Asymptotically Good Generalized Quantum Tanner Codes","authors":"Olai Å. Mostad;Eirik Rosnes;Hsuan-Yin Lin","doi":"10.1109/JSAIT.2025.3594310","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3594310","url":null,"abstract":"In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Zémor, which contains a construction of asymptotically good quantum low-density parity-check codes. Quantum Tanner codes have so far been constructed equivalently from groups, Cayley graphs, or square complexes constructed from groups. We show how to enlarge this to graphs with labeled local views and a family of square complexes, which is the largest possible in a certain sense. We show that the proposed generalization contains a family of asymptotically good quantum codes that are based on non-Cayley Schreier graphs, i.e., a <italic>new</i> family of (generalized) quantum Tanner codes is provided. Moreover, we evaluate the performance of the generalized codes and compare with those based on Cayley graphs both in terms of minimum distance and logical error rate on the depolarizing channel, demonstrating that the proposed generalized codes based on Schreier graphs outperform those based on Cayley graphs.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"367-382"},"PeriodicalIF":2.2,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210027","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
Ramp Secret Sharing for Composite DNA 合成DNA的斜坡秘密共享
IF 2.2
IEEE journal on selected areas in information theory Pub Date : 2025-07-28 DOI: 10.1109/JSAIT.2025.3593447
Wenkai Zhang;Zhiying Wang
{"title":"Ramp Secret Sharing for Composite DNA","authors":"Wenkai Zhang;Zhiying Wang","doi":"10.1109/JSAIT.2025.3593447","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3593447","url":null,"abstract":"Emerging DNA storage technologies use composite DNA letters, where information is represented by a probability vector, leading to higher information density and lower synthesis costs. However, it faces the problem of information leakage in sharing the DNA vessels among untrusted vendors. This paper introduces an asymptotic ramp secret sharing scheme (ARSSS) for secret information storage using composite DNA letters. This innovative scheme, inspired by secret sharing methods over finite fields and enhanced with a modified matrix-vector multiplication operation for probability vectors, achieves asymptotic information-theoretic data security for a large alphabet size. Moreover, this scheme reduces the number of reading operations for DNA samples compared to traditional schemes, and therefore lowers the complexity and the cost of DNA-based secret sharing. We further explore the construction of the scheme, starting with a proof of the existence of a suitable generator, followed by practical examples. Finally, we demonstrate efficient constructions to support large information sizes, which utilize multiple vessels for each secret share rather than a single vessel.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"217-231"},"PeriodicalIF":2.2,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144887811","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
Error Exponents for DNA Storage Codes With a Variable Number of Reads 具有可变读取数的DNA存储代码的错误指数
IF 2.2
IEEE journal on selected areas in information theory Pub Date : 2025-07-21 DOI: 10.1109/JSAIT.2025.3590758
Yan Hao Ling;Nir Weinberger;Jonathan Scarlett
{"title":"Error Exponents for DNA Storage Codes With a Variable Number of Reads","authors":"Yan Hao Ling;Nir Weinberger;Jonathan Scarlett","doi":"10.1109/JSAIT.2025.3590758","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3590758","url":null,"abstract":"In this paper, we study error exponents for an index-based concatenated coding based class of DNA storage codes in which the number of reads performed can be variable. That is, the decoder can sequentially perform reads and choose whether to output the final decision or take more reads, and we are interested in minimizing the average number of reads performed rather than a fixed pre-specified value. We show that this flexibility leads to a considerable reduction in the error probability compared to a fixed number of reads, not only in terms of constants in the error exponent but also in the scaling laws. This is shown via an achievability result for a suitably-designed protocol, and in certain parameter regimes we additionally establish a matching converse that holds for all protocols within a broader index-based concatenated coding based class.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"205-216"},"PeriodicalIF":2.2,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144814143","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
CSS-T Codes From Reed-Muller Codes 来自Reed-Muller代码的CSS-T代码
IEEE journal on selected areas in information theory Pub Date : 2025-06-25 DOI: 10.1109/JSAIT.2025.3583217
Jessalyn Bolkema;Emma Andrade;Thomas Dexter;Harrison Eggers;Victoria L. Fisher;Luke Szramowsky;Felice Manganiello
{"title":"CSS-T Codes From Reed-Muller Codes","authors":"Jessalyn Bolkema;Emma Andrade;Thomas Dexter;Harrison Eggers;Victoria L. Fisher;Luke Szramowsky;Felice Manganiello","doi":"10.1109/JSAIT.2025.3583217","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3583217","url":null,"abstract":"CSS-T codes are a class of stabilizer codes introduced by Rengaswamy et al. with desired properties for quantum fault-tolerance. In this work, we comprehensively study non-degenerate CSS-T codes built from Reed-Muller codes. These classical codes allow for constructing optimal CSS-T code families with nonvanishing asymptotic rates up to <inline-formula> <tex-math>${}frac {1}{2}$ </tex-math></inline-formula> and possibly diverging minimum distance when non-degenerate.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"199-204"},"PeriodicalIF":0.0,"publicationDate":"2025-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144634775","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
Asymptotically Good CSS-T Codes and a New Construction of Triorthogonal Codes 渐近良好的CSS-T码及三正交码的一种新构造
IEEE journal on selected areas in information theory Pub Date : 2025-06-23 DOI: 10.1109/JSAIT.2025.3582156
Elena Berardini;Reza Dastbasteh;Josu Etxezarreta Martinez;Shreyas Jain;Olatz Sanz Larrarte
{"title":"Asymptotically Good CSS-T Codes and a New Construction of Triorthogonal Codes","authors":"Elena Berardini;Reza Dastbasteh;Josu Etxezarreta Martinez;Shreyas Jain;Olatz Sanz Larrarte","doi":"10.1109/JSAIT.2025.3582156","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3582156","url":null,"abstract":"We propose a new systematic construction of CSS-T codes from any given CSS code using a map <inline-formula> <tex-math>$phi $ </tex-math></inline-formula>. When <inline-formula> <tex-math>$phi $ </tex-math></inline-formula> is the identity map I, we retrieve the construction of Hu et al. (2021) and use it to prove the existence of asymptotically good binary CSS-T codes, resolving a previously open problem in the literature, and of asymptotically good quantum LDPC CSS-T codes. We analyze the structure of the logical operators corresponding to certain non-Clifford gates supported by the quantum codes obtained from this construction <inline-formula> <tex-math>$(phi = I)$ </tex-math></inline-formula>, concluding that they always result in the logical identity. An immediate application of these codes in dealing with coherent noise is discussed. We then develop a new doubling transformation for obtaining triorthogonal codes, which generalizes the doubling construction presented in Jain and Albert (2024). Our approach permits using self-orthogonal codes, instead of only doubly-even codes, as building blocks for triorthogonal codes. This broadens the range of codes available for magic state distillation.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"189-198"},"PeriodicalIF":0.0,"publicationDate":"2025-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144634708","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
Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes 拓扑码译码去极化误差的并交并求
IEEE journal on selected areas in information theory Pub Date : 2025-06-20 DOI: 10.1109/JSAIT.2025.3581810
Tzu-Hao Lin;Ching-Yi Lai
{"title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","authors":"Tzu-Hao Lin;Ching-Yi Lai","doi":"10.1109/JSAIT.2025.3581810","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3581810","url":null,"abstract":"In this paper, we introduce the Union-Intersection Union-Find (UIUF) algorithm for decoding depolarizing errors in topological codes, combining the strengths of iterative and standard Union-Find (UF) decoding. While iterative UF improves performance at moderate error rates, it lacks an error correction guarantee. To address this, we develop UIUF, which maintains the enhanced performance of iterative UF while ensuring error correction up to half the code distance. Through simulations under code capacity, phenomenological, and biased noise models, we show that UIUF significantly outperforms UF, reducing the logical error rate by over an order of magnitude (at around <inline-formula> <tex-math>$10^{-5}$ </tex-math></inline-formula>). Moreover, UIUF achieves lower logical error rates than the Minimum Weight Perfect Matching (MWPM) decoder on rotated surface codes under both the code capacity and phenomenological noise models, while preserving efficient linear-time complexity.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"163-175"},"PeriodicalIF":0.0,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144606250","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
Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes 改进量子LDPC码擦除译码的聚类分解
IEEE journal on selected areas in information theory Pub Date : 2025-06-11 DOI: 10.1109/JSAIT.2025.3578597
Hanwen Yao;Mert Gökduman;Henry D. Pfister
{"title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes","authors":"Hanwen Yao;Mert Gökduman;Henry D. Pfister","doi":"10.1109/JSAIT.2025.3578597","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3578597","url":null,"abstract":"We introduce a new erasure decoder that applies to arbitrary quantum LDPC codes. Dubbed the cluster decoder, it generalizes the decomposition idea of Vertical-Horizontal (VH) decoding introduced by Connolly et al. in 2022. Like the VH decoder, the idea is to first run the peeling decoder and then post-process the resulting stopping set. The cluster decoder breaks the stopping set into a tree of clusters, which can be solved sequentially via Gaussian Elimination. By allowing clusters of unconstrained size, this decoder achieves maximum-likelihood (ML) performance with reduced complexity compared with full Gaussian Elimination. When Gaussian Elimination is applied only to clusters whose sizes are less than a constant, the performance is degraded, but the complexity becomes linear in the block length. Our simulation results show that, for hypergraph product codes, the cluster decoder with constant cluster size achieves near-ML performance similar to VH decoding in the low-erasure-rate regime. For the general quantum LDPC codes we studied, the cluster decoder can be used to estimate the ML performance curve with reduced complexity over a wide range of erasure rates.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"176-188"},"PeriodicalIF":0.0,"publicationDate":"2025-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144606314","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
Puncturing Quantum Stabilizer Codes 破解量子稳定码
IEEE journal on selected areas in information theory Pub Date : 2025-04-18 DOI: 10.1109/JSAIT.2025.3562287
Jaron Skovsted Gundersen;René Bødker Christensen;Markus Grassl;Petar Popovski;Rafał Wisniewski
{"title":"Puncturing Quantum Stabilizer Codes","authors":"Jaron Skovsted Gundersen;René Bødker Christensen;Markus Grassl;Petar Popovski;Rafał Wisniewski","doi":"10.1109/JSAIT.2025.3562287","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3562287","url":null,"abstract":"Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. Both of these techniques have been generalized to quantum codes. Restricting to stabilizer codes, this paper introduces more freedom in the choice of the encoded states after puncturing. Furthermore, we also give an explicit description of the stabilizers for the punctured code. The additional freedom in the procedure also opens up for new ways to construct new codes from old, and we present several ways to utilize this in the search for codes with good or even optimal parameters. In particular, we use the construction to obtain codes whose parameters exceed the best previously known and which are better than what general puncturing guarantees. Lastly, the freedom in our puncture procedure allowed us to generalize the proof of the Griesmer bound from the classical setting to stabilizer codes for qudits of prime dimension since the proof relies heavily on the puncturing technique.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"74-84"},"PeriodicalIF":0.0,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143908363","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
A Floquet Series-Based Framework to Evaluate the Impact of Antenna Efficiency on MIMO Systems 基于Floquet序列的天线效率评估框架对MIMO系统的影响
IEEE journal on selected areas in information theory Pub Date : 2025-03-30 DOI: 10.1109/JSAIT.2025.3575095
Yongxi Liu;Ming Zhang;Xiaoming Chen;Anxue Zhang
{"title":"A Floquet Series-Based Framework to Evaluate the Impact of Antenna Efficiency on MIMO Systems","authors":"Yongxi Liu;Ming Zhang;Xiaoming Chen;Anxue Zhang","doi":"10.1109/JSAIT.2025.3575095","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3575095","url":null,"abstract":"Antenna efficiency is a key parameter in the design of large-scale dense arrays, and influences the signal-to-noise ratio (SNR) of wireless communications. Low embedded element efficiency (EEE) has been verified to be the bottleneck of dense array MIMO systems. Using ideas from the Floquet series, we propose a new framework to evaluate the mutual coupling for infinite arrays with a regular grid, including two new methods to calculate the EEE. The proposed methods can incorporate the impedance of the source network, whereas the traditional geometry based method assumes perfect impedance matching at all scan angles. Starting from the surface current of array elements, the radiation field is decomposed into a set of current-weighted orthogonal electromagnetic waves. This decomposition can be utilized to compute the radiation characteristics of the antenna array, including the active impedance, the generalized scattering parameters, and the embedded element patterns. Theoretical analysis is provided to illustrate how the degradation of EEE reduces the SNR and sequentially channel capacity of MIMO systems. Numerical simulations show that the proposed methods give a more accurate efficiency than the geometry based method. Channel capacity based on the polarization holographic channel model is evaluated to validate the constraining effect of EEE on system throughput.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"150-162"},"PeriodicalIF":0.0,"publicationDate":"2025-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144481946","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
How Much Power Must We Extract From a Receiver Antenna to Effect Communications? 我们必须从接收天线中提取多少功率才能实现通信？
IEEE journal on selected areas in information theory Pub Date : 2025-03-26 DOI: 10.1109/JSAIT.2025.3555066
Thomas L. Marzetta;Brian McMinn;Amritpal Singh;Thorkild B. Hansen
{"title":"How Much Power Must We Extract From a Receiver Antenna to Effect Communications?","authors":"Thomas L. Marzetta;Brian McMinn;Amritpal Singh;Thorkild B. Hansen","doi":"10.1109/JSAIT.2025.3555066","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3555066","url":null,"abstract":"Subject to the laws of classical physics - the science that governs the design of today’s wireless communication systems - there is no need to match the radiation impedance of a receiver antenna to the impedance of the front-end electronics in order to effect communications. If we dispense with a transmission line and, instead, make the front-end electronics colocated with the antenna, then a high input impedance preamplifier can measure the open-circuit voltage directly on the antenna port while drawing negligible power. Neither Friis’ concept of noise figure, nor Shannon information theory, nor electronics technology dictates that we must extract power from an antenna. Classical physics appears not to provide a lower bound on the energy that must be extracted from the antenna for every bit of received information.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"49-58"},"PeriodicalIF":0.0,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143800996","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信