Pub Date : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174058
T. Lau, C. H. Tan
We propose a rank metric code-based signature scheme constructed via the Schnorr approach. We define a new problem in rank metric coding theory, namely the Rank Vector Decomposition problem and analyze its solving complexity. The hardness of our signature scheme is based on the Rank Syndrome Decoding problem, Rank Support Basis Decomposition problem and Rank Vector Decomposition problem. We also give detailed analysis for the structural security of our signature scheme. Then, we provide parameters for our constructed signature scheme and compare our scheme with other existing secure rank metric signature schemes. Our signature scheme requires only public key size of 443 bytes and signature size of 4.03 kilobytes for 128-bit security level.
{"title":"Rank Preserving Code-based Signature","authors":"T. Lau, C. H. Tan","doi":"10.1109/ISIT44484.2020.9174058","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174058","url":null,"abstract":"We propose a rank metric code-based signature scheme constructed via the Schnorr approach. We define a new problem in rank metric coding theory, namely the Rank Vector Decomposition problem and analyze its solving complexity. The hardness of our signature scheme is based on the Rank Syndrome Decoding problem, Rank Support Basis Decomposition problem and Rank Vector Decomposition problem. We also give detailed analysis for the structural security of our signature scheme. Then, we provide parameters for our constructed signature scheme and compare our scheme with other existing secure rank metric signature schemes. Our signature scheme requires only public key size of 443 bytes and signature size of 4.03 kilobytes for 128-bit security level.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73675064","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}
Buddhism is sometimes characterized as having an inclusivist attitude to the religious Other. In the second decade of the twenty-first century, however, an exclusivist approach to the religious Other emerged in Sri Lanka. Using the case study of a Buddhist temple in Dambulla, this article examines the conditioning factors behind this phenomenon. It is divided into four sections. The first examines recent theoretical approaches to Buddhism and inter-religious encounter, and argues that a spectrum of Buddhist approaches to the Other has long been present in text and tradition. The second offers background information about the Dambulla temple and its leading monk, Inamuluwe Sumangala Thero. The third explores three representations of the mosque attack, those of Sumangala, the Hindus of Dambulla, and secular analysts. The fourth suggests three conditioning factors for the dominance of Sumangala’s representation and the emergence of what could be considered an uncharacteristically exclusivist Buddhist approach to the religious Other within South Asian Buddhism.
{"title":"Buddhism and the Religious Other","authors":"E. Harris","doi":"10.1558/isit.40147","DOIUrl":"https://doi.org/10.1558/isit.40147","url":null,"abstract":"Buddhism is sometimes characterized as having an inclusivist attitude to the religious Other. In the second decade of the twenty-first century, however, an exclusivist approach to the religious Other emerged in Sri Lanka. Using the case study of a Buddhist temple in Dambulla, this article examines the conditioning factors behind this phenomenon. It is divided into four sections. The first examines recent theoretical approaches to Buddhism and inter-religious encounter, and argues that a spectrum of Buddhist approaches to the Other has long been present in text and tradition. The second offers background information about the Dambulla temple and its leading monk, Inamuluwe Sumangala Thero. The third explores three representations of the mosque attack, those of Sumangala, the Hindus of Dambulla, and secular analysts. The fourth suggests three conditioning factors for the dominance of Sumangala’s representation and the emergence of what could be considered an uncharacteristically exclusivist Buddhist approach to the religious Other within South Asian Buddhism.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91397520","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 : 2018-06-01DOI: 10.1109/ISIT.2018.8437697
P. Harrcmoes
Statistical inference may follow a frequentist approach or it may follow a Bayesian approach or it may use the minimum description length principle (MDL). Our goal is to identify situations in which these different approaches to statistical inference coincide. It is proved that for exponential families MDL and Bayesian inference coincide if and only if the renormalized saddle point approximation for the conjugated exponential family is exact. For 1-dimensional exponential families the only families with exact renormalized saddle point approximations are the Gaussian location family, the Gamma family and the inverse Gaussian family. They are conjugated families of the Gaussian location family, the Gamma family and the Poisson-exponential family. The first two families are self-conjugated implying that only for the two first families the Bayesian approach is consistent with the frequentist approach. In higher dimensions there are more examples.
{"title":"Statistical Inference and Exact Saddle Point Approximations","authors":"P. Harrcmoes","doi":"10.1109/ISIT.2018.8437697","DOIUrl":"https://doi.org/10.1109/ISIT.2018.8437697","url":null,"abstract":"Statistical inference may follow a frequentist approach or it may follow a Bayesian approach or it may use the minimum description length principle (MDL). Our goal is to identify situations in which these different approaches to statistical inference coincide. It is proved that for exponential families MDL and Bayesian inference coincide if and only if the renormalized saddle point approximation for the conjugated exponential family is exact. For 1-dimensional exponential families the only families with exact renormalized saddle point approximations are the Gaussian location family, the Gamma family and the inverse Gaussian family. They are conjugated families of the Gaussian location family, the Gamma family and the Poisson-exponential family. The first two families are self-conjugated implying that only for the two first families the Bayesian approach is consistent with the frequentist approach. In higher dimensions there are more examples.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78425236","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 : 2017-01-16DOI: 10.1109/ISIT.2017.8007115
Rajai Nasser
Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet X and output alphabet Y can be naturally endowed with the quotient of the Euclidean topology by the equivalence relation. We show that this topology is compact, path-connected and metrizable. A topology on the space of equivalent channels with fixed input alphabet X and arbitrary but finite output alphabet is said to be natural if and only if it induces the quotient topology on the subspaces of equivalent channels sharing the same output alphabet. We show that every natural topology is σ-compact, separable and path-connected. On the other hand, if |X| ≥ 2, a Hausdorff natural topology is not Baire and it is not locally compact anywhere. This implies that no natural topology can be completely metrized if |X| ≥ 2. The finest natural topology, which we call the strong topology, is shown to be compactly generated, sequential and T 4 . On the other hand, the strong topology is not first-countable anywhere, hence it is not metrizable. We show that in the strong topology, a subspace is compact if and only if it is rank-bounded and strongly-closed. We provide a necessary and sufficient condition for a sequence of channels to converge in the strong topology. We introduce a metric distance on the space of equivalent channels which compares the noise levels between channels. The induced metric topology, which we call the noisiness topology, is shown to be natural. We also study topologies that are inherited from the space of meta-probability measures by identifying channels with their Blackwell measures. We show that the weak-∗ topology is exactly the same as the noisiness topology and hence it is natural. We prove that if |X| ≥ 2, the total variation topology is not natural nor Baire, hence it is not completely metrizable. Moreover, it is not locally compact anywhere. Finally, we show that the Borel σ-algebra is the same for all Hausdorff natural topologies.
{"title":"Topological structures on DMC spaces","authors":"Rajai Nasser","doi":"10.1109/ISIT.2017.8007115","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8007115","url":null,"abstract":"Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet X and output alphabet Y can be naturally endowed with the quotient of the Euclidean topology by the equivalence relation. We show that this topology is compact, path-connected and metrizable. A topology on the space of equivalent channels with fixed input alphabet X and arbitrary but finite output alphabet is said to be natural if and only if it induces the quotient topology on the subspaces of equivalent channels sharing the same output alphabet. We show that every natural topology is σ-compact, separable and path-connected. On the other hand, if |X| ≥ 2, a Hausdorff natural topology is not Baire and it is not locally compact anywhere. This implies that no natural topology can be completely metrized if |X| ≥ 2. The finest natural topology, which we call the strong topology, is shown to be compactly generated, sequential and T 4 . On the other hand, the strong topology is not first-countable anywhere, hence it is not metrizable. We show that in the strong topology, a subspace is compact if and only if it is rank-bounded and strongly-closed. We provide a necessary and sufficient condition for a sequence of channels to converge in the strong topology. We introduce a metric distance on the space of equivalent channels which compares the noise levels between channels. The induced metric topology, which we call the noisiness topology, is shown to be natural. We also study topologies that are inherited from the space of meta-probability measures by identifying channels with their Blackwell measures. We show that the weak-∗ topology is exactly the same as the noisiness topology and hence it is natural. We prove that if |X| ≥ 2, the total variation topology is not natural nor Baire, hence it is not completely metrizable. Moreover, it is not locally compact anywhere. Finally, we show that the Borel σ-algebra is the same for all Hausdorff natural topologies.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89048546","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 : 2016-10-31DOI: 10.1109/ISIT.2017.8006556
C. Tian
We considered the optimal memory-transmission-rate tradeoff of caching systems. Different from the conventional analytical approach usually seen in the information theory literature, we rely on a computer-aided approach in this investigation. The linear programming (LP) outer bound of the entropy space serves as the starting point of this approach, however our effort goes significantly beyond using it to prove information inequalities. We first identify and formalize the symmetry structure in the problem, which enables us to show the existence of optimal symmetric solutions. A symmetry-reduced linear program is then used to identify the boundary of the memory-transmission-rate tradeoff for several simple cases, for which we obtain a set of tight outer bounds. General hypotheses on the optimal tradeoff region are formed from these computed data, which are then analytically proved. This leads to a complete characterization of the optimal tradeoff for systems with only two users, and certain partial characterization for systems with only two files. Next, we show that by carefully analyzing the joint entropy structure of the outer bounds for certain cases, a novel code construction can be reverse-engineered, which eventually leads to a general class of codes. Finally, we show that strong outer bounds can be computed through strategically relaxing the LP. This allows us firstly to deduce generic characteristic of the converse proof, and secondly to compute outer bounds for larger problem cases, despite the seemingly impossible computation scale.
{"title":"A computer-aided investigation on the fundamental limits of caching","authors":"C. Tian","doi":"10.1109/ISIT.2017.8006556","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8006556","url":null,"abstract":"We considered the optimal memory-transmission-rate tradeoff of caching systems. Different from the conventional analytical approach usually seen in the information theory literature, we rely on a computer-aided approach in this investigation. The linear programming (LP) outer bound of the entropy space serves as the starting point of this approach, however our effort goes significantly beyond using it to prove information inequalities. We first identify and formalize the symmetry structure in the problem, which enables us to show the existence of optimal symmetric solutions. A symmetry-reduced linear program is then used to identify the boundary of the memory-transmission-rate tradeoff for several simple cases, for which we obtain a set of tight outer bounds. General hypotheses on the optimal tradeoff region are formed from these computed data, which are then analytically proved. This leads to a complete characterization of the optimal tradeoff for systems with only two users, and certain partial characterization for systems with only two files. Next, we show that by carefully analyzing the joint entropy structure of the outer bounds for certain cases, a novel code construction can be reverse-engineered, which eventually leads to a general class of codes. Finally, we show that strong outer bounds can be computed through strategically relaxing the LP. This allows us firstly to deduce generic characteristic of the converse proof, and secondly to compute outer bounds for larger problem cases, despite the seemingly impossible computation scale.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80035325","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 : 2016-08-11DOI: 10.1109/ISIT.2016.7541770
Sihuang Hu, O. Shayevitz
Motivated by the problem of zero-error broadcasting, we introduce a new notion of graph capacity, termed ρ-capacity, that generalizes the Shannon capacity of a graph. We derive upper and lower bounds on the ρ-capacity of arbitrary graphs, and provide a tighter upper bound for regular graphs. The ρ-capacity is employed to characterize the zero-error capacity region of the degraded broadcast channel.
{"title":"The ρ-capacity of a graph","authors":"Sihuang Hu, O. Shayevitz","doi":"10.1109/ISIT.2016.7541770","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541770","url":null,"abstract":"Motivated by the problem of zero-error broadcasting, we introduce a new notion of graph capacity, termed ρ-capacity, that generalizes the Shannon capacity of a graph. We derive upper and lower bounds on the ρ-capacity of arbitrary graphs, and provide a tighter upper bound for regular graphs. The ρ-capacity is employed to characterize the zero-error capacity region of the degraded broadcast channel.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75117115","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541293
C. Schürch
A partial order for the synthesized channels W N (i) of a polar code is presented that is independent of the underlying binary-input channel W. The partial order is based on the observation that W N (j) is stochastically degraded to W N (i) if j is obtained by swapping a more significant 1 with a less significant 0 in the binary expansion of i. We derive an efficient representation of the partial order, the so-called covering relation. The partial order is then combined with another partial order from the literature that is also independent of W. Finally, we give some remarks on how this combined partial order can be used to simplify code construction of polar codes.
{"title":"A partial order for the synthesized channels of a polar code","authors":"C. Schürch","doi":"10.1109/ISIT.2016.7541293","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541293","url":null,"abstract":"A partial order for the synthesized channels W N (i) of a polar code is presented that is independent of the underlying binary-input channel W. The partial order is based on the observation that W N (j) is stochastically degraded to W N (i) if j is obtained by swapping a more significant 1 with a less significant 0 in the binary expansion of i. We derive an efficient representation of the partial order, the so-called covering relation. The partial order is then combined with another partial order from the literature that is also independent of W. Finally, we give some remarks on how this combined partial order can be used to simplify code construction of polar codes.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87085554","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541621
D. Simmons, J. Coon, N. Warsi
A novel framework is presented that can be used to study the capacity and power scaling of linear multiple-input multiple-output (MIMO) d×d antenna amplify-and-forward (AF) relay networks. In particular, we model these networks as random dynamical systems (RDS) and calculate their d Lyapunov exponents. Our framework can be applied to systems with any per-hop channel fading distribution provided the expected logarithm of the channel matrices' norms are finite; in this contribution all of our results relate specifically to Rayleigh fading. Our main results are twofold: 1) the total transmit power at the nth node will follow a deterministic trajectory through the network governed by the network's maximum Lyapunov exponent, 2) the capacity of the ith eigenchannel at the nth node will follow a deterministic trajectory through the network governed by the network's ith Lyapunov exponent. Before concluding, we present some numerical examples to highlight the theory.
{"title":"Capacity and power scaling laws for finite antenna amplify-and-forward relay networks","authors":"D. Simmons, J. Coon, N. Warsi","doi":"10.1109/ISIT.2016.7541621","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541621","url":null,"abstract":"A novel framework is presented that can be used to study the capacity and power scaling of linear multiple-input multiple-output (MIMO) d×d antenna amplify-and-forward (AF) relay networks. In particular, we model these networks as random dynamical systems (RDS) and calculate their d Lyapunov exponents. Our framework can be applied to systems with any per-hop channel fading distribution provided the expected logarithm of the channel matrices' norms are finite; in this contribution all of our results relate specifically to Rayleigh fading. Our main results are twofold: 1) the total transmit power at the nth node will follow a deterministic trajectory through the network governed by the network's maximum Lyapunov exponent, 2) the capacity of the ith eigenchannel at the nth node will follow a deterministic trajectory through the network governed by the network's ith Lyapunov exponent. Before concluding, we present some numerical examples to highlight the theory.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74872284","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}
We refine the general methodology in [1] for the construction and analysis of essentially minimax estimators for a wide class of functionals of finite dimensional parameters, and elaborate on the case of discrete distributions with support size S comparable with the number of observations n. Specifically, we determine the "smooth" and "non-smooth" regimes based on the confidence set and the smoothness of the functional. In the "non-smooth" regime, we apply an unbiased estimator for a "suitable" polynomial approximation of the functional. In the "smooth" regime, we construct a bias corrected version of the Maximum Likelihood Estimator (MLE) based on Taylor expansion. We apply the general methodology to the problem of estimating the KL divergence between two discrete distributions from empirical data. We construct a minimax rate-optimal estimator which is adaptive in the sense that it does not require the knowledge of the support size nor the upper bound on the likelihood ratio. Moreover, the performance of the optimal estimator with n samples is essentially that of the MLE with n ln n samples, i.e., the effective sample size enlargement phenomenon holds.
我们完善了 [1] 中的一般方法，即构建和分析各类有限维度参数函数的本质最小估计器，并详细阐述了支持大小 S 与观察数 n 相当的离散分布的情况。具体而言，我们根据置信集和函数的平滑度确定了 "平滑 "和 "非平滑 "机制。在 "非平稳 "状态下，我们对函数的 "合适 "多项式近似采用无偏估计法。在 "平滑 "机制中，我们根据泰勒展开构建了最大似然估计器（MLE）的偏差修正版本。我们将一般方法应用于从经验数据中估计两个离散分布之间的 KL 分歧问题。我们构建了一个最小率最优估计器，它是自适应的，因为它不需要知道支持大小或似然比上界。此外，具有 n 个样本的最优估计器的性能基本上与具有 n ln n 个样本的 MLE 相同，即有效样本量扩大现象成立。
{"title":"Minimax Rate-optimal Estimation of KL Divergence between Discrete Distributions.","authors":"Yanjun Han, Jiantao Jiao, Tsachy Weissman","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>We refine the general methodology in [1] for the construction and analysis of essentially minimax estimators for a wide class of functionals of finite dimensional parameters, and elaborate on the case of discrete distributions with support size <i>S</i> comparable with the number of observations <i>n</i>. Specifically, we determine the \"smooth\" and \"non-smooth\" regimes based on the confidence set and the smoothness of the functional. In the \"non-smooth\" regime, we apply an unbiased estimator for a \"suitable\" polynomial approximation of the functional. In the \"smooth\" regime, we construct a bias corrected version of the Maximum Likelihood Estimator (MLE) based on Taylor expansion. We apply the general methodology to the problem of estimating the KL divergence between two discrete distributions from empirical data. We construct a minimax rate-optimal estimator which is adaptive in the sense that it does not require the knowledge of the support size nor the upper bound on the likelihood ratio. Moreover, the performance of the optimal estimator with <i>n</i> samples is essentially that of the MLE with <i>n</i> ln <i>n</i> samples, i.e., the <i>effective sample size enlargement</i> phenomenon holds.</p>","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5812299/pdf/nihms910323.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35842722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-01DOI: 10.1109/ISIT.2014.6875290
Ansuman Adhikary, A. Ashikhmin, T. Marzetta
{"title":"Uplink interference reduction in Large Scale Antenna Systems","authors":"Ansuman Adhikary, A. Ashikhmin, T. Marzetta","doi":"10.1109/ISIT.2014.6875290","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875290","url":null,"abstract":"","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80865391","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
扫码关注我们
求助内容：
应助结果提醒方式：