Pub Date : 2012-07-01DOI: 10.1109/ISIT.2012.6284300
B. Dey, S. Jaggi, M. Langberg, A. Sarwate
In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x 1 , …, x n ) bit-by-bit over a communication channel. The adversarial jammer can view the transmitted bits x i one at a time, and can change up to a p-fraction of them. However, the decisions of the jammer must be made in a causal manner. Namely, for each bit x i the jammer's decision on whether to corrupt it or not must depend only on x j for j ≤ i. This is in contrast to the “classical” adversarial jammer which may base its decisions on its complete knowledge of x. Binary channels with causal adversarial jammers have seen recent studies in which both lower bounds and upper bounds on their capacity is derived. In this work, we present improved upper bounds on the capacity which hold for both deterministic and stochastic encoding schemes.
{"title":"Improved upper bounds on the capacity of binary channels with causal adversaries","authors":"B. Dey, S. Jaggi, M. Langberg, A. Sarwate","doi":"10.1109/ISIT.2012.6284300","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284300","url":null,"abstract":"In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x 1 , …, x n ) bit-by-bit over a communication channel. The adversarial jammer can view the transmitted bits x i one at a time, and can change up to a p-fraction of them. However, the decisions of the jammer must be made in a causal manner. Namely, for each bit x i the jammer's decision on whether to corrupt it or not must depend only on x j for j ≤ i. This is in contrast to the “classical” adversarial jammer which may base its decisions on its complete knowledge of x. Binary channels with causal adversarial jammers have seen recent studies in which both lower bounds and upper bounds on their capacity is derived. In this work, we present improved upper bounds on the capacity which hold for both deterministic and stochastic encoding schemes.","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":"74774912","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.6284254
Erdal Arikan Bilkent
We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions.
{"title":"Polar coding for the Slepian-Wolf problem based on monotone chain rules","authors":"Erdal Arikan Bilkent","doi":"10.1109/ISIT.2012.6284254","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284254","url":null,"abstract":"We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions.","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":"87327939","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.6283727
Urs Niesen, M. Maddah-ali
Interference alignment is a key technique for communication scenarios with multiple interfering links. In several such scenarios, interference alignment was used to characterize the degrees-of-freedom of the channel. However, these degrees-of-freedom capacity approximations are often too weak to make accurate predictions about the behavior of channel capacity at finite signal-to-noise ratios. The aim of this paper is to significantly strengthen these results by showing that interference alignment can be used to characterize capacity to within a constant gap. We focus on real time-invariant frequency-flat X-channels, for which only the degrees-of-freedom are known. We propose a new communication scheme and show that it achieves the capacity of the Gaussian X-channel to within a constant gap. To aid in this process, we develop a novel deterministic channel model, admitting a wider range of achievable schemes that can be translated to the Gaussian channel. For this deterministic model, we find an approximately optimal communication scheme. We then translate this scheme for the deterministic channel to the original Gaussian X-channel and show that it achieves capacity to within a constant gap. This is the first constant-gap result for a fully-connected network requiring interference alignment.
{"title":"Interference alignment: From degrees-of-freedom to constant-gap capacity approximations","authors":"Urs Niesen, M. Maddah-ali","doi":"10.1109/ISIT.2012.6283727","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283727","url":null,"abstract":"Interference alignment is a key technique for communication scenarios with multiple interfering links. In several such scenarios, interference alignment was used to characterize the degrees-of-freedom of the channel. However, these degrees-of-freedom capacity approximations are often too weak to make accurate predictions about the behavior of channel capacity at finite signal-to-noise ratios. The aim of this paper is to significantly strengthen these results by showing that interference alignment can be used to characterize capacity to within a constant gap. We focus on real time-invariant frequency-flat X-channels, for which only the degrees-of-freedom are known. We propose a new communication scheme and show that it achieves the capacity of the Gaussian X-channel to within a constant gap. To aid in this process, we develop a novel deterministic channel model, admitting a wider range of achievable schemes that can be translated to the Gaussian channel. For this deterministic model, we find an approximately optimal communication scheme. We then translate this scheme for the deterministic channel to the original Gaussian X-channel and show that it achieves capacity to within a constant gap. This is the first constant-gap result for a fully-connected network requiring interference alignment.","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":"89592746","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 : 2011-10-03DOI: 10.1109/ISIT.2011.6033828
R. Muller
This paper studies the design of random code-division multiple-access (CDMA) with continuous-time constant envelope. The proposed scheme is compatible with linear CDMA and allows for standard methods of linear multiuser detection while avoiding phase jumps at all times. The proposed algorithm finds a set of spreading waveforms with approximately rectangular power spectral density and stop-band attenuation of more than 60 dB at exactly constant envelope. Alternatively, the algorithm can provide perfect stop-band attenuation at a peak-to-average power ratio of 0.04 dB at spreading factor 512.
{"title":"On random CDMA with constant envelope","authors":"R. Muller","doi":"10.1109/ISIT.2011.6033828","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033828","url":null,"abstract":"This paper studies the design of random code-division multiple-access (CDMA) with continuous-time constant envelope. The proposed scheme is compatible with linear CDMA and allows for standard methods of linear multiuser detection while avoiding phase jumps at all times. The proposed algorithm finds a set of spreading waveforms with approximately rectangular power spectral density and stop-band attenuation of more than 60 dB at exactly constant envelope. Alternatively, the algorithm can provide perfect stop-band attenuation at a peak-to-average power ratio of 0.04 dB at spreading factor 512.","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":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75907176","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 : 2011-10-03DOI: 10.1109/ISIT.2011.6034013
A. Wachter-Zeh, V. Sidorenko, M. Bossert, V. Zyablov
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, the extended row rank distance and its slope are defined. Upper bounds for the free rank distance and the slope of (P)UM codes in the sum rank metric are derived. The construction of PUM codes based on Gabidulin codes achieves the upper bound for the free rank distance.
{"title":"Partial Unit Memory codes based on Gabidulin codes","authors":"A. Wachter-Zeh, V. Sidorenko, M. Bossert, V. Zyablov","doi":"10.1109/ISIT.2011.6034013","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034013","url":null,"abstract":"(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, the extended row rank distance and its slope are defined. Upper bounds for the free rank distance and the slope of (P)UM codes in the sum rank metric are derived. The construction of PUM codes based on Gabidulin codes achieves the upper bound for the free rank distance.","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":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87909261","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 : 2011-10-03DOI: 10.1109/ISIT.2011.6034219
A. Burrage, A. Sălăgean, R. Phan
We present several generalisations of the Games-Chan algorithm. For a fixed monic irreducible polynomial ƒ we consider the sequences s that have as characteristic polynomial a power of ƒ. We propose an algorithm for computing the linear complexity of s given a full (not necessarily minimal) period of s. We give versions of the algorithm for fields of characteristic 2 and for arbitrary finite characteristic p, the latter generalising an algorithm of Kaida et al. We also propose an algorithm which computes the linear complexity given only a finite portion of s (of length greater than or equal to the linear complexity), generalising an algorithm of Meidl. All our algorithms have linear computational complexity. The algorithms for computing the linear complexity when a full period is known can be further generalised to sequences for which it is known a priori that the irreducible factors of the minimal polynomial belong to a given small set of polynomials.
{"title":"Linear complexity for sequences with characteristic polynomial ƒv","authors":"A. Burrage, A. Sălăgean, R. Phan","doi":"10.1109/ISIT.2011.6034219","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034219","url":null,"abstract":"We present several generalisations of the Games-Chan algorithm. For a fixed monic irreducible polynomial ƒ we consider the sequences s that have as characteristic polynomial a power of ƒ. We propose an algorithm for computing the linear complexity of s given a full (not necessarily minimal) period of s. We give versions of the algorithm for fields of characteristic 2 and for arbitrary finite characteristic p, the latter generalising an algorithm of Kaida et al. We also propose an algorithm which computes the linear complexity given only a finite portion of s (of length greater than or equal to the linear complexity), generalising an algorithm of Meidl. All our algorithms have linear computational complexity. The algorithms for computing the linear complexity when a full period is known can be further generalised to sequences for which it is known a priori that the irreducible factors of the minimal polynomial belong to a given small set of polynomials.","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":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80403378","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 : 2011-10-03DOI: 10.1109/ISIT.2011.6034165
M. Wilde, Min-Hsiu Hsieh
One of the unexpected breakdowns in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential for a quantum turbo code to have an unbounded minimum distance and for its iterative decoding algorithm to converge, respectively. Here, we show that the entanglement-assisted paradigm gives a theoretical and simulated “turbo boost” to these codes, in the sense that an entanglement-assisted quantum (EAQ) convolutional encoder can possess both of the aforementioned desirable properties, and simulation results indicate that entanglement-assisted turbo codes can operate reliably in a noise regime 5.5 dB beyond that of standard quantum turbo codes. Entanglement is the resource that enables a convolutional encoder to satisfy both properties because an encoder acting on only information qubits, classical bits, gauge qubits, and ancilla qubits cannot simultaneously satisfy them. Simulation results demonstrate that interleaved serial concatenation of EAQ convolutional encoders leads to a powerful code construction with excellent performance on a memoryless depolarizing channel.
{"title":"Entanglement boosts quantum turbo codes","authors":"M. Wilde, Min-Hsiu Hsieh","doi":"10.1109/ISIT.2011.6034165","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034165","url":null,"abstract":"One of the unexpected breakdowns in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential for a quantum turbo code to have an unbounded minimum distance and for its iterative decoding algorithm to converge, respectively. Here, we show that the entanglement-assisted paradigm gives a theoretical and simulated “turbo boost” to these codes, in the sense that an entanglement-assisted quantum (EAQ) convolutional encoder can possess both of the aforementioned desirable properties, and simulation results indicate that entanglement-assisted turbo codes can operate reliably in a noise regime 5.5 dB beyond that of standard quantum turbo codes. Entanglement is the resource that enables a convolutional encoder to satisfy both properties because an encoder acting on only information qubits, classical bits, gauge qubits, and ancilla qubits cannot simultaneously satisfy them. Simulation results demonstrate that interleaved serial concatenation of EAQ convolutional encoders leads to a powerful code construction with excellent performance on a memoryless depolarizing 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":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91273485","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 : 2011-10-03DOI: 10.1109/ISIT.2011.6034201
Park, Seyong, Anant Sahaiy
Can we design a communication network just like a huge linear time-invariant filter? To answer this question, we generalize the celebrated mincut-maxflow theorem to linear time-invariant networks where edges are labeled with transfer functions instead of integer capacity constraints. We prove that when the transfer functions are linear time-invariant, the fundamental design limit, mincut, is achievable by a linear time-invariant scheme regardless of the topology of the network. Whereas prior works are based on layered networks, our proof has a novel way of converting an arbitrary relay network to an equivalent acyclic single-hop relay network, which we call Network Linearization. This theorem also reveals a strong connection between network coding and linear system theory.
{"title":"An algebraic mincut-maxflow theorem","authors":"Park, Seyong, Anant Sahaiy","doi":"10.1109/ISIT.2011.6034201","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034201","url":null,"abstract":"Can we design a communication network just like a huge linear time-invariant filter? To answer this question, we generalize the celebrated mincut-maxflow theorem to linear time-invariant networks where edges are labeled with transfer functions instead of integer capacity constraints. We prove that when the transfer functions are linear time-invariant, the fundamental design limit, mincut, is achievable by a linear time-invariant scheme regardless of the topology of the network. Whereas prior works are based on layered networks, our proof has a novel way of converting an arbitrary relay network to an equivalent acyclic single-hop relay network, which we call Network Linearization. This theorem also reveals a strong connection between network coding and linear system 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":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78649851","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 : 2011-07-01DOI: 10.1109/ISIT.2011.6034118
S. K. Mohammed, E. Viterbo, Y. Hong, A. Chockalingam
In this paper, we address the design of codes which achieve modulation diversity in block fading single-input single-output (SISO) channels with signal quantization at receiver and low-complexity decoding. With an unquantized receiver, coding based on algebraic rotations is known to achieve modulation coding diversity. On the other hand, with a quantized receiver, algebraic rotations may not guarantee diversity. Through analysis, we propose specific rotations which result in the codewords having equidistant component-wise projections. We show that the proposed coding scheme achieves maximum modulation diversity with a low-complexity minimum distance decoder.
{"title":"Modulation diversity in fading channels with quantized receiver","authors":"S. K. Mohammed, E. Viterbo, Y. Hong, A. Chockalingam","doi":"10.1109/ISIT.2011.6034118","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034118","url":null,"abstract":"In this paper, we address the design of codes which achieve modulation diversity in block fading single-input single-output (SISO) channels with signal quantization at receiver and low-complexity decoding. With an unquantized receiver, coding based on algebraic rotations is known to achieve modulation coding diversity. On the other hand, with a quantized receiver, algebraic rotations may not guarantee diversity. Through analysis, we propose specific rotations which result in the codewords having equidistant component-wise projections. We show that the proposed coding scheme achieves maximum modulation diversity with a low-complexity minimum distance decoder.","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":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88606327","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 : 2011-07-01DOI: 10.1109/ISIT.2011.6034010
Caner Nazaroglu, Ayfer Özgür, C. Fragouli
We consider the Gaussian $N$-relay diamond network, where a source wants to communicate to a destination through a layer of $N$-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only $k$ out of the $N$ relays? We show that in every Gaussian $N$-relay diamond network, there exists a subset of $k$ relays which alone provide approximately a fraction $frac{k}{k+1}$ of the total capacity. The result holds independent of the number of available relay nodes $N$, the channel configurations and the operating SNR. The approximation is within $3log N+3k$ bits/s/Hz to the capacity.
{"title":"Wireless network simplification: The Gaussian N-relay diamond network","authors":"Caner Nazaroglu, Ayfer Özgür, C. Fragouli","doi":"10.1109/ISIT.2011.6034010","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034010","url":null,"abstract":"We consider the Gaussian $N$-relay diamond network, where a source wants to communicate to a destination through a layer of $N$-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only $k$ out of the $N$ relays? We show that in every Gaussian $N$-relay diamond network, there exists a subset of $k$ relays which alone provide approximately a fraction $frac{k}{k+1}$ of the total capacity. The result holds independent of the number of available relay nodes $N$, the channel configurations and the operating SNR. The approximation is within $3log N+3k$ bits/s/Hz to the 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":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91076870","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
扫码关注我们
求助内容：
应助结果提醒方式：