{"title":"Arithmetic coding for noisy channels","authors":"J. Sayir","doi":"10.1109/ITCOM.1999.781412","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781412","url":null,"abstract":"Arithmetic coding is generalized to provide a method for transforming source output sequences into sequences whose probability distribution approaches any desired probability distribution. A further modification in which gaps are introduced between source intervals allows arithmetic encoders to produce code sequences with any information rate, enabling the encoder to perform joint source-channel coding. The results of a simulation are presented where arithmetic coding is used as a channel encoder in conjunction with a sequential decoder.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124075101","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":"Identification via noiseless channels with noisy feedback","authors":"C. Kleinewachter","doi":"10.1109/ITCOM.1999.781419","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781419","url":null,"abstract":"We give an upper bound on the rate of deterministic identification code for discrete noise and memoryless channels with noisy feedback. This upper bound coincides with the lower bound of Ahlswede and Zhang (see SFB 343 Diskrete Strukturen in der Mathematik, Bielefeld, Preprint 94-010, 1994), so this gives the capacity for this type of channel.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"81 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131706786","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":"Hausdorff dimension as a new dimension in source coding and predicting","authors":"B. Ryabko, J. Suzuki, F. Topsøe","doi":"10.1109/ITCOM.1999.781411","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781411","url":null,"abstract":"It is generally accepted that investigations in universal coding and predicting are based on the model of stationary ergodic sources. In this report we show that this model does not give possibilities to investigate large important classes of source codes and to distinguish asymptotic performances of popular universal codes. A new approach suggested here is to consider a set of all infinite sequences (over a given alphabet) and estimate the size of sets of compressible sequences with the help of Hausdorff dimension. This approach enables us, first, to show that there exist large sets of well compressible (and predictable) sequences which have got zero measure for every stationary and ergodic measure, and second, to distinguish an asymptotic efficiency of LZ codes and codes that are based on the technique of model weighting.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131230090","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":"New results on multiple insertion/deletion correcting codes","authors":"W. A. Clarke, H. Ferreira, T. Swart","doi":"10.1109/ITCOM.1999.781459","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781459","url":null,"abstract":"In this paper, new results on multiple symbol insertion and/or deletion correcting codes are presented. Firstly, new relationships between codebook properties and the symbol insertion and/or deletion correcting ability of a codebook are established. Secondly, new results on the upper bound of symbol insertion and/or deletion correcting codebook cardinalities are presented.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133499640","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 random-access data compaction","authors":"F. Willems, T. Tjalkens, P. Volf","doi":"10.1109/ITCOM.1999.781428","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781428","url":null,"abstract":"Consider a binary i.i.d. sequence that consists of K=2/sup J/ blocks of length T. We are looking for a universal compaction method that allows us to decode a certain block by looking only at certain segments in the code sequence. We have investigated a hierarchical method that encodes the source sequence into a code sequence that consists of 2/sup J+1/ variable-length segments. For decoding a certain block only J+2 segments need to be accessed. During decoding it is always clear where the next segment that needs to be accessed appears in the code sequence. The cumulative individual redundancy that is achieved by this method, is optimal in the sense that 1/2 log/sub 2/ N behavior is obtained where N=2/sup J/T. An additional increase of at most one bit per code-segment is possible however.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124299603","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":"Improved estimates on covering radius","authors":"A. Ashikhmin, I. Honkala, T. Laihonen, S. Litsyn","doi":"10.1109/ITCOM.1999.781454","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781454","url":null,"abstract":"During the last two decades the fundamental geometric parameter of a block code, called covering radius, has been widely studied. In this paper we estimate this parameter for linear codes with the aid of the minimum distance of the dual code. We derive a new bound on covering radius which improves essentially on the known bounds in a wide range of normalized dual distances.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114906492","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":"Multiterminal source coding for correlated memoryless Gaussian sources with several side information at the decoder","authors":"Y. Oohama","doi":"10.1109/ITCOM.1999.781431","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781431","url":null,"abstract":"We consider a separate coding system for L+1 correlated Gaussian memoryless sources. We deal with the case where the decoder wishes to reconstruct one of L+1 source outputs with an average mean squared error not exceeding a prescribed level. In this case the remaining L sources work as partial side information at the decoder for the reconstruction of the source. The determination problem of the rate-distortion region for this system has been known as a highly challenging problem. We give a partial solution to this problem by determining the rate-distortion region for a certain class of correlated sources. The result has a close relationship to our previous results.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132078026","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 method of \"types\", approximation of output measures and ID-capacity for channels with continuous alphabets","authors":"M.V. Burnashev","doi":"10.1109/ITCOM.1999.781416","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781416","url":null,"abstract":"The method of \"types\" is used to examine a discrete time channel with additive noise, and the ID-capacity is derived.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121655467","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":"Multiuser space-time communication","authors":"U. Madhow, E. Visotsky, D. Warrier","doi":"10.1109/ITCOM.1999.781393","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781393","url":null,"abstract":"The use of multiple antennas at the transmitter or receiver provides a powerful means, of increasing the capacity of wireless systems. The goal of this paper is to illustrate ways in which analogies with multiuser code division multiple access (CDMA) systems may be used to provide design insights for space-time communication systems, for both single and multiple users. Three examples are considered: (a) noncoherent space-time codes for transmit antenna diversity against Rayleigh fading, constructed using an analogy with a CDMA downlink; (b) optimal multiuser transmit beamforming on a cellular downlink, where the algorithm for computing beamforming weights is obtained by transforming the problem into a CDMA uplink with MMSE interference suppression and power control; (c) design of high bandwidth efficiency systems exploiting both transmit and receive antenna arrays, using analogies with CDMA systems with random and slowly time-varying spreading waveforms.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124987075","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":"Convergence properties of iterative soft onion peeling","authors":"N. Chayat, S. Shamai","doi":"10.1109/ITCOM.1999.781391","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781391","url":null,"abstract":"The concept of iterative multiuser detection for a multiple access adder AWGN channel is coupled with turbo code used for each user, followed by an interleaver. The iterative decoding exchanges the likelihood information both among the two constituent codes of each user and among the users. The information exchange among users is performed for each chip, using a Gaussian approximation for other user's contribution. The described iterative decoding procedure, when applied to unequal user power case, implicitly implements the \"onion peeling\" concept-strong users converge first, their contribution to the residual noise decreases, and then the weaker users converge. This property, in focus here, was applied in previous work to illustrate applications to multiple access communication and to broadcast channels. The difference from the classical \"onion peeling\" is that rather than decoding a user completely and then subtracting its contribution, the convergence here occurs over several layers simultaneously. The convergence properties of the proposed method are studied, with special emphasis on the case of equal rate users with exponentially related powers.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125009932","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}