{"title":"On the training distortion of vector quantizers","authors":"T. Linder","doi":"10.1109/ISIT.2000.866443","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866443","url":null,"abstract":"The in-training-set performance of a vector quantizer as a function of its training set size is investigated. For squared error distortion and independent training data, worst-case type upper bounds are derived on the minimum training distortion achieved by an empirically optimal quantizer. These bounds show that the training distortion can underestimate the minimum distortion of a truly optimal quantizer by as much as a constant times n/sup -1/2/, where n is the size of the training data. Earlier results provide lower bounds of the same order.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121807214","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":"A construction of ternary constant-composition codes with weight three and minimum distance four","authors":"M. Svanstrom","doi":"10.1109/ISIT.2000.866435","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866435","url":null,"abstract":"We consider the problem of finding the maximal size A/sub 3/(d,w/sub 0/,w/sub 1/,w/sub 2/) of a ternary constant-composition code. We describe a construction of ternary constant-composition codes that proves A/sub 3/(4,4m+1,2,1)=(m+1)(4m+2) and A/sub 3/(4, 4m-1,2,1)=m(4m+2).","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114556038","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":"Optimal block codes for M-ary runlength-limited channels","authors":"S. McLaughlin, S. Datta","doi":"10.1109/ISIT.2000.866438","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866438","url":null,"abstract":"In this paper we consider the analysis and design of optimal block-decodable M-ary runlength-limited (RLL) codes. We present two general construction methods: one based on permutation codes due to Datta and McLaughlin (1999), and the other a nonbinary generalization of the binary enumeration methods of Patrovics and Immink (1996), and Gu and Fuja (1994). The construction based on permutation codes is simple and asymptotically (in block-length) optimal, while the other construction is optimal in the sense that the resulting codes have the highest rate among all block-decodable codes for any block-length. In the process, we also prove a new result on the capacity of(M,d,k) constraints. Finally, we present examples of remarkably low-complexity (M,d,k) block codes which achieve the optimal rate without the use of enumeration.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114979091","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 an identification algorithm of a Markov chain","authors":"T. Kohda, H. Fujisaki","doi":"10.1109/ISIT.2000.866799","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866799","url":null,"abstract":"We discuss how to identify a Markov information source with transition matrix P by only observing a sequence of symbols generated by the source.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115718322","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":"Minimizing transmit power for fading multiple-access channels","authors":"M. Mecking","doi":"10.1109/ISIT.2000.866792","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866792","url":null,"abstract":"The problem of minimizing the sum transmit power for a fading multiple-access channel is considered. While for non-fading channels with equal user attenuations wideband multi-access with cooperative (joint) decoding and orthogonal access are both optimal, wideband access is superior in the case of unequal attenuations or fading channels. Losses due to fading are negligible for wideband access as a result of low rate coding, and near-AWGN performance is achievable. On the other hand, orthogonal access suffers from losses of high rate codes under fading conditions. Wideband access with non-cooperative decoding is clearly suboptimal in any case and only useful for low transmission rates.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127456123","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":"Error containment in compressed data using sync markers","authors":"A. Kiely, S. Dolinar, M. Klimesh, A. Matache","doi":"10.1109/ISIT.2000.866726","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866726","url":null,"abstract":"We examine a specific strategy of using sync markers for error containment in compressed data, using a model that separates the data compression and error containment stages.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125062949","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 Hensel lift of a polynomial","authors":"Z. Wan","doi":"10.1109/ISIT.2000.866292","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866292","url":null,"abstract":"Denote by R the Galois ring of characteristic p/sup e/ and cardinality p/sup em/, where p is a prime and e and m are positive integers. Let g(x) be a monic polynomial over F/sub p/m. A polynomial f(x) over R is defined to be a Hensel lift of g(x) in R[x] if f~(x)=g(x), and there is a positive integer n not divisible by p such that f(x) divides x/sup n/-1 in R[x]. It is proved that g(x) has a unique Hensel lift in R[x] if and only if g(x) has no multiple roots and x/spl chi/g(x). An algorithm to compute the Hensel lift is also given.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125261927","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":"Channel quality estimation with channel error counts for adaptive signaling in wireless communications","authors":"M. Pursley, John M. Shea","doi":"10.1109/ISIT.2000.866399","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866399","url":null,"abstract":"Accurate channel quality estimates are needed for a variety of reasons in wireless communication systems, such as for power control and for adaptive transmission and routing. Channel quality information can be derived from many sources at the receiver, including statistical characterizations of the channel, information from the demodulation process, and information from the error-correcting and error-detecting codes. One simple method for estimating the channel quality is to estimate the channel error rate by re-encoding the outputs of the error-correcting code and comparing the re-encoded symbols to hard decisions at the demodulator output. We present analysis and simulation results for several different channel quality estimates derived from estimates of the channel error rate.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126874711","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 CDMA transmission over mismatched fading channels employing MMSE-receivers and successive cancellation","authors":"A. Lampe","doi":"10.1109/ISIT.2000.866631","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866631","url":null,"abstract":"A closed solution to the capacity of synchronous CDMA for fading channels supposing exact channel knowledge at the receiver and infinite spreading factor, i.e., N/spl rarr//spl infin/ has been derived by Shamai and Verdu (see IEEE Trans. on IT, 1999). On the other hand, considering imperfect channel state information Evans and Tse (see IEEE Trans. on IT, 1999) derived analytical solutions to the signal to noise ratio provided by linear multiuser receivers and could also give results for the error variance resulting from linear channel estimation. Here, lower and upper bounds on the users SIR reachable by means of a nonlinear MMSE-receiver applying successive cancellation while assuming a certain channel estimation accuracy are given. Note that due to imperfect channel estimation the interference from previously decoded users cannot be cancelled completely even if no decoding errors occur.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"430 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116404881","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 average redundancy of Huffman (and Shannon-Fano) block codes","authors":"W. Szpankowski","doi":"10.1109/ISIT.2000.866668","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866668","url":null,"abstract":"A Huffman code is an iterative algorithm built over the associated Huffman tree, in which the two nodes with lowest weights are combined into a new node with a weight that is the sum of the weights of its two children. Such a construction is not unique but fortunately with a simple modification to the Huffman algorithm, it is possible to construct a unique Huffman code so that the longest codewords are as short as possible. Here we deal with such modified Huffman codes and present precise asymptotic results on the average redundancy of such codes for memoryless sources.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122152383","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}