Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404643
Omur Ozel, E. Ekrem, S. Ulukus
We consider the Gaussian wiretap channel with an amplitude constraint, i.e., a peak power constraint, on the channel input. We show that the entire rate-equivocation region of the Gaussian wiretap channel with an amplitude constraint is obtained by discrete input distributions with finite support. We prove this result by considering the existing single-letter description of the rate-equivocation region, and showing that discrete distributions with finite support exhaust this region. Our result highlights an important difference between the peak power constraint and the average power constraint cases: Although, in the average power constraint case, both the secrecy capacity and the capacity can be achieved simultaneously, our results show that in the peak power constraint case, in general, there is a tradeoff between the secrecy capacity and the capacity, in the sense that, both may not be achieved simultaneously.
{"title":"Gaussian wiretap channel with an amplitude constraint","authors":"Omur Ozel, E. Ekrem, S. Ulukus","doi":"10.1109/ITW.2012.6404643","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404643","url":null,"abstract":"We consider the Gaussian wiretap channel with an amplitude constraint, i.e., a peak power constraint, on the channel input. We show that the entire rate-equivocation region of the Gaussian wiretap channel with an amplitude constraint is obtained by discrete input distributions with finite support. We prove this result by considering the existing single-letter description of the rate-equivocation region, and showing that discrete distributions with finite support exhaust this region. Our result highlights an important difference between the peak power constraint and the average power constraint cases: Although, in the average power constraint case, both the secrecy capacity and the capacity can be achieved simultaneously, our results show that in the peak power constraint case, in general, there is a tradeoff between the secrecy capacity and the capacity, in the sense that, both may not be achieved simultaneously.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"5 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":"114241721","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.6404729
Steffen Schober, Ahmed S. Mansour
We consider the problem of estimating the entropy of a distribution P of unknown support size N provided with k independently drawn samples, where we are mainly focused on the low sampling regime where k <; N. By extending a method of Hausser and Strimmer [1], which assumes a known support size, by using the support size estimator of Chao and Lee [2], we obtain a simple estimator that performs equally good as the methods of Nemenman, Shafee, and Bialek [3] and Chao and Chen [4].
我们考虑一个未知支持大小N的分布P的熵估计问题，提供k个独立绘制的样本，其中我们主要关注k <;N.通过扩展Hausser和Strimmer[1]的方法，假设支持大小已知，使用Chao和Lee[2]的支持大小估计量，我们得到了一个简单的估计量，其性能与Nemenman, Shafee, and Bialek[3]和Chao和Chen[4]的方法一样好。
{"title":"On the estimation of entropy for unknown support size","authors":"Steffen Schober, Ahmed S. Mansour","doi":"10.1109/ITW.2012.6404729","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404729","url":null,"abstract":"We consider the problem of estimating the entropy of a distribution P of unknown support size N provided with k independently drawn samples, where we are mainly focused on the low sampling regime where k <; N. By extending a method of Hausser and Strimmer [1], which assumes a known support size, by using the support size estimator of Chao and Lee [2], we obtain a simple estimator that performs equally good as the methods of Nemenman, Shafee, and Bialek [3] and Chao and Chen [4].","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"60 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":"117321594","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.6404752
Willie K. Harrison, S. McLaughlin
In this paper, we analyze an attack scenario for the simple substitution cipher using the wiretap channel model, where the attacker only has access to error-prone ciphertext at the output of a packet erasure channel (PEC). Each packet is comprised of exactly one symbol of ciphertext, and hence, the attacker's channel could be viewed as a symbol erasure channel. Information-theoretic cryptanalysis provides key and message equivocations for the cipher in general, and then gives the results as functions of the error-free ciphertext equivocations. The findings characterize the increase in equivocation that might be expected if encrypted data were further encoded using wiretap codes that introduce symbol erasures to passive eavesdroppers.
{"title":"Equivocations for the simple substitution cipher with erasure-prone ciphertext","authors":"Willie K. Harrison, S. McLaughlin","doi":"10.1109/ITW.2012.6404752","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404752","url":null,"abstract":"In this paper, we analyze an attack scenario for the simple substitution cipher using the wiretap channel model, where the attacker only has access to error-prone ciphertext at the output of a packet erasure channel (PEC). Each packet is comprised of exactly one symbol of ciphertext, and hence, the attacker's channel could be viewed as a symbol erasure channel. Information-theoretic cryptanalysis provides key and message equivocations for the cipher in general, and then gives the results as functions of the error-free ciphertext equivocations. The findings characterize the increase in equivocation that might be expected if encrypted data were further encoded using wiretap codes that introduce symbol erasures to passive eavesdroppers.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"10 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":"126448624","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.6404669
Anxiao Jiang, Yue Li, Jehoshua Bruck
Codes that correct limited-magnitude errors for multi-level cell nonvolatile memories, such as flash memories and phase-change memories, have received interest in recent years. This work proposes a new coding scheme that generalizes a known result [2] and works for arbitrary error distributions. In this scheme, every cell's discrete level ℓ is mapped to its binary representation (bm-1, ..., b1,b0), where the m bits belong to m different error-correcting codes. The error ε in a cell is mapped to its binary representation (em-1, ..., e1, e0), and the codes are designed such that every error bit ei only affects the codeword containing the data bit bi. The m codewords are decoded sequentially to correct the bit-errors e0,e1, ..., em-1 in order. The scheme can be generalized to many more numeral systems for cell levels and errors, optimized cell-level labelings, and any number of cell levels. It can be applied not only to storage but also to amplitude-modulation communication systems.
{"title":"Bit-fixing codes for multi-level cells","authors":"Anxiao Jiang, Yue Li, Jehoshua Bruck","doi":"10.1109/ITW.2012.6404669","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404669","url":null,"abstract":"Codes that correct limited-magnitude errors for multi-level cell nonvolatile memories, such as flash memories and phase-change memories, have received interest in recent years. This work proposes a new coding scheme that generalizes a known result [2] and works for arbitrary error distributions. In this scheme, every cell's discrete level ℓ is mapped to its binary representation (b<sub>m-1</sub>, ..., b<sub>1</sub>,b<sub>0</sub>), where the m bits belong to m different error-correcting codes. The error ε in a cell is mapped to its binary representation (e<sub>m-1</sub>, ..., e<sub>1</sub>, e<sub>0</sub>), and the codes are designed such that every error bit ei only affects the codeword containing the data bit b<sub>i</sub>. The m codewords are decoded sequentially to correct the bit-errors e<sub>0</sub>,e<sub>1</sub>, ..., e<sub>m-1</sub> in order. The scheme can be generalized to many more numeral systems for cell levels and errors, optimized cell-level labelings, and any number of cell levels. It can be applied not only to storage but also to amplitude-modulation communication systems.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"12 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":"128831197","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.6404668
A. Bhatia, Aravind R. Iyengar, P. Siegel
We consider t-write codes for write-once memories with cells that can store multiple levels. Using worst-case sum-rate optimal 2-cell t-write code constructions for the asymptotic case of continuous levels, we derive 2-cell t-write code constructions that give good sum-rates for cells that support q discrete levels. A general encoding scheme for q-level 2-cell t-write codes is provided.
{"title":"Multilevel 2-cell t-write codes","authors":"A. Bhatia, Aravind R. Iyengar, P. Siegel","doi":"10.1109/ITW.2012.6404668","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404668","url":null,"abstract":"We consider t-write codes for write-once memories with cells that can store multiple levels. Using worst-case sum-rate optimal 2-cell t-write code constructions for the asymptotic case of continuous levels, we derive 2-cell t-write code constructions that give good sum-rates for cells that support q discrete levels. A general encoding scheme for q-level 2-cell t-write codes is provided.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"14 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":"128858641","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.6404655
A. Steele, S. Pumplün, F. Oggier
Nonassociative division algebras have been recently proposed as an alternative way to design fully-diverse space-time codes. In particular, nonassociative cyclic algebras provide division algebras more easily than their associative counter-part. In this paper, we propose a few space-time code constructions coming from both associative and nonassociative cyclic algebras of degree 4, suitable for 4 transmit and 2 receive antennas, which furthermore exhibit good fast-decodability.
{"title":"MIDO space-time codes from associative and nonassociative cyclic algebras","authors":"A. Steele, S. Pumplün, F. Oggier","doi":"10.1109/ITW.2012.6404655","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404655","url":null,"abstract":"Nonassociative division algebras have been recently proposed as an alternative way to design fully-diverse space-time codes. In particular, nonassociative cyclic algebras provide division algebras more easily than their associative counter-part. In this paper, we propose a few space-time code constructions coming from both associative and nonassociative cyclic algebras of degree 4, suitable for 4 transmit and 2 receive antennas, which furthermore exhibit good fast-decodability.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"108 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":"124148982","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.6404705
Mohammad Farzad Pourbabaee, M. Emadi, Arash Gholami Davoodi, M. Aref
In this paper, lattice based coding is used over two-user Gaussian state-dependent multiple access channel with common message for two channel models. First, it is assumed that the additive channel interference is noncausally known at both encoders. Exploiting a lattice encoding and decoding scheme, the effect of the interference is completely removed and the capacity region is achieved. Then, the multiple access channel with two additive interferences is considered in the case, where each interference is known noncausally to the associated transmitter. A pure lattice based encoding and decoding structure is proposed and an inner bound on the capacity region is derived which is valid for the entire range of channel signal to noise ratio and powers of interferences.
{"title":"Lattice coding for multiple access channels with common message and additive interference","authors":"Mohammad Farzad Pourbabaee, M. Emadi, Arash Gholami Davoodi, M. Aref","doi":"10.1109/ITW.2012.6404705","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404705","url":null,"abstract":"In this paper, lattice based coding is used over two-user Gaussian state-dependent multiple access channel with common message for two channel models. First, it is assumed that the additive channel interference is noncausally known at both encoders. Exploiting a lattice encoding and decoding scheme, the effect of the interference is completely removed and the capacity region is achieved. Then, the multiple access channel with two additive interferences is considered in the case, where each interference is known noncausally to the associated transmitter. A pure lattice based encoding and decoding structure is proposed and an inner bound on the capacity region is derived which is valid for the entire range of channel signal to noise ratio and powers of interferences.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"40 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":"132747324","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.6404681
A. Bracher, G. Pope, Christoph Studer
In this paper, we present novel probabilistic recovery guarantees for sparse signals subject to sparse interference, covering varying degrees of knowledge of the signal and interference support. Our results assume that the sparsifying dictionaries are characterized by coherence parameters and we require randomness only in the signal and/or interference. The obtained recovery guarantees show that one can recover sparsely corrupted signals with overwhelming probability, even if the sparsity of both the signal and interference scale (near) linearly with the number of measurements.
{"title":"Coherence-based probabilistic recovery guarantees for sparsely corrupted signals","authors":"A. Bracher, G. Pope, Christoph Studer","doi":"10.1109/ITW.2012.6404681","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404681","url":null,"abstract":"In this paper, we present novel probabilistic recovery guarantees for sparse signals subject to sparse interference, covering varying degrees of knowledge of the signal and interference support. Our results assume that the sparsifying dictionaries are characterized by coherence parameters and we require randomness only in the signal and/or interference. The obtained recovery guarantees show that one can recover sparsely corrupted signals with overwhelming probability, even if the sparsity of both the signal and interference scale (near) linearly with the number of measurements.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"104 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":"134620674","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.6404737
R. Timo, T. Oechtering, M. Wigger
We consider a lossless multi-terminal source coding problem with one transmitter, two receivers and side information. The achievable rate region of the problem is not well understood. In this paper, we characterise the rate region when the side information at one receiver is conditionally less noisy than the side information at the other, given this other receiver's desired source. The conditionally less noisy definition includes degraded side information and a common message as special cases, and it is motivated by the concept of less noisy broadcast channels. The key contribution of the paper is a new converse theorem employing a telescoping identity and the Csiszár sum identity.
{"title":"Source coding with conditionally less noisy side information","authors":"R. Timo, T. Oechtering, M. Wigger","doi":"10.1109/ITW.2012.6404737","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404737","url":null,"abstract":"We consider a lossless multi-terminal source coding problem with one transmitter, two receivers and side information. The achievable rate region of the problem is not well understood. In this paper, we characterise the rate region when the side information at one receiver is conditionally less noisy than the side information at the other, given this other receiver's desired source. The conditionally less noisy definition includes degraded side information and a common message as special cases, and it is motivated by the concept of less noisy broadcast channels. The key contribution of the paper is a new converse theorem employing a telescoping identity and the Csiszár sum identity.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"7 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":"123863582","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.6404755
Lu Gan, Kezhi Li, Cong Ling
This paper introduces Golay-paired Hadamard matrices for fast compressed sensing of sparse signals in the time or spectral domain. These sampling operators feature low-memory requirement, hardware-friendly implementation and fast computation in reconstruction. We show that they require a nearly optimal number of measurements for faithful reconstruction of a sparse signal in the time or frequency domain. Simulation results demonstrate that the proposed sensing matrices offer a reconstruction performance similar to that of fully random matrices.
{"title":"Golay meets Hadamard: Golay-paired Hadamard matrices for fast compressed sensing","authors":"Lu Gan, Kezhi Li, Cong Ling","doi":"10.1109/ITW.2012.6404755","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404755","url":null,"abstract":"This paper introduces Golay-paired Hadamard matrices for fast compressed sensing of sparse signals in the time or spectral domain. These sampling operators feature low-memory requirement, hardware-friendly implementation and fast computation in reconstruction. We show that they require a nearly optimal number of measurements for faithful reconstruction of a sparse signal in the time or frequency domain. Simulation results demonstrate that the proposed sensing matrices offer a reconstruction performance similar to that of fully random matrices.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"12 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":"124535331","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
扫码关注我们
求助内容：
应助结果提醒方式：