{"title":"On the self-interferences of SS codes generated by a Markov chain","authors":"Y. Jitsumatsu, T. Kohda","doi":"10.1109/ISIT.2002.1023339","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023339","url":null,"abstract":"We discuss the self-interferences of spreading sequences (SS) codes for asynchronous DS/CDMA systems, generated by a Markov chain, and give an estimated BER of a nearly synchronized correlation receiver.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"15 2","pages":"67-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72572937","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}
{"title":"Spectra of shot noises and Hawkes branching point processes","authors":"P. Brémaud, L. Massoulié","doi":"10.1109/ISIT.2002.1023282","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023282","url":null,"abstract":"We give: (1) the Cramer spectrum of the general shot noise process with random excitation and non-Poisson stationary driving point processes; and (2) the Bartlett spectrum of the Hawkes branching point process with random excitation and non-Poisson stationary driving point processes.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"22 1","pages":"10-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74000812","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}
Sunghwan Kim, Gang-Mi Gil, Kyung-Hee Kim, Jong-Seon No
{"title":"Generalized bent functions constructed from partial spreads","authors":"Sunghwan Kim, Gang-Mi Gil, Kyung-Hee Kim, Jong-Seon No","doi":"10.1109/ISIT.2002.1023313","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023313","url":null,"abstract":"In this paper, new generalized bent functions from the finite field F/sub p/n to the prime field F/sub p/ are constructed from partial spreads for n = 2m and odd prime p.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"5 1","pages":"41-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84179396","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}
{"title":"Density evolution for multistage CDMA multiuser detector","authors":"Toshiyuki TANAKA","doi":"10.1109/ISIT.2002.1023295","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023295","url":null,"abstract":"An analytical framework to analyze the stage-by-stage detection dynamics of the multistage CDMA multiuser detector is presented. The density evolution idea is applied to analyze the multistage detector. Message distribution is treated basically by a Gaussian approximation, but interstage correlation of messages is systematically taken into account, which turns out to provide significant improvement.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"1 1","pages":"23-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84440641","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}
{"title":"Extrinsic and intrinsic information in systematic coding","authors":"S. Huettinger, J. Huber","doi":"10.1109/ISIT.2002.1023388","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023388","url":null,"abstract":"The analytical separation of extrinsic and intrinsic parts of the decoder output connects new analysis methods e.g., the EXIT charts, to traditional performance measures (e.g., bit error ratio, first error event probability) and their soft-output equivalents.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"22 1","pages":"116-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85499212","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}
Louis G. F. Trichard, Jamie Evans, Iain B. Collings
{"title":"Optimal linear multistage receivers and the recursive large system SIR","authors":"Louis G. F. Trichard, Jamie Evans, Iain B. Collings","doi":"10.1109/ISIT.2002.1023293","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023293","url":null,"abstract":"In this paper, we analyse the output signal to interference-plus-noise ratio (SIR) of the optimal linear multistage receiver based on a weighted matrix polynomial expansion. By \"optimal\" we mean the linear multistage receiver which minimises the mean squared error between the data symbol and the data estimate for user k with respect to the polynomial coefficients at stage m. Our main contribution is the direct derivation of the recursive large system SIR of the optimal linear multistage receiver.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"7 1","pages":"21-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79793862","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}
{"title":"On zero-error coding of correlated sources","authors":"P. Koulgi, E. Tuncel, S. Regunathan, K. Rose","doi":"10.1109/ISIT.2002.1023334","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023334","url":null,"abstract":"The authors consider the following simple encoding scenario, which they term successive encoding: /spl phi//sub x/ performs lossless encoding of X, at rate H(X), and /spl phi//sub y/ is designed assuming that the decoder has recovered X. For coding with vanishing error probability, the results of Slepian and Wolf (1973) show that time-sharing of the two possible successive encoding scenarios (obtained by interchanging the roles of X and Y) is optimal, in that all achievable rate pairs can be achieved via this strategy. But time-sharing combined with successive encoding may not be an optimal strategy in the case of zero-error coding. The authors construct a simple example for this suboptimality phenomenon.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"55 1","pages":"62-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84728782","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}
{"title":"On the constructions and nonlinearity of binary vector correlation-immune functions","authors":"Lusheng Chen, Fang-Wei Fu, V. Wei","doi":"10.1109/ISIT.2002.1023311","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023311","url":null,"abstract":"The constructions and nonlinearity of binary vector correlation-immune functions are studied in this paper.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"171 4 1","pages":"39-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85476139","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}
{"title":"On employment of LFSRs over GF(q) in certain stream ciphers","authors":"P. Camion, M. Mihaljević, H. Imai","doi":"10.1109/ISIT.2002.1023482","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023482","url":null,"abstract":"This paper points out a possibility for malicious selection of the linear feedback shift registers (LFSRs) feedback polynomials in order to install a trap-door for the cryptanalysis.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"1 1","pages":"210-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83743284","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}
{"title":"Achieving multiuser diversity under hard fairness constraints","authors":"R. Knopp","doi":"10.1109/ISIT.2002.1023723","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023723","url":null,"abstract":"The focus of this study is the concept of multiuser diversity in the context of a single-cell multiuser channel. The primary result of this work is that using proper dynamic resource allocation strategies on Rayleigh fading channels can yield a non-negligible power boost which can be as high as 5 or 6 dB, for a moderate number of users employing a joint resource allocation policy. This gain grows logarithmically with the number of users. The main practical issue arising from these results is fairness. Users must wait (or the base station in the case of the broadcast channel) until their channel conditions are favourable enough to transmit. We show in this work that multiuser diversity can still be achieved in a multi-carrier system using simple orthogonal multiplexing even under the constraint that each user receives the same constant bandwidth resource at any time instant.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"487 1 1","pages":"451-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80508409","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}