Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261761
A. Khisti, E. Martinian, G. Wornell
We use the distortion side information (DSI) framework to study the gains in information embedding when the encoder exploits sensitivity of the source samples. Our study for the Gaussian source model extends the dirty paper coding result by Costa to the case of a weighted power constraint with the weights only known to the transmitter. A coding scheme based on fixed codebook variable-partition codes is presented for this problem. We also present another coding scheme that exploits the knowledge of DSI and is robust against intentional attacks. Finally, we study a related problem of Wyner-Ziv coding with reliability side information (RSI) at the decoder. This latter setup illustrates that fixed codebook variable-partition codes could also be fundamental in systems that rely on conventional distortion measures
{"title":"Information Embedding with Distortion Side Information","authors":"A. Khisti, E. Martinian, G. Wornell","doi":"10.1109/ISIT.2006.261761","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261761","url":null,"abstract":"We use the distortion side information (DSI) framework to study the gains in information embedding when the encoder exploits sensitivity of the source samples. Our study for the Gaussian source model extends the dirty paper coding result by Costa to the case of a weighted power constraint with the weights only known to the transmitter. A coding scheme based on fixed codebook variable-partition codes is presented for this problem. We also present another coding scheme that exploits the knowledge of DSI and is robust against intentional attacks. Finally, we study a related problem of Wyner-Ziv coding with reliability side information (RSI) at the decoder. This latter setup illustrates that fixed codebook variable-partition codes could also be fundamental in systems that rely on conventional distortion measures","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128358449","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261691
P. Gaborit, O. Ruatta
In this paper we give an algorithm with complexity O(mu2 ) to solve Hermite multivariate polynomial interpolation with mu conditions on its Hasse derivatives. In the case of bivariate interpolation used to perform list-decoding on Reed-Solomon of length n and dimension k with multiplicity m on each point, it permits to obtain a complexity in O(n2m4) which does not depend on the rate k/n and better than previously known complexity in O( n2 m5(n/k)(1/2)). This algorithm can also be used for recent interpolation list-decoding with three and more variables. For interpolation on polynomial with n points and M variables with prescribed multiplication order m the general complexity of the algorithm is O(n2m2M)
{"title":"Improved Hermite multivariate polynomial interpolation","authors":"P. Gaborit, O. Ruatta","doi":"10.1109/ISIT.2006.261691","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261691","url":null,"abstract":"In this paper we give an algorithm with complexity O(mu<sup>2 </sup>) to solve Hermite multivariate polynomial interpolation with mu conditions on its Hasse derivatives. In the case of bivariate interpolation used to perform list-decoding on Reed-Solomon of length n and dimension k with multiplicity m on each point, it permits to obtain a complexity in O(n<sup>2</sup>m<sup>4</sup>) which does not depend on the rate k/n and better than previously known complexity in O( n<sup>2 </sup>m<sup>5</sup>(n/k)<sup>(1/2)</sup>). This algorithm can also be used for recent interpolation list-decoding with three and more variables. For interpolation on polynomial with n points and M variables with prescribed multiplication order m the general complexity of the algorithm is O(n<sup>2</sup>m<sup>2M</sup>)","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451690","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 : 2006-07-09DOI: 10.1109/ISIT.2006.262083
H. Imai, Kirill Morozov, Anderson C. A. Nascimento, A. Winter
Bit commitment is an important tool for constructing zero-knowledge proofs and multi-party computation. Unconditionally secure bit commitment can be based, in particular, on noisy channel or correlation where noise considered a valuable resource. Recently, Winter, Nascimento and Imai introduced the concept of commitment capacity, the maximal ratio between the length of a string which the sender commits to and the number of times the noisy channel/correlation is used. They also proved that for any discrete memoryless channel there exists a secure protocol achieving its commitment capacity however, no particular construction was given. Solving their open question, we provide an efficient protocol for achieving the commitment capacity of discrete memoryless systems (noisy channels and correlations)
{"title":"Efficient Protocols Achieving the Commitment Capacity of Noisy Correlations","authors":"H. Imai, Kirill Morozov, Anderson C. A. Nascimento, A. Winter","doi":"10.1109/ISIT.2006.262083","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262083","url":null,"abstract":"Bit commitment is an important tool for constructing zero-knowledge proofs and multi-party computation. Unconditionally secure bit commitment can be based, in particular, on noisy channel or correlation where noise considered a valuable resource. Recently, Winter, Nascimento and Imai introduced the concept of commitment capacity, the maximal ratio between the length of a string which the sender commits to and the number of times the noisy channel/correlation is used. They also proved that for any discrete memoryless channel there exists a secure protocol achieving its commitment capacity however, no particular construction was given. Solving their open question, we provide an efficient protocol for achieving the commitment capacity of discrete memoryless systems (noisy channels and correlations)","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128170372","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261879
Jiaping Liu, A. Calderbank
This paper introduces a new full-rate, full-diversity space-time code for 4 transmit antennas. The 4times4 codeword matrix consists of four 2times2 Alamouti blocks with entries from Q(i, radic5), and these blocks can be viewed as quaternions which in turn represent rotations in R3. The Alamouti blocks that appear in a codeword are drawn from the icosian ring consisting of all linear combinations of 120 basic rotations corresponding to symmetries of the icosahedron. This algebraic structure is different from the Golden code, but the complex entries are taken from a similar underlying field. The minimum determinant is bounded below by a constant that is independent of the signal constellation, and the new code admits a simple decoding scheme that makes use of a geometric correspondence between the icosian ring and the E8 lattice
{"title":"The Icosian Code and the E8 Lattice: A New 4 × 4 Space-Time Code with Non-vanishing Determinant","authors":"Jiaping Liu, A. Calderbank","doi":"10.1109/ISIT.2006.261879","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261879","url":null,"abstract":"This paper introduces a new full-rate, full-diversity space-time code for 4 transmit antennas. The 4times4 codeword matrix consists of four 2times2 Alamouti blocks with entries from Q(i, radic5), and these blocks can be viewed as quaternions which in turn represent rotations in R3. The Alamouti blocks that appear in a codeword are drawn from the icosian ring consisting of all linear combinations of 120 basic rotations corresponding to symmetries of the icosahedron. This algebraic structure is different from the Golden code, but the complex entries are taken from a similar underlying field. The minimum determinant is bounded below by a constant that is independent of the signal constellation, and the new code admits a simple decoding scheme that makes use of a geometric correspondence between the icosian ring and the E8 lattice","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128210623","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261752
L. Cazzanti, M. Gupta
We introduce a definition of similarity based on Tversky's set-theoretic linear contrast model and on information-theoretic principles. The similarity measures the residual entropy with respect to a random object. This residual entropy similarity strongly captures context, which we conjecture is important for similarity-based statistical learning. Properties of the similarity definition are established and examples illustrate its characteristics. We show that a previously-defined information-theoretic similarity is also set-theoretic, and compare it to the residual entropy similarity. The similarity between random objects is also treated
{"title":"Information-theoretic and Set-theoretic Similarity","authors":"L. Cazzanti, M. Gupta","doi":"10.1109/ISIT.2006.261752","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261752","url":null,"abstract":"We introduce a definition of similarity based on Tversky's set-theoretic linear contrast model and on information-theoretic principles. The similarity measures the residual entropy with respect to a random object. This residual entropy similarity strongly captures context, which we conjecture is important for similarity-based statistical learning. Properties of the similarity definition are established and examples illustrate its characteristics. We show that a previously-defined information-theoretic similarity is also set-theoretic, and compare it to the residual entropy similarity. The similarity between random objects is also treated","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128252932","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 : 2006-07-09DOI: 10.1109/ISIT.2006.262045
Xue-Bin Liang
Ahlswede, Cai, Li, and Yeung have proposed a new paradigm of network coding in multicast networks. They demonstrated that network coding can achieve the maximum information flow in the single-source multicast networks beyond the conventional network switching. A basic problem arising here is that, for a given single-source multicast network, what is the switching gap of the network defined as the ratio of the maximum information flow in the multicast network with network coding to that only with network switching. In this brief, we investigate the maximum possible switching gap of Ahlswede-Cai-Li-Yeung's single-source multicast network and find some condition, in terms of the capacity of links, under which Ahlswede-Cai-Li-Yeung's network has the minimum possible switching gap of one
{"title":"On the Switching Gap of Ahlswede-Cai-Li-Yeung's Single-Source Multicast Network","authors":"Xue-Bin Liang","doi":"10.1109/ISIT.2006.262045","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262045","url":null,"abstract":"Ahlswede, Cai, Li, and Yeung have proposed a new paradigm of network coding in multicast networks. They demonstrated that network coding can achieve the maximum information flow in the single-source multicast networks beyond the conventional network switching. A basic problem arising here is that, for a given single-source multicast network, what is the switching gap of the network defined as the ratio of the maximum information flow in the multicast network with network coding to that only with network switching. In this brief, we investigate the maximum possible switching gap of Ahlswede-Cai-Li-Yeung's single-source multicast network and find some condition, in terms of the capacity of links, under which Ahlswede-Cai-Li-Yeung's network has the minimum possible switching gap of one","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"26 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129561050","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261791
Xiangyong Zeng, Qingchong Liu, L. Hu
A family of [2n - 1, 5n/2, 2n-1 - 2n/2 ] codes with n even is proposed and the weight distribution is completely determined. These codes are applied to construct new families of binary sequences with period (2n $1), including the small set of Kasami sequences. The binary sequence families have the same family size and correlation values as the large set of Kasami sequences
{"title":"A New Family of Codes and Generalized Kasami Sequences","authors":"Xiangyong Zeng, Qingchong Liu, L. Hu","doi":"10.1109/ISIT.2006.261791","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261791","url":null,"abstract":"A family of [2<sup>n</sup> - 1, 5n/2, 2<sup>n-1</sup> - 2<sup>n/2 </sup>] codes with n even is proposed and the weight distribution is completely determined. These codes are applied to construct new families of binary sequences with period (2<sup>n</sup> $1), including the small set of Kasami sequences. The binary sequence families have the same family size and correlation values as the large set of Kasami sequences","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127070675","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261944
Xiaohu Shang, Biao Chen, M. Gans
We develop a procedure to compute a lower bound of the sum capacity for the vector Gaussian interference channel (IFC). The obtained lower bound is shown to be tight for the very strong interference case and the procedure can be used to construct an inner bound for the vector Gaussian IFC. Alternatively, orthogonal transmission via frequency division multiplexing is considered and we establish the concavity of the sum rate as a function of the bandwidth allocation factor for the vector channel case. Numerical examples indicate that the achievable sum rate via the superposition code compares favorably with orthogonal transmission. This improvement holds for all interference power levels, a sharp contrast to that of the scalar counterpart
{"title":"On Achievable Sum Rate for Vector Gaussian Interference Channels","authors":"Xiaohu Shang, Biao Chen, M. Gans","doi":"10.1109/ISIT.2006.261944","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261944","url":null,"abstract":"We develop a procedure to compute a lower bound of the sum capacity for the vector Gaussian interference channel (IFC). The obtained lower bound is shown to be tight for the very strong interference case and the procedure can be used to construct an inner bound for the vector Gaussian IFC. Alternatively, orthogonal transmission via frequency division multiplexing is considered and we establish the concavity of the sum rate as a function of the bandwidth allocation factor for the vector channel case. Numerical examples indicate that the achievable sum rate via the superposition code compares favorably with orthogonal transmission. This improvement holds for all interference power levels, a sharp contrast to that of the scalar counterpart","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126967039","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 : 2006-07-09DOI: 10.1109/ISIT.2006.262050
E. Stauffer, D. Tujkovic, A. Paulraj
Recently, there has been a great deal of interest on the performance of MIMO wireless systems as the MIMO fading channel offers an increase in capacity and reliability over that of a SISO channel. When channel state information is not known at the transmitter, the level of performance obtained depends on the degree of cooperation between the transmit antennas. With no cooperation between the antennas, horizontally coded spatial multiplexing is diversity suboptimal since each message bit is encoded and transmitted by only one antenna. An optimal scheme, on the other hand, codes message bits across all transmit antennas. This work generalizes and quantifies the level of cooperation between transmit antennas with the cooperation parameter R c and then finds upper and lower bounds for the achievable data rates for such a system using a scaled identity transmit covariance matrix. These bounds are found to be tight for certain values of Rc and the data rate Rt. Finally, these bounds are useful in computing the outage probability and diversity order of partially cooperative MIMO systems when channel state information is not known at the transmitter
{"title":"Partially Cooperative MIMO Channels with Scaled Identity Transmit Covariance","authors":"E. Stauffer, D. Tujkovic, A. Paulraj","doi":"10.1109/ISIT.2006.262050","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262050","url":null,"abstract":"Recently, there has been a great deal of interest on the performance of MIMO wireless systems as the MIMO fading channel offers an increase in capacity and reliability over that of a SISO channel. When channel state information is not known at the transmitter, the level of performance obtained depends on the degree of cooperation between the transmit antennas. With no cooperation between the antennas, horizontally coded spatial multiplexing is diversity suboptimal since each message bit is encoded and transmitted by only one antenna. An optimal scheme, on the other hand, codes message bits across all transmit antennas. This work generalizes and quantifies the level of cooperation between transmit antennas with the cooperation parameter R c and then finds upper and lower bounds for the achievable data rates for such a system using a scaled identity transmit covariance matrix. These bounds are found to be tight for certain values of Rc and the data rate Rt. Finally, these bounds are useful in computing the outage probability and diversity order of partially cooperative MIMO systems when channel state information is not known at the transmitter","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126971503","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261773
Jing Liu, T. Davidson, K. M. Wong
We consider a multi-input multi-output (MIMO) communication system equipped with a linear minimum mean-square error (MMSE) receiver. We design a full-rate linear space-time block code (STBC) for blocks of data that span several realizations of a block-static fading channel to achieve high diversity gain. The proposed code structures are necessary and sufficient to minimize the detection error probability. They also enable the detection computations to be partitioned into separate blocks such that the normalized complexity is reduced to little more than that for a single block. The additional complexity grows only linearly with L, the number of blocks for which the code design covers. Analysis shows that the diversity gain achieved by the code also grows linearly with L. This is confirmed by simulation results
{"title":"Design of Space-Time Multi-Block Codes for MIMO Systems with Linear MMSE Receivers","authors":"Jing Liu, T. Davidson, K. M. Wong","doi":"10.1109/ISIT.2006.261773","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261773","url":null,"abstract":"We consider a multi-input multi-output (MIMO) communication system equipped with a linear minimum mean-square error (MMSE) receiver. We design a full-rate linear space-time block code (STBC) for blocks of data that span several realizations of a block-static fading channel to achieve high diversity gain. The proposed code structures are necessary and sufficient to minimize the detection error probability. They also enable the detection computations to be partitioned into separate blocks such that the normalized complexity is reduced to little more than that for a single block. The additional complexity grows only linearly with L, the number of blocks for which the code design covers. Analysis shows that the diversity gain achieved by the code also grows linearly with L. This is confirmed by simulation results","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130633957","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
扫码关注我们
求助内容：
应助结果提醒方式：