Pub Date : 2022-06-26DOI: 10.48550/arXiv.2203.01418
Recep Can Yavas, V. Kostina, M. Effros
The channel coding problem in the moderate deviations regime is studied; here, the error probability sub-exponentially decays to zero, and the rate approaches the capacity slower than $O(1/sqrt n )$. The main result refines Altuğ and Wagner’s moderate deviations result by deriving lower and upper bounds on the third-order term in the asymptotic expansion of the maximum achievable message set size. The third-order term of the expansion employs a new quantity called the channel skewness. For the binary symmetric channel and most practically important (n,ϵ) pairs, including n ∈ [100, 500] and ϵ ∈ [10−10,10−1], an approximation up to the channel skewness is the most accurate among several expansions in the literature.
{"title":"Third-order Analysis of Channel Coding in the Moderate Deviations Regime","authors":"Recep Can Yavas, V. Kostina, M. Effros","doi":"10.48550/arXiv.2203.01418","DOIUrl":"https://doi.org/10.48550/arXiv.2203.01418","url":null,"abstract":"The channel coding problem in the moderate deviations regime is studied; here, the error probability sub-exponentially decays to zero, and the rate approaches the capacity slower than $O(1/sqrt n )$. The main result refines Altuğ and Wagner’s moderate deviations result by deriving lower and upper bounds on the third-order term in the asymptotic expansion of the maximum achievable message set size. The third-order term of the expansion employs a new quantity called the channel skewness. For the binary symmetric channel and most practically important (n,ϵ) pairs, including n ∈ [100, 500] and ϵ ∈ [10−10,10−1], an approximation up to the channel skewness is the most accurate among several expansions in the literature.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133403448","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 : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834447
Sarthak Jain, Martina Cardone, S. Mohajer
This paper considers a distributed computing framework, where the task of T matrix-vector products is distributed among n worker machines. External adversaries have access to a subset ℒ (the cardinality of which is |ℒ|) of these machines, and can maliciously perturb the result of each of their computations with probability α. To correctly recover each matrixvector product, the master has to identify a set (of a fixed cardinality) of ‘unattacked’ worker machines. Towards this end, this work proposes four schemes that aim at performing such an identification. These schemes are analyzed and compared under different regimes of (|ℒ|,α) for the two cases when |ℒ| is (1) known or (2) unknown at the master.
{"title":"Identifying Reliable Machines for Distributed Matrix-Vector Multiplication","authors":"Sarthak Jain, Martina Cardone, S. Mohajer","doi":"10.1109/ISIT50566.2022.9834447","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834447","url":null,"abstract":"This paper considers a distributed computing framework, where the task of T matrix-vector products is distributed among n worker machines. External adversaries have access to a subset ℒ (the cardinality of which is |ℒ|) of these machines, and can maliciously perturb the result of each of their computations with probability α. To correctly recover each matrixvector product, the master has to identify a set (of a fixed cardinality) of ‘unattacked’ worker machines. Towards this end, this work proposes four schemes that aim at performing such an identification. These schemes are analyzed and compared under different regimes of (|ℒ|,α) for the two cases when |ℒ| is (1) known or (2) unknown at the master.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814263","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 : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834619
Mingyang Zhu, Ming Jiang, Chunming Zhao
This paper presents a ternary message passing (TMP) decoding algorithm for product codes constructed from binary image Reed-Solomon (RS) codes and single-parity-check (SPC) codes. All exchanged messages among component decoders in TMP decoding take value from a ternary alphabet {–1, 0, +1}, which gives a potential for designing fast decoders. In particular, intersymbol interference (ISI) channels are considered due to their applications in many high-speed systems. Moreover, we propose the density evolution (DE) analysis for RS-SPC product codes over AWGN and ISI channels. The DE analyses and simulation results show RS-SPC product codes under TMP decoding performs well in various channels.
{"title":"Ternary Message Passing Decoding of RS-SPC Product Codes","authors":"Mingyang Zhu, Ming Jiang, Chunming Zhao","doi":"10.1109/ISIT50566.2022.9834619","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834619","url":null,"abstract":"This paper presents a ternary message passing (TMP) decoding algorithm for product codes constructed from binary image Reed-Solomon (RS) codes and single-parity-check (SPC) codes. All exchanged messages among component decoders in TMP decoding take value from a ternary alphabet {–1, 0, +1}, which gives a potential for designing fast decoders. In particular, intersymbol interference (ISI) channels are considered due to their applications in many high-speed systems. Moreover, we propose the density evolution (DE) analysis for RS-SPC product codes over AWGN and ISI channels. The DE analyses and simulation results show RS-SPC product codes under TMP decoding performs well in various channels.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"42 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114022872","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 : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834698
C. Hirche, Felix Leditzky
Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus a vast amount of literature is devoted to finding close and computable bounds on these capacities. We add a new viewpoint by giving operationally motivated bounds on several capacities, including the quantum capacity and private capacity of a channel and the one-way distillable entanglement and private key of a bipartite state. Our bounds themselves are generally given by certain capacities of the complementary channel or state. As a tool to obtain these bounds we discuss partial orders on quantum channels, such as the less noisy and the more capable order. Our bounds help to further understand the interplay between different capacities and give operational limitations on superadditivity properties and the difference between capacities. They can also be used as a new approach towards numerically bounding capacities, as discussed with some examples.
{"title":"Bounding quantum capacities via partial orders and complementarity","authors":"C. Hirche, Felix Leditzky","doi":"10.1109/ISIT50566.2022.9834698","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834698","url":null,"abstract":"Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus a vast amount of literature is devoted to finding close and computable bounds on these capacities. We add a new viewpoint by giving operationally motivated bounds on several capacities, including the quantum capacity and private capacity of a channel and the one-way distillable entanglement and private key of a bipartite state. Our bounds themselves are generally given by certain capacities of the complementary channel or state. As a tool to obtain these bounds we discuss partial orders on quantum channels, such as the less noisy and the more capable order. Our bounds help to further understand the interplay between different capacities and give operational limitations on superadditivity properties and the difference between capacities. They can also be used as a new approach towards numerically bounding capacities, as discussed with some examples.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121101396","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 : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834792
S. Enayati, D. Goeckel, A. Houmansadr, H. Pishro-Nik
Recently, we have proposed a model-free privacy-preserving mechanism (PPM) against attacks that compromise user privacy by matching patterns in data sequences to those that are unique to a given user [1]. Because the PPM is model-free, there are no requirements on the statistical model for the data, which is desirable when the model is not perfectly known. However, the proposed PPM did not enforce any constraints on the value to which a data point might be obfuscated, hence allowing an unlikely pattern that would make it easy for the adversary to detect which values have been obfuscated. In this paper, we consider a constrained PPM that enforces a continuity constraint so as to avoid abrupt jumps in the obfuscated data. To design such, we employ a graph-based analytical framework and the concept of consecutive patterns. At each point, the obfuscated data should be chosen strictly from that point’s neighbors. Unfortunately, this might undesirably increase the noise level employed in data obfuscation and hence unacceptably reduce utility. We propose a new obfuscation algorithm, namely the obfuscation-return algorithm, and characterize its privacy guarantees under continuity and noise level constraints.
{"title":"Constrained Obfuscation to Thwart Pattern Matching Attacks","authors":"S. Enayati, D. Goeckel, A. Houmansadr, H. Pishro-Nik","doi":"10.1109/ISIT50566.2022.9834792","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834792","url":null,"abstract":"Recently, we have proposed a model-free privacy-preserving mechanism (PPM) against attacks that compromise user privacy by matching patterns in data sequences to those that are unique to a given user [1]. Because the PPM is model-free, there are no requirements on the statistical model for the data, which is desirable when the model is not perfectly known. However, the proposed PPM did not enforce any constraints on the value to which a data point might be obfuscated, hence allowing an unlikely pattern that would make it easy for the adversary to detect which values have been obfuscated. In this paper, we consider a constrained PPM that enforces a continuity constraint so as to avoid abrupt jumps in the obfuscated data. To design such, we employ a graph-based analytical framework and the concept of consecutive patterns. At each point, the obfuscated data should be chosen strictly from that point’s neighbors. Unfortunately, this might undesirably increase the noise level employed in data obfuscation and hence unacceptably reduce utility. We propose a new obfuscation algorithm, namely the obfuscation-return algorithm, and characterize its privacy guarantees under continuity and noise level constraints.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116170823","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 : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834515
Pin-Chieh Tseng, C. Lai, Wei-Hsuan Yu
We study the maximum size of a binary code A(n, d) with code length n and minimum distance d. Schrijver studied the Terwilliger algebra of the Hamming scheme and proposed a semidefinite program to upper bound A(n, d). We derive additional semidefinite constraints based on a split Terwilliger algebra so that Schrijver’s semidefinite programming bounds on A(n, d) can be improved. In particular, we show that A(18, 4) ≤ 6551 and A(19, 4) 13087.
{"title":"Improved semidefinite programming bounds for binary codes by split distance enumerations","authors":"Pin-Chieh Tseng, C. Lai, Wei-Hsuan Yu","doi":"10.1109/ISIT50566.2022.9834515","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834515","url":null,"abstract":"We study the maximum size of a binary code A(n, d) with code length n and minimum distance d. Schrijver studied the Terwilliger algebra of the Hamming scheme and proposed a semidefinite program to upper bound A(n, d). We derive additional semidefinite constraints based on a split Terwilliger algebra so that Schrijver’s semidefinite programming bounds on A(n, d) can be improved. In particular, we show that A(18, 4) ≤ 6551 and A(19, 4) 13087.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114643549","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 : 2022-06-26DOI: 10.48550/arXiv.2207.00959
K. Mishra, Samuel Pinilla, A. Pezeshki, A. Calderbank
We investigate the theory of affine groups in the context of designing radar waveforms that obey the desired wideband ambiguity function (WAF). The WAF is obtained by correlating the signal with its time-dilated, Doppler-shifted, and delayed replicas. We consider the WAF definition as a coefficient function of the unitary representation of the group a • x + b. This is essentially an algebraic problem applied to the radar waveform design. Prior works on this subject largely analyzed narrow-band ambiguity functions. Here, we show that when the underlying wideband signal of interest is a pulse or pulse train, a tight frame can be built to design that waveform. Specifically, we design the radar signals by minimizing the ratio of bounding constants of the frame in order to obtain lower sidelobes in the WAF. This minimization is performed by building a codebook based on difference sets in order to achieve the Welch bound. We show that the tight frame so obtained is connected with the wavelet transform that defines the WAF.
{"title":"Group-Theoretic Wideband Radar Waveform Design","authors":"K. Mishra, Samuel Pinilla, A. Pezeshki, A. Calderbank","doi":"10.48550/arXiv.2207.00959","DOIUrl":"https://doi.org/10.48550/arXiv.2207.00959","url":null,"abstract":"We investigate the theory of affine groups in the context of designing radar waveforms that obey the desired wideband ambiguity function (WAF). The WAF is obtained by correlating the signal with its time-dilated, Doppler-shifted, and delayed replicas. We consider the WAF definition as a coefficient function of the unitary representation of the group a • x + b. This is essentially an algebraic problem applied to the radar waveform design. Prior works on this subject largely analyzed narrow-band ambiguity functions. Here, we show that when the underlying wideband signal of interest is a pulse or pulse train, a tight frame can be built to design that waveform. Specifically, we design the radar signals by minimizing the ratio of bounding constants of the frame in order to obtain lower sidelobes in the WAF. This minimization is performed by building a codebook based on difference sets in order to achieve the Welch bound. We show that the tight frame so obtained is connected with the wavelet transform that defines the WAF.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114729974","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 : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834402
Maxim Goukhshtein, S. Draper, J. Mitra
Probabilistic shaping methods induce a desired nonuniform distribution on the transmitted symbols in order to realize a favorable trade-off between the communication rate and average transmission energy. In this work, we study a probabilistic shaping architecture wherein the central component is a binary linear code, employed as a lossy source code. The rate-distortion performance of the linear code directly determines the realized shaping rate-energy performance. We use this connection to establish the rate-energy optimality of the investigated shaping architecture. Although the primary focus of this paper is on shaping for two-symbol alphabets, extensions to non-binary alphabets will be briefly discussed.
{"title":"Rate-Energy Optimal Probabilistic Shaping Using Linear Codes","authors":"Maxim Goukhshtein, S. Draper, J. Mitra","doi":"10.1109/ISIT50566.2022.9834402","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834402","url":null,"abstract":"Probabilistic shaping methods induce a desired nonuniform distribution on the transmitted symbols in order to realize a favorable trade-off between the communication rate and average transmission energy. In this work, we study a probabilistic shaping architecture wherein the central component is a binary linear code, employed as a lossy source code. The rate-distortion performance of the linear code directly determines the realized shaping rate-energy performance. We use this connection to establish the rate-energy optimality of the investigated shaping architecture. Although the primary focus of this paper is on shaping for two-symbol alphabets, extensions to non-binary alphabets will be briefly discussed.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115327467","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 : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834437
K. Iwata, Hirosuke Yamamoto
We propose a joint coding scheme using multiple code tables to efficiently transmit a sequence of messages of a discrete memoryless source (DMS) through a finite-state noiseless channel with unequal costs of code letters, which includes a noiseless (d, k)-constrained channel as a particular case. This paper presents a methodology for code design based on two methods. The first method, integer programming, is used to optimize a prefix-free code at each channel state when codeword costs are unequal and vary with each state. The second method is an iterative optimization that minimizes the average cost of the joint coding scheme using multiple code tables. The proposed coding scheme achieves the optimal average cost in the class of joint coding schemes using multiple code tables of prefix-free codes for a given pair of DMS and finite-state channel.
{"title":"Joint Coding for Discrete Sources and Finite-State Noiseless Channels","authors":"K. Iwata, Hirosuke Yamamoto","doi":"10.1109/ISIT50566.2022.9834437","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834437","url":null,"abstract":"We propose a joint coding scheme using multiple code tables to efficiently transmit a sequence of messages of a discrete memoryless source (DMS) through a finite-state noiseless channel with unequal costs of code letters, which includes a noiseless (d, k)-constrained channel as a particular case. This paper presents a methodology for code design based on two methods. The first method, integer programming, is used to optimize a prefix-free code at each channel state when codeword costs are unequal and vary with each state. The second method is an iterative optimization that minimizes the average cost of the joint coding scheme using multiple code tables. The proposed coding scheme achieves the optimal average cost in the class of joint coding schemes using multiple code tables of prefix-free codes for a given pair of DMS and finite-state channel.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121482838","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 : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834607
Xi Zhang, Qixuan Zhu, H. Poor
While the fifth generation (5G) of wireless networks is currently being rolled out, wireless networks still need further development to meet the requirements of dramatically increasing numbers of users and new applications and the resulting traffic expected in the coming decade and beyond. The sixth generation (6G) of wireless networks is envisioned to respond to this by providing services with massive access, ultra-reliability, low latency, intelligence, and security while maximizing the spectral/energy/cost efficiency. Unmanned aerial vehicles (UAVs) have attracted considerable research attention due to their mobility and ability to line-of-sight (LoS) coverage in areas that suffer from low channel quality. However, how to characterize a UAV’s coverage area is a challenging problem and has not been thoroughly studied. To address this issue, in this paper we investigate the coverage performance of base station (BS) to UAV communications with a number of interfering mobile users. We first establish a Nakagami-m fading channel model for BS-toUAV wireless communications. Then, we derive a closed-form expression for the UAV’s average coverage probability under the scenario of interfering mobile users. Finally, numerical results confirm our derived analytical results and evaluate the UAV’s performance under different scenarios that anticipate 6G wireless networking models.
{"title":"Average Coverage Probability for Base-Station-to-UAV Communications Over 6G Multiple Access Wireless Networks","authors":"Xi Zhang, Qixuan Zhu, H. Poor","doi":"10.1109/ISIT50566.2022.9834607","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834607","url":null,"abstract":"While the fifth generation (5G) of wireless networks is currently being rolled out, wireless networks still need further development to meet the requirements of dramatically increasing numbers of users and new applications and the resulting traffic expected in the coming decade and beyond. The sixth generation (6G) of wireless networks is envisioned to respond to this by providing services with massive access, ultra-reliability, low latency, intelligence, and security while maximizing the spectral/energy/cost efficiency. Unmanned aerial vehicles (UAVs) have attracted considerable research attention due to their mobility and ability to line-of-sight (LoS) coverage in areas that suffer from low channel quality. However, how to characterize a UAV’s coverage area is a challenging problem and has not been thoroughly studied. To address this issue, in this paper we investigate the coverage performance of base station (BS) to UAV communications with a number of interfering mobile users. We first establish a Nakagami-m fading channel model for BS-toUAV wireless communications. Then, we derive a closed-form expression for the UAV’s average coverage probability under the scenario of interfering mobile users. Finally, numerical results confirm our derived analytical results and evaluate the UAV’s performance under different scenarios that anticipate 6G wireless networking models.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123286979","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
扫码关注我们
求助内容：
应助结果提醒方式：