2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)最新文献

筛选
英文 中文
Universal lossless coding of sources with large and unbounded alphabets 通用无损编码的来源与大和无界的字母
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866306
E. Yang, Yunwei Jia
{"title":"Universal lossless coding of sources with large and unbounded alphabets","authors":"E. Yang, Yunwei Jia","doi":"10.1109/ISIT.2000.866306","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866306","url":null,"abstract":"A multilevel arithmetic coding algorithm is proposed to encode data sequences with large or unbounded source alphabets. The algorithm is universal in the sense that it can achieve asymptotically the entropy rate of any independently and identically distributed integer source with a finite or infinite alphabet, as long as the mean value is finite.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 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":"130456138","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}
引用次数: 21
A new identity-based conference key distribution scheme 一种新的基于身份的会议密钥分发方案
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866567
Sheng-Bo Xu, H. van Tilborg
{"title":"A new identity-based conference key distribution scheme","authors":"Sheng-Bo Xu, H. van Tilborg","doi":"10.1109/ISIT.2000.866567","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866567","url":null,"abstract":"A new identity-based conference key distribution scheme is presented using Harn-Yang's (see IEEE Journal on Selected Areas in Communication, vol.11, no.5, p.757-60, June 1993) identity-based digital signature scheme.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"87 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":"131578974","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}
引用次数: 4
The redundancy of successive refinement codes and codes with side information 连续细化码和带边信息码的冗余性
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866418
G. Voronov, M. Feder
{"title":"The redundancy of successive refinement codes and codes with side information","authors":"G. Voronov, M. Feder","doi":"10.1109/ISIT.2000.866418","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866418","url":null,"abstract":"We consider the problem of determining the redundancy of successive refinement codes and codes with side information, as a function of their blocklength. It is shown that successive refinement codes accumulate an O(logn/2n) redundancy term at each stage of the encoding process, which may result in a considerable degradation of the final description. Redundancy result for codes with side information is also presented.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"31 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":"131616604","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}
引用次数: 5
Fast soft-decision decoding of linear codes, stochastic resonance in algorithms 线性码的快速软判决译码,算法中的随机共振
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866381
A. Valembois
{"title":"Fast soft-decision decoding of linear codes, stochastic resonance in algorithms","authors":"A. Valembois","doi":"10.1109/ISIT.2000.866381","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866381","url":null,"abstract":"We propose a new soft decoding algorithm for long general binary linear codes, based on information set decoding. Its specificity is that it is derived from the fastest hard decoding algorithm for long codes, which explores successively information sets close to each other, and that the search is guided by the reliability values thanks to a technique inspired by stochastic resonance. It can reach for instance a bit error rate of 10/sup -6/ at 3 dB in a reasonable time.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"123 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":"131625250","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}
引用次数: 8
Almost surely complete parsing and variable-to-variable length coding 几乎可以肯定完整的解析和可变长度的编码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866645
M. Nishiara, H. Morita
{"title":"Almost surely complete parsing and variable-to-variable length coding","authors":"M. Nishiara, H. Morita","doi":"10.1109/ISIT.2000.866645","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866645","url":null,"abstract":"We introduce the idea of proper and almost surely complete parsing. This parsing can uniquely segment the source output with probability one, and strengthens the coding converse theorem. Some kinds of non-proper parsing are involved in the proper and almost surely complete parsing.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"421 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":"131739868","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}
引用次数: 2
A calculus of conditional independence and its applications in cryptography 条件独立演算及其在密码学中的应用
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866541
U. Maurer
{"title":"A calculus of conditional independence and its applications in cryptography","authors":"U. Maurer","doi":"10.1109/ISIT.2000.866541","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866541","url":null,"abstract":"We present a simple calculus for deriving conditional independence relations of events and random variables and show how it can be applied to simplify, generalize and sometimes strengthen cryptographic security proofs relying on the indistinguishability of certain types of probabilistic constructions relevant in cryptography.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"78 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":"131798914","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}
引用次数: 0
Blind source separation based on multi-user kurtosis criteria 基于多用户峰度准则的盲源分离
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866543
C. Papadias
{"title":"Blind source separation based on multi-user kurtosis criteria","authors":"C. Papadias","doi":"10.1109/ISIT.2000.866543","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866543","url":null,"abstract":"A novel technique for the blind source separation (BSS) of mutually independent and identically distributed i.i.d. discrete-time sequences is presented. The observed signals are assumed mixed through a narrow-band (memoryless) multiple-input-multiple-output (MIMO) noisy channel and are then processed by a linear MIMO receiver, whose outputs should ideally match the transmitted signals. In the proposed approach (called the multi-user kurtosis (MUK) algorithm), the linear receiver's matrix setting is computed adaptively based on the optimization of a constrained statistical criterion that involves only second and fourth order statistics of the receiver's output. At each iteration, the algorithm combines a stochastic gradient adaptation with a Gram-Shmidt orthogonalization that enforces its criterion's constraints. The analysis of its stationary points, reveals that it is globally convergent to a zero forcing -ZF (or decorrelating) solution, both in the absence of noise and in the presence of spatio-temporally white additive Gaussian noise.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"4 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":"130937408","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}
引用次数: 13
Fourier spectrum of optimal Boolean functions via Kasami's identities 基于Kasami恒等式的最优布尔函数的傅里叶谱
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866478
A. Canteaut, C. Carlet, P. Charpin, C. Fontaine
{"title":"Fourier spectrum of optimal Boolean functions via Kasami's identities","authors":"A. Canteaut, C. Carlet, P. Charpin, C. Fontaine","doi":"10.1109/ISIT.2000.866478","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866478","url":null,"abstract":"We introduce a new approach for the study of weight distributions of cosets of the Reed-Muller code of order 1. We next examine the impact of our results when some cryptographic criteria of Boolean functions are considered.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"13 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":"133015153","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}
引用次数: 1
Balanced and almost balanced binary sequences of period p/sup m/-1 with optimal autocorrelation using the polynomial (z+1)/sup d/+az/sup d/+b over GF(p/sup m/) 使用多项式(z+1)/sup d/+az/sup d/+b / GF(p/sup m/)的周期p/sup m/-1的平衡和几乎平衡二值序列具有最优自相关
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866597
Jong-Seon No, Habong Chung, Hong‐Yeop Song
{"title":"Balanced and almost balanced binary sequences of period p/sup m/-1 with optimal autocorrelation using the polynomial (z+1)/sup d/+az/sup d/+b over GF(p/sup m/)","authors":"Jong-Seon No, Habong Chung, Hong‐Yeop Song","doi":"10.1109/ISIT.2000.866597","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866597","url":null,"abstract":"We present a construction for binary sequences {s(t)} of period N=p/sup m/-1 for an odd prime p based on the polynomial (z+1)/sup d/+az/sup d/+b with optimal three-level autocorrelation.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"75 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":"132588164","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}
引用次数: 0
AWGN channel convolutional decoding is less complex than BSC decoding AWGN信道卷积译码比BSC译码简单
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866698
J.B. Anderson
{"title":"AWGN channel convolutional decoding is less complex than BSC decoding","authors":"J.B. Anderson","doi":"10.1109/ISIT.2000.866698","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866698","url":null,"abstract":"The storage complexity of bounded distance decoding for binary-channel convolutional codes over the binary symmetric channel (BSC) is /spl ap/(2/sup 1-R/-1)/sup -t/, where up to t errors are corrected. We show that the path storage becomes /spl ap/2/sup 2Rt/ over the AWGN channel, which is significantly lower. Thus Gaussian convolutional coding is not only 3 dB more energy efficient, but its decoding is simpler as well.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"23 1 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":"132664829","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信