Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404720
S. Saha, R. Berry
Approximate solutions to some long-standing multi-terminal information theoretic problems, in particular interference channels, have been made possible by study of the corresponding linear deterministic models. Here, we illustrate a combinatorial structure underlying linear deterministic interference channels (LDIC). This enables a systematic design of sum-capacity achievable schemes in a general 2-user LDIC.
{"title":"The combinatorial structure of linear deterministic interference channels","authors":"S. Saha, R. Berry","doi":"10.1109/ITW.2012.6404720","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404720","url":null,"abstract":"Approximate solutions to some long-standing multi-terminal information theoretic problems, in particular interference channels, have been made possible by study of the corresponding linear deterministic models. Here, we illustrate a combinatorial structure underlying linear deterministic interference channels (LDIC). This enables a systematic design of sum-capacity achievable schemes in a general 2-user LDIC.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114626679","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-09-01DOI: 10.1109/ITW.2012.6404713
Yu Yu, Xiangxue Li, Hai-feng Qian
A (worst-case) 2-source extractor is a deterministic algorithm that transforms pairwise independent weak random sources into almost uniform random strings. Despite non-constructive proofs that such objects exist with almost optimal parameters, it has been a longstanding open problem to construct `explicit' (aka efficient) functions for sources of `small' constant entropy rate. In particular, best known constructions either require entropy rate of at least 0.4999 (due to Bourgain), or one source must remain with constant entropy rate above half (due to Raz). Motivated by cryptographic applications, we observe that if one source is a leaky source (or it contains a few deterministically extractable entropy), then we will be able to efficiently extract almost all entropy from both sources with nearly optimal entropy loss. Further, our extractor (for leaky sources) does not suffer from the half entropy rate barrier, and it works for all linear (and even sub-linear) entropy sources. The extractor is constructed using the technique of alternating extraction by Dziembowski and Pietrzak (FOCS 2007). Finally, we show that the extractor is almost a worse-case extractor (for the same parameters) in the sense that it only fails for a negligible fraction of sources.
{"title":"Two-source extractors for leaky sources","authors":"Yu Yu, Xiangxue Li, Hai-feng Qian","doi":"10.1109/ITW.2012.6404713","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404713","url":null,"abstract":"A (worst-case) 2-source extractor is a deterministic algorithm that transforms pairwise independent weak random sources into almost uniform random strings. Despite non-constructive proofs that such objects exist with almost optimal parameters, it has been a longstanding open problem to construct `explicit' (aka efficient) functions for sources of `small' constant entropy rate. In particular, best known constructions either require entropy rate of at least 0.4999 (due to Bourgain), or one source must remain with constant entropy rate above half (due to Raz). Motivated by cryptographic applications, we observe that if one source is a leaky source (or it contains a few deterministically extractable entropy), then we will be able to efficiently extract almost all entropy from both sources with nearly optimal entropy loss. Further, our extractor (for leaky sources) does not suffer from the half entropy rate barrier, and it works for all linear (and even sub-linear) entropy sources. The extractor is constructed using the technique of alternating extraction by Dziembowski and Pietrzak (FOCS 2007). Finally, we show that the extractor is almost a worse-case extractor (for the same parameters) in the sense that it only fails for a negligible fraction of sources.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133538232","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-09-01DOI: 10.1109/ITW.2012.6404666
Glenn Bradford, J. N. Laneman
Block Markov superposition encoding has been used on a number of channels to enable transmitter cooperation, including the decode-and-forward (DF) relaying scheme on the full-duplex relay channel. We analyze the error performance of DF with regular encoding and sliding window decoding as the window size of the decoder is allowed to grow. Specifically, we use Gallager's random coding exponent to analyze the behavior of DF in the finite block length regime where the error probability cannot be made arbitrarily small for a fixed rate and block length. Although using a larger decoding window may not result in a better achievable rate in the infinite block length regime, doing so for finite block lengths enables a higher rate of transmission for a given error probability. In particular, these rate enhancements can lead to a larger range of operating scenarios in which relaying can outperform direct transmission.
{"title":"Error exponents for block Markov superposition encoding with varying decoding latency","authors":"Glenn Bradford, J. N. Laneman","doi":"10.1109/ITW.2012.6404666","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404666","url":null,"abstract":"Block Markov superposition encoding has been used on a number of channels to enable transmitter cooperation, including the decode-and-forward (DF) relaying scheme on the full-duplex relay channel. We analyze the error performance of DF with regular encoding and sliding window decoding as the window size of the decoder is allowed to grow. Specifically, we use Gallager's random coding exponent to analyze the behavior of DF in the finite block length regime where the error probability cannot be made arbitrarily small for a fixed rate and block length. Although using a larger decoding window may not result in a better achievable rate in the infinite block length regime, doing so for finite block lengths enables a higher rate of transmission for a given error probability. In particular, these rate enhancements can lead to a larger range of operating scenarios in which relaying can outperform direct transmission.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133421361","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-09-01DOI: 10.1109/ITW.2012.6404661
E. Atsan, R. Knopp, S. Diggavi, C. Fragouli
We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme [1] into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and results in minimal changes in the standard link-layer LTE operation. In particular, the destination operation is only affected in that we adapt the log-likelihood ratio (LLR) calculations at the decoder input to take into account the existence of relays; thus, the decoding complexity and operations (apart the LLR calculations) are not modified. We report extensive performance evaluations of our scheme using the OpenAirInterface (OAI) link-level simulation tools.
{"title":"Towards integrating Quantize-Map-Forward relaying into LTE","authors":"E. Atsan, R. Knopp, S. Diggavi, C. Fragouli","doi":"10.1109/ITW.2012.6404661","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404661","url":null,"abstract":"We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme [1] into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and results in minimal changes in the standard link-layer LTE operation. In particular, the destination operation is only affected in that we adapt the log-likelihood ratio (LLR) calculations at the decoder input to take into account the existence of relays; thus, the decoding complexity and operations (apart the LLR calculations) are not modified. We report extensive performance evaluations of our scheme using the OpenAirInterface (OAI) link-level simulation tools.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116053378","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-09-01DOI: 10.1109/ITW.2012.6404756
Vincent Gripon, M. Rabbat, Vitaly Skachek, W. Gross
We consider the problem of efficient and lossless representation of a multiset of m words drawn with repetition from a set of size 2n. One expects that encoding the (unordered) multiset should lead to significant savings in rate as compared to encoding an (ordered) sequence with the same words, since information about the order of words in the sequence corresponds to a permutation. We propose and analyze a practical multiset encoder/decoder based on the trie data structure. The act of encoding requires O(m(n + log m)) operations, and decoding requires O(mn) operations. Of particular interest is the case where cardinality of the multiset scales as m = 1/c2n for some c >; 1, as n → ∞. Under this scaling, and when the words in the multiset are drawn independently and uniformly, we show that the proposed encoding leads to an arbitrary improvement in rate over encoding an ordered sequence with the same words. Moreover, the expected length of the proposed codes in this setting is asymptotically within a constant factor of 5/3 of the lower bound.
{"title":"Compressing multisets using tries","authors":"Vincent Gripon, M. Rabbat, Vitaly Skachek, W. Gross","doi":"10.1109/ITW.2012.6404756","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404756","url":null,"abstract":"We consider the problem of efficient and lossless representation of a multiset of m words drawn with repetition from a set of size 2n. One expects that encoding the (unordered) multiset should lead to significant savings in rate as compared to encoding an (ordered) sequence with the same words, since information about the order of words in the sequence corresponds to a permutation. We propose and analyze a practical multiset encoder/decoder based on the trie data structure. The act of encoding requires O(m(n + log m)) operations, and decoding requires O(mn) operations. Of particular interest is the case where cardinality of the multiset scales as m = 1/c2n for some c >; 1, as n → ∞. Under this scaling, and when the words in the multiset are drawn independently and uniformly, we show that the proposed encoding leads to an arbitrary improvement in rate over encoding an ordered sequence with the same words. Moreover, the expected length of the proposed codes in this setting is asymptotically within a constant factor of 5/3 of the lower bound.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116291954","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-09-01DOI: 10.1109/ITW.2012.6404732
P. Trifonov
The problem of efficient evaluation of the discrete Fourier transform over finite fields is considered. The techniques for additive complexity reduction of the cyclotomic FFT algorithm are proposed. The first one is based on the classical simultaneous reduction algorithm. The second one is based on a factorization of the presummation matrix into a sparse and block-diagonal ones. The proposed methods provide smaller asymptotic complexity, although for small-sized problems the required number of operations appears to be higher than the complexity of computer-optimized algorithms.
{"title":"On the additive complexity of the cyclotomic FFT algorithm","authors":"P. Trifonov","doi":"10.1109/ITW.2012.6404732","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404732","url":null,"abstract":"The problem of efficient evaluation of the discrete Fourier transform over finite fields is considered. The techniques for additive complexity reduction of the cyclotomic FFT algorithm are proposed. The first one is based on the classical simultaneous reduction algorithm. The second one is based on a factorization of the presummation matrix into a sparse and block-diagonal ones. The proposed methods provide smaller asymptotic complexity, although for small-sized problems the required number of operations appears to be higher than the complexity of computer-optimized algorithms.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133579443","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-09-01DOI: 10.1109/ITW.2012.6404769
Ilya Mironov
Differential privacy, introduced in 2006, has become a standard definition of privacy for statistical computations. Most of the research on differential privacy has explored questions arising in the client-server setting, where privacy guarantees are one-sided and cover data held by just one of the protocol participants. We observe that differential privacy complements the classic definition of secure multi-party computations by allowing one to quantify information leaked through the output of the computation. This view leads to a number of interesting questions, where differential privacy is treated as a constraint on the protocol. We survey the state-of-the-art of differential privacy in a multi-party setting and formulate several open problems.
{"title":"Differential privacy as a protocol constraint","authors":"Ilya Mironov","doi":"10.1109/ITW.2012.6404769","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404769","url":null,"abstract":"Differential privacy, introduced in 2006, has become a standard definition of privacy for statistical computations. Most of the research on differential privacy has explored questions arising in the client-server setting, where privacy guarantees are one-sided and cover data held by just one of the protocol participants. We observe that differential privacy complements the classic definition of secure multi-party computations by allowing one to quantify information leaked through the output of the computation. This view leads to a number of interesting questions, where differential privacy is treated as a constraint on the protocol. We survey the state-of-the-art of differential privacy in a multi-party setting and formulate several open problems.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133069122","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-09-01DOI: 10.1109/ITW.2012.6404640
Yanfei Yan, Cong Ling
We employ polar codes as the building blocks of Construction D to construct lattices for the additive white Gaussian noise (AWGN) channel. The construction of these component polar codes is based on the idea of Pedarsani et al. for binary-input memoryless symmetric (BMS) channels. Our lattice construction takes the advantage of the performance gain of polar codes over Reed-Muller codes. Simulation results show the lattices constructed from polar codes outperform the benchmark Barnes-Wall lattices, which are constructed from Reed-Muller codes.
{"title":"A Construction of lattices from polar codes","authors":"Yanfei Yan, Cong Ling","doi":"10.1109/ITW.2012.6404640","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404640","url":null,"abstract":"We employ polar codes as the building blocks of Construction D to construct lattices for the additive white Gaussian noise (AWGN) channel. The construction of these component polar codes is based on the idea of Pedarsani et al. for binary-input memoryless symmetric (BMS) channels. Our lattice construction takes the advantage of the performance gain of polar codes over Reed-Muller codes. Simulation results show the lattices constructed from polar codes outperform the benchmark Barnes-Wall lattices, which are constructed from Reed-Muller codes.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121955763","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-09-01DOI: 10.1109/ITW.2012.6404743
Shahriar Etemadi Tajbakhsh, P. Sadeghi
The advantages of coded cooperative data exchange has been studied in the literature. In this problem, a group of wireless clients are interested in the same set of packets (a multicast scenario). Each client initially holds a subset of packets and wills to obtain its missing packets in a cooperative setting by exchanging packets with its peers. Cooperation via short range transmission links among the clients (which are faster, cheaper and more reliable) is an alternative for retransmissions by the base station. In this paper, we extend the problem of cooperative data exchange to the case of multiple unicasts to a set of n clients, where each client ci is interested in a specific message xi and the clients cooperate with each others to compensate the errors occurred over the downlink. Moreover, our proposed method maintains the secrecy of individuals' messages at the price of a substantially small overhead.
{"title":"Coded cooperative data exchange for multiple unicasts","authors":"Shahriar Etemadi Tajbakhsh, P. Sadeghi","doi":"10.1109/ITW.2012.6404743","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404743","url":null,"abstract":"The advantages of coded cooperative data exchange has been studied in the literature. In this problem, a group of wireless clients are interested in the same set of packets (a multicast scenario). Each client initially holds a subset of packets and wills to obtain its missing packets in a cooperative setting by exchanging packets with its peers. Cooperation via short range transmission links among the clients (which are faster, cheaper and more reliable) is an alternative for retransmissions by the base station. In this paper, we extend the problem of cooperative data exchange to the case of multiple unicasts to a set of n clients, where each client ci is interested in a specific message xi and the clients cooperate with each others to compensate the errors occurred over the downlink. Moreover, our proposed method maintains the secrecy of individuals' messages at the price of a substantially small overhead.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129258917","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-09-01DOI: 10.1109/ITW.2012.6404766
M. Langberg, M. Effros
In this work, we address the capacity region of multi-source multi-terminal network communication problems, and study the change in capacity when one moves form independent to dependent source information. Specifically, we ask whether the trade off between capacity and source independence is of continuous nature. We tie the question at hand to that of edge removal which has seen recent interest.
{"title":"Source coding for dependent sources","authors":"M. Langberg, M. Effros","doi":"10.1109/ITW.2012.6404766","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404766","url":null,"abstract":"In this work, we address the capacity region of multi-source multi-terminal network communication problems, and study the change in capacity when one moves form independent to dependent source information. Specifically, we ask whether the trade off between capacity and source independence is of continuous nature. We tie the question at hand to that of edge removal which has seen recent interest.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127824565","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
扫码关注我们
求助内容：
应助结果提醒方式：