Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523697
Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung
In this paper, we derive linear complexity over Fp of the M-ary Sidel'nikov sequences using discrete Fourier transform. As an example, we represent the linear complexity of the ternary Sidel'nikov sequences. It turned out that the ternary Sidel'nikov sequences have the linear complexity nearly close to their periods
本文利用离散傅里叶变换，导出了m - y Sidel'nikov序列在Fp上的线性复杂度。作为一个例子，我们表示了三元Sidel'nikov序列的线性复杂度。结果表明，三元Sidel'nikov序列具有接近其周期的线性复杂度
{"title":"On the linear complexity over F/sub p/ of M-ary Sidel'nikov sequences","authors":"Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung","doi":"10.1109/ISIT.2005.1523697","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523697","url":null,"abstract":"In this paper, we derive linear complexity over Fp of the M-ary Sidel'nikov sequences using discrete Fourier transform. As an example, we represent the linear complexity of the ternary Sidel'nikov sequences. It turned out that the ternary Sidel'nikov sequences have the linear complexity nearly close to their periods","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116040292","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523307
R. Omrani, P. V. Kumar
Some bounds and efficient constructions for 2-D optical orthogonal codes (OOC) in which spreading is carried out over both wavelength and time are provided. Such codes are of current practical interest as they enable fiber-optic communication at lower chip rates. The bounds provided include 2-D versions of the Johnson bound as well as a novel bound based on an extension of the Johnson bound to non-binary alphabets. The Singleton bound is recovered as a special instance of this bound. Several constructions of 2-D OOC are presented in the paper and almost all of these are either optimal or else asymptotically optimum in the sense of having code size that equals or approaches the maximum possible as the size of the code matrix (along the dimension associated to time) approaches infinity. Our principal construction views each wavelength-time OOC as the plot of a function and the functions employed in the constructions belonging to this class are either polynomials or rational functions. Other constructions include a technique for deriving 2-D OOCs from 1-D OOCs using the Chinese remainder theorem, a means of making use of MDS codes to construct 2-D OOCs satisfying the one-pulse-per-wavelength constraint and a method of concatenating a constant-weight code with a one-pulse-per-wavelength 2-D OOC to generate OOCs with at most one pulse per wavelength
{"title":"Improved constructions and bounds for 2-D optical orthogonal codes","authors":"R. Omrani, P. V. Kumar","doi":"10.1109/ISIT.2005.1523307","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523307","url":null,"abstract":"Some bounds and efficient constructions for 2-D optical orthogonal codes (OOC) in which spreading is carried out over both wavelength and time are provided. Such codes are of current practical interest as they enable fiber-optic communication at lower chip rates. The bounds provided include 2-D versions of the Johnson bound as well as a novel bound based on an extension of the Johnson bound to non-binary alphabets. The Singleton bound is recovered as a special instance of this bound. Several constructions of 2-D OOC are presented in the paper and almost all of these are either optimal or else asymptotically optimum in the sense of having code size that equals or approaches the maximum possible as the size of the code matrix (along the dimension associated to time) approaches infinity. Our principal construction views each wavelength-time OOC as the plot of a function and the functions employed in the constructions belonging to this class are either polynomials or rational functions. Other constructions include a technique for deriving 2-D OOCs from 1-D OOCs using the Chinese remainder theorem, a means of making use of MDS codes to construct 2-D OOCs satisfying the one-pulse-per-wavelength constraint and a method of concatenating a constant-weight code with a one-pulse-per-wavelength 2-D OOC to generate OOCs with at most one pulse per wavelength","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122378493","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523364
A. Sahai, S. Draper, M. Gastpar
For the point-to-point additive white Gaussian noise (AWGN) channel with noiseless feedback and an average power constraint, Schalkwijk and Kailath's scheme achieves a doubly-exponential decay of the probability of error. While some coding schemes for networks with noiseless feedback incorporate variations on the Schalkwijk-Kailath scheme, they do not in general achieve better than single-exponential decays in their probabilities of error everywhere in their achievable rate regions. We give a technique that can boost the reliability as high as desired of any from a large class of block coding schemes for networks with feedback. The technique relies crucially on the average nature of the power constraints. We explain and illustrate our results in the context of Ozarow's feedback strategy for the AWGN multiple-access channel
{"title":"Boosting reliability over AWGN networks with average power constraints and noiseless feedback","authors":"A. Sahai, S. Draper, M. Gastpar","doi":"10.1109/ISIT.2005.1523364","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523364","url":null,"abstract":"For the point-to-point additive white Gaussian noise (AWGN) channel with noiseless feedback and an average power constraint, Schalkwijk and Kailath's scheme achieves a doubly-exponential decay of the probability of error. While some coding schemes for networks with noiseless feedback incorporate variations on the Schalkwijk-Kailath scheme, they do not in general achieve better than single-exponential decays in their probabilities of error everywhere in their achievable rate regions. We give a technique that can boost the reliability as high as desired of any from a large class of block coding schemes for networks with feedback. The technique relies crucially on the average nature of the power constraints. We explain and illustrate our results in the context of Ozarow's feedback strategy for the AWGN multiple-access channel","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122597728","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523512
Khoongming Khoo, Guat-Ee Tan, Hian-Kiat Lee, G. Gong
In this paper the impact of the more recent stream cipher attacks like time-memory-data trade-off attacks and algebraic attacks on filter function keystream generators are studied. The attacks succeed when the filter function is based on concatenation of linear functions. As an alternative, some known constructions based on finite fields which are not susceptible to these attacks are presented. Two new finite field constructions were also introduced, one based on the GMW construction and the other based on an efficient exhaustive search
{"title":"Comparison of boolean function design","authors":"Khoongming Khoo, Guat-Ee Tan, Hian-Kiat Lee, G. Gong","doi":"10.1109/ISIT.2005.1523512","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523512","url":null,"abstract":"In this paper the impact of the more recent stream cipher attacks like time-memory-data trade-off attacks and algebraic attacks on filter function keystream generators are studied. The attacks succeed when the filter function is based on concatenation of linear functions. As an alternative, some known constructions based on finite fields which are not susceptible to these attacks are presented. Two new finite field constructions were also introduced, one based on the GMW construction and the other based on an efficient exhaustive search","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853442","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523678
Fung-Ling Chiu, N. Yu, G. Gong
Multiple access interference (MAI) in CDMA system is related to the correlation of the transmitted signals from multiple users. In this work, we investigate the correlations of binary signal sets over fading channels, particularly the Gold and Kasami signal sets. A lower bound on the maximum correlation with fading is established. Moreover, an asymptotic bound depending on the length of the sequence and the first and second order statistics of the fading distribution is derived for independent fading channel, while an approximation to the maximum correlation is obtained for correlative fading channel. To analyze the fading effect on cross correlation, experimental results show that the distribution of cross correlation in slow fading environment is similar to the one without fading
{"title":"Maximum correlation of binary signals over fading channels","authors":"Fung-Ling Chiu, N. Yu, G. Gong","doi":"10.1109/ISIT.2005.1523678","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523678","url":null,"abstract":"Multiple access interference (MAI) in CDMA system is related to the correlation of the transmitted signals from multiple users. In this work, we investigate the correlations of binary signal sets over fading channels, particularly the Gold and Kasami signal sets. A lower bound on the maximum correlation with fading is established. Moreover, an asymptotic bound depending on the length of the sequence and the first and second order statistics of the fading distribution is derived for independent fading channel, while an approximation to the maximum correlation is obtained for correlative fading channel. To analyze the fading effect on cross correlation, experimental results show that the distribution of cross correlation in slow fading environment is similar to the one without fading","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122907985","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523291
Hui Jin, T. Richardson
We show for a large class of LDPC ensembles, including RA and IRA codes, that the bit iterative decoding threshold is essentially identical to the block iterative decoding threshold
我们展示了一大类LDPC集成，包括RA和IRA码，比特迭代解码阈值本质上与块迭代解码阈值相同
{"title":"Block Error Iterative Decoding Capacity for LDPC Codes","authors":"Hui Jin, T. Richardson","doi":"10.1109/ISIT.2005.1523291","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523291","url":null,"abstract":"We show for a large class of LDPC ensembles, including RA and IRA codes, that the bit iterative decoding threshold is essentially identical to the block iterative decoding threshold","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114271509","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523695
Honggang Hu, L. Hu, D. Feng
Recently Xing et al constructed some families of binary sequences with low correlation and large linear complexity by making use of the theory of Artin-Schreier extensions of function fields. In this paper, we present a new construction by using the theory of Kummer extensions of function fields. The analysis shows than they have large periods, large linear complexities, and low correlations. In some cases, our method is better than that of Xing et al
{"title":"A new class of binary sequences with low correlation and large linear complexity from function fields","authors":"Honggang Hu, L. Hu, D. Feng","doi":"10.1109/ISIT.2005.1523695","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523695","url":null,"abstract":"Recently Xing et al constructed some families of binary sequences with low correlation and large linear complexity by making use of the theory of Artin-Schreier extensions of function fields. In this paper, we present a new construction by using the theory of Kummer extensions of function fields. The analysis shows than they have large periods, large linear complexities, and low correlations. In some cases, our method is better than that of Xing et al","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114547178","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523772
N. Macris
It is shown that a correlation inequality of statistical mechanics can be applied to low-density parity-check codes. Thanks to this tool we prove that the growth rate of regular LDPC codes, can be exactly calculated by iterative methods, at least on the interval where it is a concave function of the relative weight of code words. We also consider communication over a binary input additive white Gaussian noise channel with a Poisson LDPC code and prove that (at least part of) the GEXIT curve (associated to MAP decoding) can also be computed exactly by the belief propagation decoder. In both problems, the correlation inequality yields sharp lower bounds. We also use a non trivial extension of the interpolation techniques that have recently led to rigorous results in spin glass theory and in the SAT problem
{"title":"Correlation inequalities: a useful tool in the theory of LDPC codes","authors":"N. Macris","doi":"10.1109/ISIT.2005.1523772","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523772","url":null,"abstract":"It is shown that a correlation inequality of statistical mechanics can be applied to low-density parity-check codes. Thanks to this tool we prove that the growth rate of regular LDPC codes, can be exactly calculated by iterative methods, at least on the interval where it is a concave function of the relative weight of code words. We also consider communication over a binary input additive white Gaussian noise channel with a Poisson LDPC code and prove that (at least part of) the GEXIT curve (associated to MAP decoding) can also be computed exactly by the belief propagation decoder. In both problems, the correlation inequality yields sharp lower bounds. We also use a non trivial extension of the interpolation techniques that have recently led to rigorous results in spin glass theory and in the SAT problem","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114596530","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523759
S. Myung, Kyeongcheol Yang
In this paper, we analyze some cycle properties of quasi-cyclic low-density parity-check (QC-LDPC) codes and show that the girth of a QC-LDPC code is upper bounded by a certain number introduced by the structure of its mother matrix. We also propose a simple method to extend QC-LDPC codes of large length by lifting QC-LDPC codes of smaller length. In particular, it is possible to generate them from a single exponent matrix by a proper modulo-operation. Simulation results show that the more we apply the lifting to QC-LDPC codes, the more memory efficiency becomes better, but it may induce a little performance degradation
{"title":"Extension of quasi-cyclic LDPC codes by lifting","authors":"S. Myung, Kyeongcheol Yang","doi":"10.1109/ISIT.2005.1523759","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523759","url":null,"abstract":"In this paper, we analyze some cycle properties of quasi-cyclic low-density parity-check (QC-LDPC) codes and show that the girth of a QC-LDPC code is upper bounded by a certain number introduced by the structure of its mother matrix. We also propose a simple method to extend QC-LDPC codes of large length by lifting QC-LDPC codes of smaller length. In particular, it is possible to generate them from a single exponent matrix by a proper modulo-operation. Simulation results show that the more we apply the lifting to QC-LDPC codes, the more memory efficiency becomes better, but it may induce a little performance degradation","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117027115","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523734
Y. Steinberg, S. Shamai
In this paper we study coding for the general broadcast channel, controlled by random parameters, where the parameters are provided to the encoder only, in a non-causal manner. We give an achievable region which is an extension of the Marion region to the current model. The region we derive is shown to be tight for the Gaussian broadcast channel with additive interference at the two channels
{"title":"Achievable rates for the broadcast channel with states known at the transmitter","authors":"Y. Steinberg, S. Shamai","doi":"10.1109/ISIT.2005.1523734","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523734","url":null,"abstract":"In this paper we study coding for the general broadcast channel, controlled by random parameters, where the parameters are provided to the encoder only, in a non-causal manner. We give an achievable region which is an extension of the Marion region to the current model. The region we derive is shown to be tight for the Gaussian broadcast channel with additive interference at the two channels","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128391877","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
扫码关注我们
求助内容：
应助结果提醒方式：