IEEE Transactions on Information Theory最新文献

{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2024.3515433","DOIUrl":"https://doi.org/10.1109/TIT.2024.3515433","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2024-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10816279","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142890255","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}

{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2024.3515437","DOIUrl":"https://doi.org/10.1109/TIT.2024.3515437","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2024-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10816278","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142890233","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}

{"title":"Optimal Signals and Detectors Based on Correlation and Energy","authors":"Yossi Marciano;Neri Merhav","doi":"10.1109/TIT.2024.3508537","DOIUrl":"https://doi.org/10.1109/TIT.2024.3508537","url":null,"abstract":"In continuation of an earlier study, we explore a Neymann-Pearson hypothesis testing scenario where, under the null hypothesis (\u0000<inline-formula> <tex-math>${mathcal { H}}_{0}$ </tex-math></inline-formula>\u0000), the received signal is a white noise process \u0000<inline-formula> <tex-math>$N_{t}$ </tex-math></inline-formula>\u0000, which is not Gaussian in general, and under the alternative hypothesis (\u0000<inline-formula> <tex-math>${mathcal { H}}_{1}$ </tex-math></inline-formula>\u0000), the received signal comprises a deterministic transmitted signal \u0000<inline-formula> <tex-math>$s_{t}$ </tex-math></inline-formula>\u0000 corrupted by additive white noise, the sum of \u0000<inline-formula> <tex-math>$N_{t}$ </tex-math></inline-formula>\u0000 and another noise process originating from the transmitter, denoted as \u0000<inline-formula> <tex-math>$Z_{t}$ </tex-math></inline-formula>\u0000, which is not necessarily Gaussian either. Our approach focuses on detectors that are based on the correlation and energy of the received signal, which are motivated by implementation simplicity. We optimize the detector parameters to achieve the best trade-off between missed-detection and false-alarm error exponents. First, we optimize the detectors for a given signal, resulting in a non-linear relation between the signal and correlator weights to be optimized. Subsequently, we optimize the transmitted signal and the detector parameters jointly, revealing that the optimal signal is a balanced ternary signal and the correlator has at most three different coefficients, thus facilitating a computationally feasible solution.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"833-846"},"PeriodicalIF":2.2,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142890327","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}

{"title":"Multi-Armed Bandits With Costly Probes","authors":"Eray Can Elumar;Cem Tekin;Osman Yağan","doi":"10.1109/TIT.2024.3506866","DOIUrl":"https://doi.org/10.1109/TIT.2024.3506866","url":null,"abstract":"Multi-armed bandits is a sequential decision-making problem where an agent must choose between multiple actions to maximize its cumulative reward over time, while facing uncertainty about the rewards associated with each action. The challenge lies in balancing the exploration of potentially higher-rewarding actions with the exploitation of known high-reward actions. We consider a multi-armed bandit problem with probes, where before pulling an arm, the decision-maker is allowed to probe one of the K arms for a cost \u0000<inline-formula> <tex-math>$cgeq 0$ </tex-math></inline-formula>\u0000 to observe its reward. We introduce a new regret definition that is based on the expected reward of the optimal action. We develop UCBP, a novel algorithm that utilizes this strategy to achieve a gap-independent regret upper bound that scales with the number of rounds T as \u0000<inline-formula> <tex-math>$ O(sqrt {KTlog T})$ </tex-math></inline-formula>\u0000, and an order optimal gap-dependent upper bound of \u0000<inline-formula> <tex-math>$ O(Klog T)$ </tex-math></inline-formula>\u0000. As a baseline, we introduce UCB-naive-probe, a naive UCB-based approach which has a gap-independent regret upper bound of \u0000<inline-formula> <tex-math>$O(Ksqrt {Tlog T})$ </tex-math></inline-formula>\u0000, and gap-dependent regret bound of \u0000<inline-formula> <tex-math>$O(K^{2}log T)$ </tex-math></inline-formula>\u0000; and TSP, the Thompson sampling version of UCBP. In empirical simulations, UCBP outperforms UCB-naive-probe, and performs similarly to TSP, verifying the utility of UCBP and TSP algorithms in practical settings.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"618-643"},"PeriodicalIF":2.2,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142890254","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}

{"title":"Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes","authors":"Martianus Frederic Ezerman;Markus Grassl;San Ling;Ferruh Özbudak;Buket Özkaya","doi":"10.1109/TIT.2024.3503420","DOIUrl":"https://doi.org/10.1109/TIT.2024.3503420","url":null,"abstract":"Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices of the inner product to also cover the symplectic and trace-symplectic inner products, in addition to the original Hermitian one. A refined lower bound on the minimum distance of the resulting quantum codes is established and illustrated. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"499-517"},"PeriodicalIF":2.2,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142890145","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}

{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2024.3493733","DOIUrl":"https://doi.org/10.1109/TIT.2024.3493733","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 12","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10767145","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142753905","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}

{"title":"Bent Partition, Vectorial Dual-Bent Function, and LP-Packing Constructions","authors":"Sezel Alkan;Nurdagül Anbar;Tekgül Kalaycı;Wilfried Meidl","doi":"10.1109/TIT.2024.3505600","DOIUrl":"https://doi.org/10.1109/TIT.2024.3505600","url":null,"abstract":"We present secondary constructions of vectorial functions respectively partitions of elementary abelian groups, which simultaneously yield vectorial dual-bent functions with certain properties, bent partitions, and under some conditions, Latin square partial difference set packings (LP-packings). First, we analyse constructions via the direct sum of vectorial functions and then present a version of the generalized Maiorana-McFarland construction. Next, we generalize a construction of vectorial dual-bent functions by Wang, Fu, and Wei (2023). Finally, we use a lifting procedure of LP-packings from Jedwab and Li (2021) to construct vectorial dual-bent functions, bent partitions, and LP-packings in elementary abelian groups. With these constructions, a large variety of vectorial bent functions, bent partitions, LP-packings, and related amorphic association schemes can be obtained.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"752-767"},"PeriodicalIF":2.2,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142890198","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}

{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2024.3493737","DOIUrl":"https://doi.org/10.1109/TIT.2024.3493737","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 12","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10767126","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713767","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}

{"title":"Streaming Codes for Three-Node Relay Networks With Burst Erasures","authors":"Vinayak Ramkumar;Myna Vajha;M. Nikhil Krishnan","doi":"10.1109/TIT.2024.3504538","DOIUrl":"https://doi.org/10.1109/TIT.2024.3504538","url":null,"abstract":"We study burst erasure correcting streaming codes for three-node relay networks, where there is a source-relay link and a relay-destination link. These codes guarantee that all message packets are recovered within a delay of \u0000<inline-formula> <tex-math>$tau $ </tex-math></inline-formula>\u0000 time slots, given that a single burst erasure of length at most b packets occurs in both links. Leveraging previously known techniques in the streaming code literature, we first provide a simple upper bound on the rate of burst erasure correcting streaming codes for three-node relay networks. Our main result is a coding scheme that achieves rates arbitrarily close to the rate upper bound, as message size increases.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"348-359"},"PeriodicalIF":2.2,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142890297","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}

{"title":"On Optimal Finite-Length Block Codes of Size Four for Binary Symmetric Channels","authors":"Yanyan Dong;Shenghao Yang","doi":"10.1109/TIT.2024.3504823","DOIUrl":"https://doi.org/10.1109/TIT.2024.3504823","url":null,"abstract":"An \u0000<inline-formula> <tex-math>$(n,M)$ </tex-math></inline-formula>\u0000 code refers to a binary code with blocklength n and codebook size M. Such codes are studied in the context of memoryless binary symmetric channels (BSCs) with maximum likelihood (ML) decoding. Previous research has characterized some optimal codes among the linear \u0000<inline-formula> <tex-math>$(n,4)$ </tex-math></inline-formula>\u0000 codes for any \u0000<inline-formula> <tex-math>$n geq 2$ </tex-math></inline-formula>\u0000. However, it was unknown whether these optimal codes among linear codes were better than all nonlinear codes. In this paper, we first demonstrate that for any \u0000<inline-formula> <tex-math>$n geq 2$ </tex-math></inline-formula>\u0000, there exists an optimal code among all \u0000<inline-formula> <tex-math>$(n,4)$ </tex-math></inline-formula>\u0000 codes that is either linear or belongs to a subset of nonlinear codes called Class-I codes. We identify all the optimal codes among the linear \u0000<inline-formula> <tex-math>$(n,4)$ </tex-math></inline-formula>\u0000 codes for each blocklength \u0000<inline-formula> <tex-math>$n geq 2$ </tex-math></inline-formula>\u0000 and discover some that were not previously reported in the literature. For any n from 2 to 8, all the optimal \u0000<inline-formula> <tex-math>$(n,4)$ </tex-math></inline-formula>\u0000 codes are identified. Except for \u0000<inline-formula> <tex-math>$n=3$ </tex-math></inline-formula>\u0000, all the optimal \u0000<inline-formula> <tex-math>$(n,4)$ </tex-math></inline-formula>\u0000 codes are equivalent to linear codes. There exist optimal \u0000<inline-formula> <tex-math>$(3,4)$ </tex-math></inline-formula>\u0000 codes that are not equivalent to linear codes. Furthermore, we introduce a subset of nonlinear codes called Class-II codes and show that for any \u0000<inline-formula> <tex-math>$n gt 3$ </tex-math></inline-formula>\u0000, the set composed of linear, Class-I, and Class-II codes and their equivalent codes contains all the optimal \u0000<inline-formula> <tex-math>$(n,4)$ </tex-math></inline-formula>\u0000 codes. Both Class-I and Class-II codes are close to linear codes in the sense that they involve only one type of column that is not included in linear codes. We derive a sufficient condition such that all the optimal \u0000<inline-formula> <tex-math>$(n,4)$ </tex-math></inline-formula>\u0000 codes are equivalent to linear codes, which can be evaluated by computer with a computation cost \u0000<inline-formula> <tex-math>$O(n^{6})$ </tex-math></inline-formula>\u0000.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"138-166"},"PeriodicalIF":2.2,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142890176","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}