2023 IEEE Information Theory Workshop (ITW)最新文献

A constructive approach to multimedia codes with complete traceability resistant to δ-noise 具有完全可追溯性的抗δ噪声多媒体代码的构建方法

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161685

Marcel Fernández, G. Kabatiansky, Sebastià Martín, C. Tavernier

引用次数: 0

Improved Bounds For Efficiently Decodable Probabilistic Group Testing With Unreliable Items 基于不可靠项的可译码概率群测试的改进界

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161616

Sarthak Jain, Martina Cardone, S. Mohajer

{"title":"Improved Bounds For Efficiently Decodable Probabilistic Group Testing With Unreliable Items","authors":"Sarthak Jain, Martina Cardone, S. Mohajer","doi":"10.1109/ITW55543.2023.10161616","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161616","url":null,"abstract":"This work uses non-adaptive probabilistic group testing to find a set of L defective items out of n items. In contrast to traditional group testing, in the considered setup each item can hide itself (or become inactive) during any given test with probability 1−α and is active with probability α. The authors of [Cheraghchi et al.] proposed an efficiently decodable probabilistic group testing scheme which requires $Oleft( {frac{{Llog (n)}}{{{alpha ^3}}}} right)$ tests for the per-instance scenario (where the group testing matrix works for any arbitrary, but fixed, set of L defective items) and $Oleft( {frac{{{L^2}log (n/L)}}{{{alpha ^3}}}} right)$ tests for the universal scenario (where the same group testing matrix works for all possible defective sets of L items). The contribution of this work is two-fold: (i) with a slight modification in the construction of the group testing matrix proposed by [Cheraghchi et al.], the corresponding bounds on the number of sufficient tests are improved to $Oleft( {frac{{Llog (n)}}{{{alpha ^2}}}} right)$ and $Oleft( {frac{{{L^2}log (n/L)}}{{{alpha ^2}}}} right)$ for the per-instance and universal scenarios respectively, while still using their efficient decoding method; and (ii) it is shown that the same bounds also hold for the fixed pool-size probabilistic group testing scenario, where in every test a fixed number of items are included for testing.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122467101","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}

引用次数: 1

The Secrecy Capacity of Gaussian Wiretap Channels with Rate-Limited Help at the Encoder 编码器限速帮助下高斯窃听信道的保密能力

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161609

S. Loyka, N. Merhav

引用次数: 0

Concentration Properties of Generalized Random Gilbert-Varshamov Codes 广义随机Gilbert-Varshamov码的集中性质

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161687

Lan V. Truong

引用次数: 0

Asymmetric tree correlation testing for graph alignment 图对齐的非对称树相关测试

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161653

Jakob Maier, L. Massoulié

引用次数: 0

Bidirectional Piggybacking Design for All Nodes with Sub-Packetization l = r 具有子分组l = r的所有节点双向承载设计

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161644

Ke Wang, Zhifang Zhang

{"title":"Bidirectional Piggybacking Design for All Nodes with Sub-Packetization l = r","authors":"Ke Wang, Zhifang Zhang","doi":"10.1109/ITW55543.2023.10161644","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161644","url":null,"abstract":"Piggybacking design has been applied extensively in distributed storage systems in recent years, since it can reduce repair bandwidth significantly with small sub-packetization. In this work, we propose a bidirectional piggybacking design (BPD) with sub-packetization l = r, where r = n − k equals the redundancy of an [n,k] linear code. Unlike most existing piggybacking designs, there is no distinction between systematic nodes and parity nodes in BPD and the piggybacks are added bidirectionally. Consequently, BPD leads to lower average repair bandwidth than previous piggybacking designs at equal subpacketization level when r ≥ 3. However, BPD needs larger fields to maintain the MDS property. We prove two upper bounds on the field size for explicit BPD and existential constructions respectively. By computer search, our BPD can be given over a field much smaller than the proved upper bounds. As an example, we provide the BPD for the [14], [10] Reed-Solomon (RS) code over F28 and obtain approximately 50% savings in the average repair bandwidth compared with the trivial repair approach. This is the lowest repair bandwidth achieved so far for [14], [10]256 RS codes with sub-packetization l ≤ 4.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128635467","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

Improved Alpha-Information Bounds for Higher-Order Masked Cryptographic Implementations 高阶掩码加密实现的改进alpha -信息边界

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161608

Yi Liu, Julien Béguinot, Wei Cheng, S. Guilley, Loïc Masure, O. Rioul, François-Xavier Standaert

引用次数: 1

A Generalization of the Equal Coding Theorem 等价编码定理的一个推广

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161633

Hui-An Shen, S. M. Moser, J. Pfister

引用次数: 0

An Erasure Queue-Channel with Feedback: Optimal Transmission Control to Maximize Capacity 带反馈的擦除队列-信道:容量最大化的最优传输控制

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161665

K. Varma, K. Jagannathan

{"title":"An Erasure Queue-Channel with Feedback: Optimal Transmission Control to Maximize Capacity","authors":"K. Varma, K. Jagannathan","doi":"10.1109/ITW55543.2023.10161665","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161665","url":null,"abstract":"A queue-channel is a model that captures waiting time-dependent degradation of information bits—a scenario motivated by quantum communications and delay-sensitive streaming. Recent work has characterised the capacity of the erasure queue-channel [1], and other noise models encountered in quantum communications. In this paper, we study an erasure queue-channel with feedback, and ask after the optimal transmission strategy to minimize waiting-induced erasures. Specifically, we assume that instantaneous feedback of queue-length (or of the queue-channel output) is available at the transmitter, which can modulate the rate of Poisson transmissions into the queue-channel. We pose an optimal control problem using HJB-style equations to maximize the information capacity, when the transmitter can choose from a bounded set of transmission rates. We show (under a numerically verifiable condition) that the optimal transmission policy is a single-threshold policy of the bang-bang type. In other words, transmitting at the maximum (minimum) possible rate when the queue is below (above) a threshold, maximizes the information capacity of the erasure queue-channel with feedback.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124883964","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}

引用次数: 2

New Construction of (k + r,k) Systematic MDS Array Codes with r ≤ 4 r≤4的(k + r,k)系统MDS阵列码的新构造

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161610

Zhe Zhai, Q. T. Sun, Sheng Jin, Shaoteng Liu, Xiangyu Chen

引用次数: 0