Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161685
Marcel Fernández, G. Kabatiansky, Sebastià Martín, C. Tavernier
This paper presents an explicit construction of multimedia codes with complete traceability resistant to the averaging attack and δ-noise. The obtained code is a combination of a class of signature codes together with a generalization of superimposed codes, for which existence lower bounds, using the Lovász Local Lemma, are obtained. The constructions are a consequence of the Moser-Tardos variable framework.
本文提出了一种具有完全可追溯性、可抵御平均攻击和δ噪声的多媒体编码的明确构造。所获得的编码是一类签名编码与叠加编码广义化的结合，利用 Lovász Local Lemma 获得了这些编码的存在性下限。这些构造是 Moser-Tardos 变量框架的结果。
{"title":"A constructive approach to multimedia codes with complete traceability resistant to δ-noise","authors":"Marcel Fernández, G. Kabatiansky, Sebastià Martín, C. Tavernier","doi":"10.1109/ITW55543.2023.10161685","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161685","url":null,"abstract":"This paper presents an explicit construction of multimedia codes with complete traceability resistant to the averaging attack and δ-noise. The obtained code is a combination of a class of signature codes together with a generalization of superimposed codes, for which existence lower bounds, using the Lovász Local Lemma, are obtained. The constructions are a consequence of the Moser-Tardos variable framework.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"26 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":"127138190","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}
Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161616
Sarthak Jain, Martina Cardone, S. Mohajer
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.
{"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}
Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161609
S. Loyka, N. Merhav
The Gaussian wiretap channel (WTC) with rate-limited help, available at the transmitter/encoder (Tx), in addition to or instead of the same help at the legitimate receiver, is studied under various channel configurations. For the degraded or reversely-degraded WTC, rate-limited non-secure Tx help results in a secrecy capacity boost equal to the help rate irrespective of whether the help is causal or not. For the non-degraded WTC, the secrecy capacity boost is lower bounded by the help rate. A capacity-achieving signaling is two-phase time sharing, where wiretap coding without help is used in Phase 1 and help without wiretap coding is used in Phase 2. The secrecy capacity with Tx help is positive for the reversely-degraded channel (where the no-help secrecy capacity is zero) and no Phase 1 is needed to achieve it. Unlike the no-help case, more noise at the legitimate receiver can sometimes result in higher secrecy capacity with Tx help. In the case of the joint Tx/Rx non-secure help, one help link can be omitted without affecting the capacity.
{"title":"The Secrecy Capacity of Gaussian Wiretap Channels with Rate-Limited Help at the Encoder","authors":"S. Loyka, N. Merhav","doi":"10.1109/ITW55543.2023.10161609","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161609","url":null,"abstract":"The Gaussian wiretap channel (WTC) with rate-limited help, available at the transmitter/encoder (Tx), in addition to or instead of the same help at the legitimate receiver, is studied under various channel configurations. For the degraded or reversely-degraded WTC, rate-limited non-secure Tx help results in a secrecy capacity boost equal to the help rate irrespective of whether the help is causal or not. For the non-degraded WTC, the secrecy capacity boost is lower bounded by the help rate. A capacity-achieving signaling is two-phase time sharing, where wiretap coding without help is used in Phase 1 and help without wiretap coding is used in Phase 2. The secrecy capacity with Tx help is positive for the reversely-degraded channel (where the no-help secrecy capacity is zero) and no Phase 1 is needed to achieve it. Unlike the no-help case, more noise at the legitimate receiver can sometimes result in higher secrecy capacity with Tx help. In the case of the joint Tx/Rx non-secure help, one help link can be omitted without affecting the capacity.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"28 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":"114754982","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}
Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161687
Lan V. Truong
We study the typical error exponent of constant composition generalized random Gilbert-Varshamov (RGV) codes over discrete memoryless channels (DMC) channels with generalized likelihood decoding. We show that the typical error exponent of the RGV ensemble is equal to the expurgated error exponent, provided that the RGV codebook parameters are chosen appropriately. We also prove that the exponent of a randomly chosen RGV code converges in probability to the typical error exponent; the lower tail is shown to decay exponentially while the upper tail decays double-exponentially above the expurgated exponent.
{"title":"Concentration Properties of Generalized Random Gilbert-Varshamov Codes","authors":"Lan V. Truong","doi":"10.1109/ITW55543.2023.10161687","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161687","url":null,"abstract":"We study the typical error exponent of constant composition generalized random Gilbert-Varshamov (RGV) codes over discrete memoryless channels (DMC) channels with generalized likelihood decoding. We show that the typical error exponent of the RGV ensemble is equal to the expurgated error exponent, provided that the RGV codebook parameters are chosen appropriately. We also prove that the exponent of a randomly chosen RGV code converges in probability to the typical error exponent; the lower tail is shown to decay exponentially while the upper tail decays double-exponentially above the expurgated exponent.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"12 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":"115838004","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}
Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161653
Jakob Maier, L. Massoulié
We consider the partial graph alignment problem on two correlated sparse Erdős–Rényi graphs with differing edge or node densities. Exploiting that these graphs are locally tree-like, we come to consider a hypothesis testing problem on correlated Galton-Watson trees. To solve this problem, we give several equivalent conditions for the existence of likelihood-ratio tests with vanishing type-I-error and significant power. We then show that these same conditions enable the partial graph alignment algorithm MPAlign to succeed.This paper generalizes recent results from Ganassali L., Massoulié L. and Lelarge M. to the asymmetric edge and node density case. This extension allows for greater applicability of the results and resolves a special case of the subgraph isomorphism problem.
{"title":"Asymmetric tree correlation testing for graph alignment","authors":"Jakob Maier, L. Massoulié","doi":"10.1109/ITW55543.2023.10161653","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161653","url":null,"abstract":"We consider the partial graph alignment problem on two correlated sparse Erdős–Rényi graphs with differing edge or node densities. Exploiting that these graphs are locally tree-like, we come to consider a hypothesis testing problem on correlated Galton-Watson trees. To solve this problem, we give several equivalent conditions for the existence of likelihood-ratio tests with vanishing type-I-error and significant power. We then show that these same conditions enable the partial graph alignment algorithm MPAlign to succeed.This paper generalizes recent results from Ganassali L., Massoulié L. and Lelarge M. to the asymmetric edge and node density case. This extension allows for greater applicability of the results and resolves a special case of the subgraph isomorphism problem.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"26 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":"114807645","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}
Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161644
Ke Wang, Zhifang Zhang
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.
{"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}
Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161608
Yi Liu, Julien Béguinot, Wei Cheng, S. Guilley, Loïc Masure, O. Rioul, François-Xavier Standaert
Embedded cryptographic devices are usually protected against side-channel attacks by masking strategies. In this paper, the security of protected cryptographic implementations is evaluated for any masking order, using alpha-information measures. Universal upper bounds on the probability of success of any type of side-channel attack are derived. These also provide lower bounds on the minimum number of queries required to achieve a given success rate. An important issue, solved in this paper, is to remove the loss factor due to the masking field size.
{"title":"Improved Alpha-Information Bounds for Higher-Order Masked Cryptographic Implementations","authors":"Yi Liu, Julien Béguinot, Wei Cheng, S. Guilley, Loïc Masure, O. Rioul, François-Xavier Standaert","doi":"10.1109/ITW55543.2023.10161608","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161608","url":null,"abstract":"Embedded cryptographic devices are usually protected against side-channel attacks by masking strategies. In this paper, the security of protected cryptographic implementations is evaluated for any masking order, using alpha-information measures. Universal upper bounds on the probability of success of any type of side-channel attack are derived. These also provide lower bounds on the minimum number of queries required to achieve a given success rate. An important issue, solved in this paper, is to remove the loss factor due to the masking field size.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"1 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":"127478953","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}
Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161633
Hui-An Shen, S. M. Moser, J. Pfister
We reformulate the Equal Coding Theorem in sensory neural encoding with ON- and OFF-neurons as a channel capacity problem. We then present a capacity-based proof of the Equal Coding Theorem, and generalize it to neurons with different firing probabilities. We also briefly discuss the biological implications of this generalization.
{"title":"A Generalization of the Equal Coding Theorem","authors":"Hui-An Shen, S. M. Moser, J. Pfister","doi":"10.1109/ITW55543.2023.10161633","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161633","url":null,"abstract":"We reformulate the Equal Coding Theorem in sensory neural encoding with ON- and OFF-neurons as a channel capacity problem. We then present a capacity-based proof of the Equal Coding Theorem, and generalize it to neurons with different firing probabilities. We also briefly discuss the biological implications of this generalization.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"89 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":"129134631","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}
Pub Date : 2023-04-23DOI: 10.1109/ITW55543.2023.10161665
K. Varma, K. Jagannathan
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.
{"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}
Given a prime L, we present a new construction of (L−1)-dimensional (k+r,k) systematic array codes with r ≤ 4, and concretely characterize sufficient conditions on the selection of L to guarantee the codes’ MDS property. The largest possible k that can be supported by the new MDS array codes is 2L−4, nearly twice as large as that supported by classical MDS array codes such as EVENODD codes and RDP codes. Moreover, the number of XORs per original data bit required in encoding of the new codes asymptotically approaches r with increasing k and L, same as EVENODD codes and RDP codes. In addition, for the case r = 4, the explicit conditions on L we obtain to guarantee the new codes’ MDS property can also be used to guarantee the MDS property of EVENODD codes and RDP codes, but are more general than the well known ones in the literature.
{"title":"New Construction of (k + r,k) Systematic MDS Array Codes with r ≤ 4","authors":"Zhe Zhai, Q. T. Sun, Sheng Jin, Shaoteng Liu, Xiangyu Chen","doi":"10.1109/ITW55543.2023.10161610","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161610","url":null,"abstract":"Given a prime L, we present a new construction of (L−1)-dimensional (k+r,k) systematic array codes with r ≤ 4, and concretely characterize sufficient conditions on the selection of L to guarantee the codes’ MDS property. The largest possible k that can be supported by the new MDS array codes is 2L−4, nearly twice as large as that supported by classical MDS array codes such as EVENODD codes and RDP codes. Moreover, the number of XORs per original data bit required in encoding of the new codes asymptotically approaches r with increasing k and L, same as EVENODD codes and RDP codes. In addition, for the case r = 4, the explicit conditions on L we obtain to guarantee the new codes’ MDS property can also be used to guarantee the MDS property of EVENODD codes and RDP codes, but are more general than the well known ones in the literature.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"46 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":"133232958","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：