{"title":"Rate-distortion theory for the Shannon cipher system","authors":"Hirosuke Yamamoto","doi":"10.1109/ISIT.1994.394669","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394669","url":null,"abstract":"Considers Shannon's cipher system with a memoryless broadcast channel. The source output sequence {S/sub l/}/sub t//sup /spl infin//=1 is independent drawings of a random variable S taking values in S, and the key W/sub k/ is a random variable which is independent of S. For simplicity, we assume that the main channel (X/spl rarr/Y) is less noisy than the wiretap channel (X/spl rarr/Z). The security of the system can be measured by the uncertainty or the attainable minimum distortion of the wiretapper who gets only Z/sup N/. For each case, we define the admissible region.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125144823","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 stochastic model for image segmentation involving constrained least squares estimation","authors":"A. Kaup, T. Aach","doi":"10.1109/ISIT.1994.394630","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394630","url":null,"abstract":"The aim of the paper is to outline a layered statistical image model suitable for unsupervised image segmentation. The segment internal texture signal is described based on its spatial frequency representation while the image partition is modelled as a sample of a Gibbs/Markov random field. The most likely segmentation is estimated using a maximum a posteriori (MAP) formulation with the unknown parameters being determined by constrained least squares (CLS) estimation.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126168626","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":"Rates of convergence in adaptive universal vector quantization","authors":"M. Effros, P. Chou, R. Gray","doi":"10.1109/ISIT.1994.395071","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395071","url":null,"abstract":"We consider the problem of adaptive universal quantization. By adaptive quantization we mean quantization for which the delay associated with encoding the jth sample in a sequence of length n is bounded for all n>j. We demonstrate the existence of an adaptive universal quantization algorithm for which any weighted sum of the rate and the expected mean square error converges almost surely and in expectation as O(/spl radic/(log log n/log n)) to the corresponding weighted sum of the rate and the distortion-rate function at that rate.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123299930","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":"Symbolic dynamic techniques for trellis group codes","authors":"N.T. Sindhushayana, C. Heegard","doi":"10.1109/ISIT.1994.395100","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395100","url":null,"abstract":"In this paper, we use symbolic dynamics to describe and analyze the class of geometrically uniform trellis codes. We introduce the notion of group systems and image systems, which establish the connection between symbolic dynamics and trellis coding. We define several properties of general symbolic dynamic systems, and provide a complete classification of group systems and image systems under this framework. We also provide a complete description of all group systems based on the cyclic group and dihedral group, and point out its implications for rotationally invariant trellis group codes based on MPSK signal constellations.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125319420","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":"Nonparametric estimation using neural networks","authors":"G. Lugosi, K. Zeger","doi":"10.1109/ISIT.1994.394876","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394876","url":null,"abstract":"We show that properly trained neural networks provide universally consistent nonparametric estimators. The results apply to regression estimation, conditional median estimation, curve fitting, pattern recognition and learning concepts. The estimators minimize the empirical L/sub p/-error.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115112654","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":"Multilevel block construction using modified Reed-Muller codes","authors":"L. Zhang, B. Vucetic","doi":"10.1109/ISIT.1994.395085","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395085","url":null,"abstract":"In this paper, we present two modified types of Reed-Muller codes with two-level squaring construction. The modified codes provide a good trade-off between code rate and decoder complexity in multilevel block construction.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115207790","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 representation of chaotic and non-chaotic sequences of the iterated logistic map","authors":"J. M. Morris, A. Azari","doi":"10.1109/ISIT.1994.394650","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394650","url":null,"abstract":"It has been demonstrated by a number of investigators that there is a relationship between chaotic signals and systems and communications and information theory. In particular, it has been shown that the output sequences of chaotic non-linear dynamic systems can be exploited for encoding information, for modulating waveforms in spread spectrum applications, and for masking information-bearing waveforms in secure communication applications. An information theoretic relationship can be obtained from the concepts of Markov partitions, metric entropy, symbolic dynamics, and topological entropy.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116162410","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 ALOHA multiple access system with coding","authors":"R.M. Al-Rumaih, P. Mathys","doi":"10.1109/ISIT.1994.394727","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394727","url":null,"abstract":"The performance of slotted ALOHA with multi-user coding is analyzed. The underlying philosophy is that most collisions among few users are handled by multi-user coder and (relatively infrequent) collisions among many users are resolved using the ALOHA, retransmission protocol. The stability, throughput, and packet delay are analyzed for this scheme. The main result is that multi-user codes designed for a maximum of T=3 simultaneous users yield the best overall performance.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122042750","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":"Cyclic q-ary images of codes and burst correction","authors":"W. Wafo, J. Wolfmann","doi":"10.1109/ISIT.1994.394921","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394921","url":null,"abstract":"In the case where the cyclic code C is determined by a constancy-clique code described in Jensen's (see IEEE Trans. Inform. Theory, vol.38, p.950-959, 1992) theorem, we are able to find a lower bound for the minimum weight of C. By using the previous proposition we deduce lower bounds for the burst correction capacity of cyclic codes with composite lengths.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122043441","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":"The use of wavelets for spectral density estimation with local bandwidth adaptation","authors":"P. Moulin","doi":"10.1109/ISIT.1994.394931","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394931","url":null,"abstract":"We consider the problem of estimating the spectral density of a discrete-time, wide-sense stationary, real, Gaussian random process from a set of 2N observations. Consistent estimates may be obtained by suitable processing of the empirical spectral density estimates (periodogram). Wavelet techniques can be used for combining information about the spectral density at different resolutions. We present an estimation technique based on the following two paradigms: large-sample model for the data; and inference on the wavelet coefficients of the log spectral density.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"58 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129763650","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}