{"title":"A new upper bound on the reliability function of the Gaussian channel","authors":"A. Ashikhmin, A. Barg, S. Litsyn","doi":"10.1109/ITCOM.1999.781434","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781434","url":null,"abstract":"Upper bounds on the reliability function of the Gaussian channel were derived by Shannon in 1959. Kabatiansky and Levenshtein (1978) obtained a low-rate improvement of Shannon's \"minimum-distance bound\". Together with the straight-line bound this provided an improvement upon the sphere-packing bound in a certain range of code rate. In this work we prove a bound better than the KL bound on the reliability function. Employing the straight-line bound, we obtain a further improvement of Shannon's results. As intermediate results we prove lower bounds on the distance distribution of spherical codes and a tight bound on the exponent of Jacobi polynomials of growing degree in the entire orthogonality segment.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133376502","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":"Burst error recovery method for VF arithmetic codes","authors":"Hongyuan Chen, M. Kitakami, E. Fujiwara","doi":"10.1109/ITCOM.1999.781455","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781455","url":null,"abstract":"Compressed data are sensitive to any errors because they will spread on decompression. In order to overcome this in the case of arithmetic codes, some variable-to-fixed length (VF) arithmetic codes with error detecting capabilities were proposed by Cho and Kohno (1998), but no paper, up to now, has discussed the joint coding of data compression and error correction. This paper proposes an l-burst error recovery method for VF arithmetic codes. It divides the compressed data into fixed length words and inserts the internal states of the decompressor as well as the check parts of the interleaved parity code and the cyclic code into each word.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126418884","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":"Third generation personal communications physical layer: status and open issues","authors":"R. Peterson, B. Classon","doi":"10.1109/ITCOM.1999.781401","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781401","url":null,"abstract":"Summary form only given. Third generation (3G) personal communications systems are being developed in Europe, Asia, and North America. In Europe 3G concepts have been developed over the past decade within European Community funded projects such as RACE and ACTS; these projects have been staffed by both universities and corporations. European efforts have been managed by the European Telecommunications Standards Institute. Fifteen 3G system proposals were delivered to the International Telecommunications Union (ITU) in June 1998. The ITU goal was (is) to select a single system standard for application throughout the world. To aid the ITU in the harmonization of the fifteen standards, two groups of manufacturers, standards organizations, and others were formed. The first of these groups, called the Third Generation Partnership Project (3GPP), is developing a single standard based upon the GSM/MAP network architecture and the other, called the Third Generation Partnership Project 2 (3GPP2), is developing a single standard based upon the ANSI-41 network architecture. This presentation summarizes the status of 3GPP physical layer as of June 1999, and identifies several research topics that could influence the standard or the deployment of the standard.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129121115","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":"Nonstandard coding method for nonbinary codes correcting localized errors","authors":"R. Ahlswede, L. Bassalygo, M. S. Pinsker","doi":"10.1109/ITCOM.1999.781415","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781415","url":null,"abstract":"Summary form only given. In Ahlswede et al. (1993) we claimed that the transmission rate of a nonbinary (q-ary) code of length n which corrects /spl tau/n localized errors asymptotically equals the Hamming bound on an interval /spl tau//spl isin/ [0,/spl tau/0], /spl tau/0/spl les/1/2, and conjectured that /spl tau/0=1/2 (transmission rate is zero if the number of errors is greater than or equal to n/2). Though we have not succeeded in proving our conjecture we decided to promulgate the derivation of the incomplete result on the Hamming bound, the more so, as the method of the proof itself is of independent interest.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115247145","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":"Entropy and the Shannon capacity of queueing systems","authors":"R. Gallager, B. Prabhakar","doi":"10.1109/ITCOM.1999.781387","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781387","url":null,"abstract":"Summary form only given. We show that a variety of queueing systems are entropy increasing in nature. The methods used to establish this are a combination of elementary techniques of information theory and queueing theory. We discuss the connection of these ideas with the work of Anantharam and Verdu (1996) on the information capacity of queues.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123513673","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":"Optimization of transition diagram weights for sequential lossless coding of piecewise stationary sources","authors":"G. Shamir, D. Costello","doi":"10.1109/ITCOM.1999.781439","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781439","url":null,"abstract":"The second order terms of the redundancy of an asymptotically optimal, transition diagram based, universal sequential lossless coding scheme for sources with abruptly changing statistics can be further reduced by correctly choosing the transition weights in the diagram. Such optimal transition weights are presented for cases that differ in the amount of prior knowledge one has on the time elapsing between two consecutive changes in the statistics. Particularly, an optimal choice of weights is proposed for the most extreme case, where no such prior knowledge exists at all.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125681837","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":"Asymptotically optimal low complexity sequential lossless coding for regular piecewise stationary memoryless sources","authors":"G. Shamir, D. Costello, N. Merhav","doi":"10.1109/ITCOM.1999.781413","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781413","url":null,"abstract":"The lower bound on the redundancy for lossless universal coding of regular memoryless sources with abruptly changing statistics is shown to be achievable using a fixed per-letter computational complexity strongly sequential compression scheme with logarithmic storage complexity.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117125128","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":"Asymptotic Elias bound for Euclidean space codes over uniform signal sets","authors":"B. Sundar Rajan, G. Viswanath","doi":"10.1109/ITCOM.1999.781440","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781440","url":null,"abstract":"We extend Piret's (1986) upper bound to codes over uniform signal sets (a signal set is referred to be uniform if the Euclidean distance distribution is same from any point in the signal set) which include as a special case codes over symmetric PSK signal sets and all signal sets matched to groups (Loeliger 1991). The probability distribution that gives optimum bound is obtained for codes over simplex, biorthogonal signal sets and Hamming spaces.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"12 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":"127317634","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":"Universal source coding theory based on grammar transforms","authors":"E. Yang, J. Kieffer","doi":"10.1109/ITCOM.1999.781414","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781414","url":null,"abstract":"A new universal lossless source coding theory is presented. Within this theory, a lossless source code called a grammar based code first transforms the original data sequence to be compressed into a context free grammar, from which the original data sequence can be fully reconstructed by performing parallel substitutions, and then uses an arithmetic coding algorithm to compress the context free grammar of the corresponding sequence of parsed phrases. It is shown that if a grammar-based code transforms each data sequence into an irreducible context free grammar, then the grammar-based code is universal for the class of stationary, ergodic sources. Specific redundancy bounds are also given.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"9 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":"125355563","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":"Joint source-channel coding system using VF arithmetic code and BCH code","authors":"S. Cho, Ji-Hwan Park, R. Kohno","doi":"10.1109/ITCOM.1999.781456","DOIUrl":"https://doi.org/10.1109/ITCOM.1999.781456","url":null,"abstract":"In this paper we propose a VF (variable-to-fixed length) arithmetic coding method with EDC (error detecting capability) and a joint source-channel coding method in that the VF arithmetic coding method with EDC is combined with the BCH code.","PeriodicalId":280975,"journal":{"name":"Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)","volume":"65 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":"129615484","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}