Pub Date : 2014-01-03DOI: 10.1109/ISIT.2014.6875303
Anna-Lena Trautmann
Spread codes and orbit codes are special families of constant dimension subspace codes. These codes have been well-studied for their error correction capability and transmission rate, but the question of how to encode messages has not been investigated. In this work we show how the message space can be chosen for a given code and how message en- and decoding can be done.
{"title":"Message encoding for spread and orbit codes","authors":"Anna-Lena Trautmann","doi":"10.1109/ISIT.2014.6875303","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875303","url":null,"abstract":"Spread codes and orbit codes are special families of constant dimension subspace codes. These codes have been well-studied for their error correction capability and transmission rate, but the question of how to encode messages has not been investigated. In this work we show how the message space can be chosen for a given code and how message en- and decoding can be done.","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-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84395476","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 : 2013-07-07DOI: 10.1109/ISIT.2013.6620215
Himanshu Asnani, Ilan Shomorony, A. Avestimehr, T. Weissman
We consider the problem of communicating a distributed correlated memoryless source over a memoryless network, from source nodes to destination nodes, under quadratic distortion constraints. We show the following two complementary results: (a) for an arbitrary memoryless network, among all distributed memoryless sources with a particular correlation, Gaussian sources are the worst compressible, that is, they admit the smallest set of achievable distortion tuples, and (b) for any arbitrarily distributed memoryless source to be communicated over a memoryless additive noise network, among all noise processes with a fixed correlation, Gaussian noise admits the smallest achievable set of distortion tuples. In each case, given a coding scheme for the corresponding Gaussian problem, we provide a technique for the construction of a new coding scheme that achieves the same distortion at the destination nodes in a non-Gaussian scenario with the same correlation structure.
{"title":"Network compression: Worst-case analysis","authors":"Himanshu Asnani, Ilan Shomorony, A. Avestimehr, T. Weissman","doi":"10.1109/ISIT.2013.6620215","DOIUrl":"https://doi.org/10.1109/ISIT.2013.6620215","url":null,"abstract":"We consider the problem of communicating a distributed correlated memoryless source over a memoryless network, from source nodes to destination nodes, under quadratic distortion constraints. We show the following two complementary results: (a) for an arbitrary memoryless network, among all distributed memoryless sources with a particular correlation, Gaussian sources are the worst compressible, that is, they admit the smallest set of achievable distortion tuples, and (b) for any arbitrarily distributed memoryless source to be communicated over a memoryless additive noise network, among all noise processes with a fixed correlation, Gaussian noise admits the smallest achievable set of distortion tuples. In each case, given a coding scheme for the corresponding Gaussian problem, we provide a technique for the construction of a new coding scheme that achieves the same distortion at the destination nodes in a non-Gaussian scenario with the same correlation structure.","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":"2013-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79937709","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 : 2013-07-07DOI: 10.1109/ISIT.2013.6620612
Ayşe Ünsal, R. Knopp
This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed vector imperfectly measured by a network of sensors and transmitted with finite energy to a common receiver via an additive white Gaussian noise asynchronous multiple-access channel. Transmission makes use of a perfect causal feedback link to the encoder connected to each sensor. A retransmission protocol inspired by the classical scheme in [1] applied to the transmission of single and bi-variate analog samples analyzed in [2] and [3] is extended to the more general network scenario, for which asymptotic upper-bounds on the reconstruction error are provided. Both the upper and lower-bounds show that collaboration can be achieved through energy accumulation under certain circumstances.
{"title":"Distributed sensing and transmission of sporadic random samples","authors":"Ayşe Ünsal, R. Knopp","doi":"10.1109/ISIT.2013.6620612","DOIUrl":"https://doi.org/10.1109/ISIT.2013.6620612","url":null,"abstract":"This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed vector imperfectly measured by a network of sensors and transmitted with finite energy to a common receiver via an additive white Gaussian noise asynchronous multiple-access channel. Transmission makes use of a perfect causal feedback link to the encoder connected to each sensor. A retransmission protocol inspired by the classical scheme in [1] applied to the transmission of single and bi-variate analog samples analyzed in [2] and [3] is extended to the more general network scenario, for which asymptotic upper-bounds on the reconstruction error are provided. Both the upper and lower-bounds show that collaboration can be achieved through energy accumulation under certain circumstances.","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":"2013-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81834980","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 : 2013-07-07DOI: 10.1109/ISIT.2013.6620731
V. Shashank, N. Kashyap
We study the problem of secure bidirectional relaying in the presence of an “honest but curious” relay. We consider the setting where all links between nodes are additive white Gaussian noise (AWGN) channels, and show that using nested lattice codes, it is possible to obtain strong secrecy. A randomized encoder based on probability mass functions obtained by sampling the Gaussian function is used, and we show that the mutual information between the secret messages and the vector received by the relay is arbitrarily small for large block lengths. We determine sufficient conditions for secure and reliable communication, and find achievable rates. We then extend the results to the case of secure relaying in a multi-hop network with K +1 hops.
{"title":"Lattice coding for strongly secure compute-and-forward in a bidirectional relay","authors":"V. Shashank, N. Kashyap","doi":"10.1109/ISIT.2013.6620731","DOIUrl":"https://doi.org/10.1109/ISIT.2013.6620731","url":null,"abstract":"We study the problem of secure bidirectional relaying in the presence of an “honest but curious” relay. We consider the setting where all links between nodes are additive white Gaussian noise (AWGN) channels, and show that using nested lattice codes, it is possible to obtain strong secrecy. A randomized encoder based on probability mass functions obtained by sampling the Gaussian function is used, and we show that the mutual information between the secret messages and the vector received by the relay is arbitrarily small for large block lengths. We determine sufficient conditions for secure and reliable communication, and find achievable rates. We then extend the results to the case of secure relaying in a multi-hop network with K +1 hops.","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":"2013-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88446147","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 : 2013-07-07DOI: 10.1109/ISIT.2013.6620582
R. K. Farsani
This paper presents a solution for one of the open problems in network information theory: “What is the generalization of the strong interference regime to the K-user interference channel?” A new approach is developed based on which one can obtain strong interference regimes not only for the multi-user interference channels but also for other interference networks with any arbitrary topology. To this development, some new lemmas are proved which have a central role in our derivations. As a result, this paper establishes the first non-trivial capacity result for the general multi-user classical interference channel (for both discrete and Gaussian channels).
{"title":"The K-user interference channel: Strong interference regime","authors":"R. K. Farsani","doi":"10.1109/ISIT.2013.6620582","DOIUrl":"https://doi.org/10.1109/ISIT.2013.6620582","url":null,"abstract":"This paper presents a solution for one of the open problems in network information theory: “What is the generalization of the strong interference regime to the K-user interference channel?” A new approach is developed based on which one can obtain strong interference regimes not only for the multi-user interference channels but also for other interference networks with any arbitrary topology. To this development, some new lemmas are proved which have a central role in our derivations. As a result, this paper establishes the first non-trivial capacity result for the general multi-user classical interference channel (for both discrete and Gaussian channels).","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":"2013-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80972883","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 : 2013-02-07DOI: 10.1109/ISIT.2014.6875331
Reza Khosravi-Farsani
One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are presented for this channel. First, a novel outer bound on the capacity region is given. It is shown that this outer bound is optimal in the strong interference regime. Moreover, by using the derived outer bound, some new capacity theorems are proved. Specifically, a mixed interference regime is identified for the general IC where decoding interference at one receiver and treating interference as noise at the other one is sum-rate optimal. Also, a class of one-sided ICs with weak interference is identified for which treating interference as noise is sum-rate optimal. Our new capacity theorems include the previously obtained results for the mixed Gaussian IC and the weak Gaussian one-sided IC as special cases. Next, some results are given on the Han-Kobayashi (HK) achievable rate region. The evaluation of this rate region is in general difficult. In this paper, a simple characterization of the HK rate region is derived for a novel very weak interference regime. It is shown that for this very weak interference regime, the achievable sum-rate due to the HK region is identical to the one given by the simple treating interference as noise strategy. Finally, by using a novel genie-aided technique, a noisy interference regime is identified for the general IC (non-Gaussian) where the sum-rate capacity is achieved by treating interference as noise at the receivers. This result includes the noisy interference regime previously obtained for the Gaussian channel as a special case.
{"title":"On the capacity region of the two-user Interference Channel","authors":"Reza Khosravi-Farsani","doi":"10.1109/ISIT.2014.6875331","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875331","url":null,"abstract":"One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are presented for this channel. First, a novel outer bound on the capacity region is given. It is shown that this outer bound is optimal in the strong interference regime. Moreover, by using the derived outer bound, some new capacity theorems are proved. Specifically, a mixed interference regime is identified for the general IC where decoding interference at one receiver and treating interference as noise at the other one is sum-rate optimal. Also, a class of one-sided ICs with weak interference is identified for which treating interference as noise is sum-rate optimal. Our new capacity theorems include the previously obtained results for the mixed Gaussian IC and the weak Gaussian one-sided IC as special cases. Next, some results are given on the Han-Kobayashi (HK) achievable rate region. The evaluation of this rate region is in general difficult. In this paper, a simple characterization of the HK rate region is derived for a novel very weak interference regime. It is shown that for this very weak interference regime, the achievable sum-rate due to the HK region is identical to the one given by the simple treating interference as noise strategy. Finally, by using a novel genie-aided technique, a noisy interference regime is identified for the general IC (non-Gaussian) where the sum-rate capacity is achieved by treating interference as noise at the receivers. This result includes the noisy interference regime previously obtained for the Gaussian channel as a special case.","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":"2013-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75779163","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 : 2013-01-01DOI: 10.1109/ISIT.2013.6620562
Apostolos Destounis, M. Assaad, M. Debbah, B. Sayadi
{"title":"A randomized probing scheme for increasing the stability region of multicarrier systems","authors":"Apostolos Destounis, M. Assaad, M. Debbah, B. Sayadi","doi":"10.1109/ISIT.2013.6620562","DOIUrl":"https://doi.org/10.1109/ISIT.2013.6620562","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":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83412012","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 : 2013-01-01DOI: 10.1109/ISIT.2013.6620328
Reza Khosravi-Farsani
{"title":"The capacity region of the wireless ergodic fading Interference Channel with partial CSIT to within one bit","authors":"Reza Khosravi-Farsani","doi":"10.1109/ISIT.2013.6620328","DOIUrl":"https://doi.org/10.1109/ISIT.2013.6620328","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":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82510417","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 : 2012-07-01DOI: 10.1109/ISIT.2012.6284114
A. Khisti, Brett Hern, K. Narayanan
We study computation of a modulo-sum of two binary source sequences over a two-user erasure multiple access channel. Each sender observes an independent and equiprobable binary sequence and the receiver is interested in computing the modulo-sum of these two sequences. The channel is modelled as a binary-input, erasure multiple access channel, which can be in one of three states — either the channel output is a modulo-sum of the two input symbols, or the channel output equals the input symbol on the first link and an erasure on the second link, or it equals the input symbol on the second link and an erasure on the first link. The associated state sequence is independent and identically distributed. We establish upper and lower bounds on the modulo-sum capacity. Our coding scheme uses either the compute-and-forward or the decode-and-forward techniques. The upper bound is obtained by a genie aided argument that reduces the setup to a compound multiple-access channel. It is in general is tighter than a simple upper bound obtained by revealing one of the messages to the decoders. We also briefly consider the case when a strictly causal state feedback is available to the encoders and establish that such feedback can increase the modulo-sum capacity.
{"title":"On modulo-sum computation over an erasure multiple access channel","authors":"A. Khisti, Brett Hern, K. Narayanan","doi":"10.1109/ISIT.2012.6284114","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284114","url":null,"abstract":"We study computation of a modulo-sum of two binary source sequences over a two-user erasure multiple access channel. Each sender observes an independent and equiprobable binary sequence and the receiver is interested in computing the modulo-sum of these two sequences. The channel is modelled as a binary-input, erasure multiple access channel, which can be in one of three states — either the channel output is a modulo-sum of the two input symbols, or the channel output equals the input symbol on the first link and an erasure on the second link, or it equals the input symbol on the second link and an erasure on the first link. The associated state sequence is independent and identically distributed. We establish upper and lower bounds on the modulo-sum capacity. Our coding scheme uses either the compute-and-forward or the decode-and-forward techniques. The upper bound is obtained by a genie aided argument that reduces the setup to a compound multiple-access channel. It is in general is tighter than a simple upper bound obtained by revealing one of the messages to the decoders. We also briefly consider the case when a strictly causal state feedback is available to the encoders and establish that such feedback can increase the modulo-sum capacity.","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":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77505599","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 : 2012-07-01DOI: 10.1109/ISIT.2012.6283582
J. H. Sørensen, T. Koike-Akino, P. Orlik
This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding.
{"title":"2012 IEEE International Symposium on Information Theory Proceedings (ISIT)","authors":"J. H. Sørensen, T. Koike-Akino, P. Orlik","doi":"10.1109/ISIT.2012.6283582","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283582","url":null,"abstract":"This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding.","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":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86073713","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
扫码关注我们
求助内容：
应助结果提醒方式：