Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834363
Ankit Pensia, Po-Ling Loh, Varun Jog
We study simple binary hypothesis testing under communication constraints, a.k.a. “decentralized detection”. Here, each sample is mapped to a message from a finite set of messages via a channel before being revealed to a statistician. In the absence of communication constraints, it is well known that the sample complexity is characterized by the Hellinger distance between the distributions. We show that the sample complexity of hypothesis testing under communication constraints is at most a logarithmic factor larger than in the unconstrained setting, and demonstrate that distributions exist in which this characterization is tight. We also provide a polynomial-time algorithm which achieves the aforementioned sample complexity. Our proofs rely on a new reverse data processing inequality and a reverse Markov’s inequality, which may be of independent interest.
{"title":"Simple Binary Hypothesis Testing under Communication Constraints","authors":"Ankit Pensia, Po-Ling Loh, Varun Jog","doi":"10.1109/ISIT50566.2022.9834363","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834363","url":null,"abstract":"We study simple binary hypothesis testing under communication constraints, a.k.a. “decentralized detection”. Here, each sample is mapped to a message from a finite set of messages via a channel before being revealed to a statistician. In the absence of communication constraints, it is well known that the sample complexity is characterized by the Hellinger distance between the distributions. We show that the sample complexity of hypothesis testing under communication constraints is at most a logarithmic factor larger than in the unconstrained setting, and demonstrate that distributions exist in which this characterization is tight. We also provide a polynomial-time algorithm which achieves the aforementioned sample complexity. Our proofs rely on a new reverse data processing inequality and a reverse Markov’s inequality, which may be of independent interest.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"43 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":"114866545","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.9834393
Wen-Yao Chen, Chung-Chin Lu
The problem of constructing polar codes is equivalent to selecting good channels among a set of bit-channels with output alphabet size grows exponentially. To solve the problem, Tal and Vardy proposed a channel quantization algorithm to approximate the original channel by channels with less output symbols. Based on Arıkan’s original work, we derived a matrix form of channel transformation. This formulation automatically merges suitable output symbols, thus reducing the step of preprocessing complexity in Tal and Vardy’s algorithm.
{"title":"On the Bit-Channels for Channel Polarization","authors":"Wen-Yao Chen, Chung-Chin Lu","doi":"10.1109/ISIT50566.2022.9834393","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834393","url":null,"abstract":"The problem of constructing polar codes is equivalent to selecting good channels among a set of bit-channels with output alphabet size grows exponentially. To solve the problem, Tal and Vardy proposed a channel quantization algorithm to approximate the original channel by channels with less output symbols. Based on Arıkan’s original work, we derived a matrix form of channel transformation. This formulation automatically merges suitable output symbols, thus reducing the step of preprocessing complexity in Tal and Vardy’s algorithm.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"1 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":"131960355","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.9834611
T. V. Bui, Y. M. Chee, J. Scarlett, Van Khu Vu
The main goal of group testing is to identify a small number of positive items among a large population of n items. In this work, we consider a new model of group testing in which the input items are linearly ordered, and the positives are subsets of small blocks (at unknown locations) of consecutive items over that order. When the number of blocks is at least one and at most k, and the number of items in a block is at most d, we show that there exists a deterministic and explicit design that can identify the positives with O(k2d log (n/d)) tests in O(poly(k, n/d)+kd) time. The number of tests in our proposed design is less than that of in standard combinatorial group testing by a factor of at least d/ log (kd). We also show that there exists a randomized design that can identify the positives with O(k(log (n/d)+d log k)) tests in O(k(log2 (n/d)+k log k+d log k)) time with high probability.
{"title":"Group Testing with Blocks of Positives","authors":"T. V. Bui, Y. M. Chee, J. Scarlett, Van Khu Vu","doi":"10.1109/ISIT50566.2022.9834611","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834611","url":null,"abstract":"The main goal of group testing is to identify a small number of positive items among a large population of n items. In this work, we consider a new model of group testing in which the input items are linearly ordered, and the positives are subsets of small blocks (at unknown locations) of consecutive items over that order. When the number of blocks is at least one and at most k, and the number of items in a block is at most d, we show that there exists a deterministic and explicit design that can identify the positives with O(k2d log (n/d)) tests in O(poly(k, n/d)+kd) time. The number of tests in our proposed design is less than that of in standard combinatorial group testing by a factor of at least d/ log (kd). We also show that there exists a randomized design that can identify the positives with O(k(log (n/d)+d log k)) tests in O(k(log2 (n/d)+k log k+d log k)) time with high probability.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"1 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":"130161292","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.9834478
G. Hosoya
This study focuses on delayed bit-interleaved coded modulation (DBICM) for a two-dimensional signal constellation and shows that the capacity of DBICM is identical to the coded modulation capacity with less delay than before. An appropriate bit-labeling scheme based on Gray labeling for each signal point is also considered to prevent the performance degradation of DBICM. The results of the numerical calculations and simulations indicate that the proposed method improves performance.
{"title":"Reduction of Delay for Delayed Bit-Interleaved Coded Modulation","authors":"G. Hosoya","doi":"10.1109/ISIT50566.2022.9834478","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834478","url":null,"abstract":"This study focuses on delayed bit-interleaved coded modulation (DBICM) for a two-dimensional signal constellation and shows that the capacity of DBICM is identical to the coded modulation capacity with less delay than before. An appropriate bit-labeling scheme based on Gray labeling for each signal point is also considered to prevent the performance degradation of DBICM. The results of the numerical calculations and simulations indicate that the proposed method improves performance.","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":"130170677","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.9834578
A. Nouri, R. Asvadi
A two-stage coding scheme is proposed for reliable and secure transmission over intersymbol interference wiretap channels (ISI-WTCs). It is shown that the ultimate bound on the secure rate of linear block codes over ISI-WTCs is achieved by an independent and uniformly distributed (i.u.d.) input process. Aiming to exceed the i.u.d. secure rate, the proposed scheme comprises the concatenation of an inner trellis code and an outer coset code. The inner stage emulates a Markov process for achieving the constrained secrecy capacity of the ISI-WTC. In contrast, the outer stage vanishes an obtained upper bound on the rate of information leakage toward satisfying the so-called weak secrecy criterion. A carefully modified density evolution confirms the secrecy and the reliability efficiency of the proposed coding scheme at secure rates close to the constrained secrecy capacity.
{"title":"Matched Information Rate Codes for Binary-Input Intersymbol Interference Wiretap Channels","authors":"A. Nouri, R. Asvadi","doi":"10.1109/ISIT50566.2022.9834578","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834578","url":null,"abstract":"A two-stage coding scheme is proposed for reliable and secure transmission over intersymbol interference wiretap channels (ISI-WTCs). It is shown that the ultimate bound on the secure rate of linear block codes over ISI-WTCs is achieved by an independent and uniformly distributed (i.u.d.) input process. Aiming to exceed the i.u.d. secure rate, the proposed scheme comprises the concatenation of an inner trellis code and an outer coset code. The inner stage emulates a Markov process for achieving the constrained secrecy capacity of the ISI-WTC. In contrast, the outer stage vanishes an obtained upper bound on the rate of information leakage toward satisfying the so-called weak secrecy criterion. A carefully modified density evolution confirms the secrecy and the reliability efficiency of the proposed coding scheme at secure rates close to the constrained secrecy capacity.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"34 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":"134016937","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.9834848
Zhuangfei Wu, Lin Bai, Lin Zhou
This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. We derive achievability results on large deviations for mismatched successive refinement where one uses random i.i.d. Gaussian codebooks and minimum Euclidean distance encoding to compress an arbitrary memoryless source. Specifically, we consider both separate and joint excess-distortion criterion and derive achievable error exponents for both cases. Under the mismatched coding scheme, we show that the exponent of the joint excess-distortion probability equals the exponent of one of the separate excess-distortion probabilities, depending on the compression rate of the second encoder only. When specialized to a Gaussian memoryless source (GMS), we obtain the first achievable error exponent region. However, in contrast to the second-order asymptotics and to the large deviations for mismatched rate-distortion, the specialized result for GMS is not optimal. Further investigations are required to close the gap.
这篇论文有资格获得Jack Keil Wolf ISIT学生论文奖。我们推导了在大偏差下不匹配连续细化的可实现性结果，其中使用随机i.i.d高斯码本和最小欧几里得距离编码来压缩任意无内存源。具体地说，我们考虑了单独和联合的过度畸变判据，并推导了两种情况下可实现的误差指数。在不匹配编码方案下，我们证明了联合过度失真概率的指数等于单独过度失真概率之一的指数，仅依赖于第二个编码器的压缩率。当对高斯无记忆源(GMS)进行专门化处理时，我们得到了第一个可实现的误差指数区域。然而，与二阶渐近和不匹配率失真的大偏差相比，GMS的专门化结果不是最优的。需要进一步的调查来缩小差距。
{"title":"Excess-Distortion Exponents for Successive Refinement Using Gaussian Codebooks","authors":"Zhuangfei Wu, Lin Bai, Lin Zhou","doi":"10.1109/ISIT50566.2022.9834848","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834848","url":null,"abstract":"This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. We derive achievability results on large deviations for mismatched successive refinement where one uses random i.i.d. Gaussian codebooks and minimum Euclidean distance encoding to compress an arbitrary memoryless source. Specifically, we consider both separate and joint excess-distortion criterion and derive achievable error exponents for both cases. Under the mismatched coding scheme, we show that the exponent of the joint excess-distortion probability equals the exponent of one of the separate excess-distortion probabilities, depending on the compression rate of the second encoder only. When specialized to a Gaussian memoryless source (GMS), we obtain the first achievable error exponent region. However, in contrast to the second-order asymptotics and to the large deviations for mismatched rate-distortion, the specialized result for GMS is not optimal. Further investigations are required to close the gap.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"20 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":"134595376","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.9834501
I. Bocharova, H. Hollmann, Karan Khathuria, B. Kudryashov, Vitaly Skachek
In some lattice-based cryptosystems, the encryption and decryption processes can be interpreted as a noisy communication channel. In this work, we focus on cryptosystems based on the ring learning with errors (RLWE) and module learning with errors (MLWE) problems, e.g. Kyber. We provide new coding schemes for the communication channel involved in these cryptosystems. For encoding we use an error-correction code (ECC) along with modulo Q pulse amplitude modulation (PAM) (for some fixed small prime power Q), and vector dequantization. For decoding we perform vector quantization followed by hard/soft decision decoding (HDD/SDD) for the ECC. This construction provides remarkable reduction in the decryption failure rate (DFR), compared to some earlier proposed coding schemes for the same bitrate. For example, in Kyber encryption scheme, we reduce the DFR from 2−174 (uncoded) to 2−1325 (using HDD) or 2−1414 (using SDD).
{"title":"Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel","authors":"I. Bocharova, H. Hollmann, Karan Khathuria, B. Kudryashov, Vitaly Skachek","doi":"10.1109/ISIT50566.2022.9834501","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834501","url":null,"abstract":"In some lattice-based cryptosystems, the encryption and decryption processes can be interpreted as a noisy communication channel. In this work, we focus on cryptosystems based on the ring learning with errors (RLWE) and module learning with errors (MLWE) problems, e.g. Kyber. We provide new coding schemes for the communication channel involved in these cryptosystems. For encoding we use an error-correction code (ECC) along with modulo Q pulse amplitude modulation (PAM) (for some fixed small prime power Q), and vector dequantization. For decoding we perform vector quantization followed by hard/soft decision decoding (HDD/SDD) for the ECC. This construction provides remarkable reduction in the decryption failure rate (DFR), compared to some earlier proposed coding schemes for the same bitrate. For example, in Kyber encryption scheme, we reduce the DFR from 2−174 (uncoded) to 2−1325 (using HDD) or 2−1414 (using SDD).","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"519 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":"134371967","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.9834509
Jennifer Tang, Yury Polyanskiy
We establish the capacity of a class of communication channels introduced in [2]. The n-letter input from a finite alphabet is passed through a discrete memoryless channel PZ|X and then the output n-letter sequence is uniformly permuted. We show that the maximal communication rate (normalized by log n) equals $frac{1}{2}left( {operatorname{rank} left( {{P_{Zmid X}}} right) - 1} right)$ whenever PZ|X is strictly positive. This is done by establishing a converse bound matching the achievability of [2]. The two main ingredients of our proof are (1) a sharp bound on the entropy of a uniformly sampled vector from a type class and observed through a DMC; and (2) the covering ε-net of a probability simplex with Kullback-Leibler divergence as a metric. In addition to strictly positive DMC we also find the noisy permutation capacity for q-ary erasure channels, the Z-channel and others.
{"title":"Capacity of Noisy Permutation Channels","authors":"Jennifer Tang, Yury Polyanskiy","doi":"10.1109/ISIT50566.2022.9834509","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834509","url":null,"abstract":"We establish the capacity of a class of communication channels introduced in [2]. The n-letter input from a finite alphabet is passed through a discrete memoryless channel PZ|X and then the output n-letter sequence is uniformly permuted. We show that the maximal communication rate (normalized by log n) equals $frac{1}{2}left( {operatorname{rank} left( {{P_{Zmid X}}} right) - 1} right)$ whenever PZ|X is strictly positive. This is done by establishing a converse bound matching the achievability of [2]. The two main ingredients of our proof are (1) a sharp bound on the entropy of a uniformly sampled vector from a type class and observed through a DMC; and (2) the covering ε-net of a probability simplex with Kullback-Leibler divergence as a metric. In addition to strictly positive DMC we also find the noisy permutation capacity for q-ary erasure channels, the Z-channel and others.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"189 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":"131494638","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.9834812
Michael Dikshtein, N. Weinberger, S. Shamai
Motivated by the emerging technology of oblivious processing in remote radio heads with universal decoders, we formulate and analyze in this paper a compound version of the information bottleneck problem. In this problem, a Markov chain X→Y→ Z is assumed, and the marginals PX and PY are set. The mutual information between X and Z is sought to be maximized over the choice of the conditional probability of Z given Y from a given class, under the worst choice of the joint probability of the pair (X,Y) from a different class. We provide values, bounds, and various characterizations for specific instances of this problem: the binary symmetric case, the scalar Gaussian case, the vector Gaussian case, the symmetric modulo-additive case, and the total variation constraints case. Finally, for the general case, we propose a Blahut-Arimoto type of alternating iterations algorithm to find a consistent solution to this problem.
{"title":"The Compound Information Bottleneck Program","authors":"Michael Dikshtein, N. Weinberger, S. Shamai","doi":"10.1109/ISIT50566.2022.9834812","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834812","url":null,"abstract":"Motivated by the emerging technology of oblivious processing in remote radio heads with universal decoders, we formulate and analyze in this paper a compound version of the information bottleneck problem. In this problem, a Markov chain X→Y→ Z is assumed, and the marginals PX and PY are set. The mutual information between X and Z is sought to be maximized over the choice of the conditional probability of Z given Y from a given class, under the worst choice of the joint probability of the pair (X,Y) from a different class. We provide values, bounds, and various characterizations for specific instances of this problem: the binary symmetric case, the scalar Gaussian case, the vector Gaussian case, the symmetric modulo-additive case, and the total variation constraints case. Finally, for the general case, we propose a Blahut-Arimoto type of alternating iterations algorithm to find a consistent solution to this problem.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"37 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":"127567040","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.9834857
Yan Hao Ling, J. Scarlett
In this paper, we study the problem of relaying a single bit of information across a series of binary symmetric channels, and the associated trade-off between the number of hops m, the transmission time n, and the error probability. We introduce a simple, efficient, and deterministic protocol that attains positive information velocity (i.e., a non-vanishing ratio $frac{m}{n}$ and small error probability) and is significantly simpler than existing protocols that do so. In addition, we characterize the optimal low-noise and high-noise scaling laws of the information velocity, and we adapt our 1-bit protocol to transmit k bits over m hops with ${mathcal{O}}(m + k)$ transmission time.
{"title":"A Simple Coding Scheme Attaining Positive Information Velocity","authors":"Yan Hao Ling, J. Scarlett","doi":"10.1109/ISIT50566.2022.9834857","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834857","url":null,"abstract":"In this paper, we study the problem of relaying a single bit of information across a series of binary symmetric channels, and the associated trade-off between the number of hops m, the transmission time n, and the error probability. We introduce a simple, efficient, and deterministic protocol that attains positive information velocity (i.e., a non-vanishing ratio $frac{m}{n}$ and small error probability) and is significantly simpler than existing protocols that do so. In addition, we characterize the optimal low-noise and high-noise scaling laws of the information velocity, and we adapt our 1-bit protocol to transmit k bits over m hops with ${mathcal{O}}(m + k)$ transmission time.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"35 6 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":"115642636","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
扫码关注我们
求助内容：
应助结果提醒方式：