发布求助
文献互助 智能选刊 最新文献

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)最新文献

筛选
英文 中文
On authentication with distortion constraints 关于有失真约束的认证
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935869
E. Martinian, B. Chen, G. Wornell
{"title":"On authentication with distortion constraints","authors":"E. Martinian, B. Chen, G. Wornell","doi":"10.1109/ISIT.2001.935869","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935869","url":null,"abstract":"In many multimedia applications, there is a need to authenticate sources subjected to benign degradations such as noise, compression, etc., in addition to potential tampering attacks. Authentication can be enabled through the embedding of suitably chosen markings in the original signal. We develop one information-theoretic formulation of this problem, and identify and interpret the associated fundamental performance limits.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126201768","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}
引用次数: 7
Woven convolutional codes and unequal error protection 编织卷积码和不等错误保护
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936162
R. Jordan, S. Host, M. Bossert, V. Zyablov
{"title":"Woven convolutional codes and unequal error protection","authors":"R. Jordan, S. Host, M. Bossert, V. Zyablov","doi":"10.1109/ISIT.2001.936162","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936162","url":null,"abstract":"Woven convolutional codes with outer warp are used to construct a generator matrix with an effective free distance vector that is lower bounded by the free distances of the component codes. This enables the construction of convolutional codes with unequal error protection.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126082350","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}
引用次数: 9
A unified structure of the trellis-based soft-output decoding algorithms for turbo codes 基于栅格的turbo码软输出译码算法的统一结构
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936182
Chung-hsuan Wang, Wei-Ting Wang, Chi-chao Chao
{"title":"A unified structure of the trellis-based soft-output decoding algorithms for turbo codes","authors":"Chung-hsuan Wang, Wei-Ting Wang, Chi-chao Chao","doi":"10.1109/ISIT.2001.936182","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936182","url":null,"abstract":"In this paper, a unified viewpoint is proposed to interpret the relation between various trellis-based soft-output decoding algorithms. From the unified viewpoint, we can easily obtain new algorithms of low complexity and good performance, and a unified decoding structure is devised for the newly proposed algorithms and those reported previously. Under the unified structure, all of the algorithms are mapped into a single decoding process and different algorithms can be easily switched between one another. Owing to the modularity and flexibility, this unified structure is especially suitable for the turbo decoder with programmable DSP implementation to optimize the trade-off between the performance and complexity.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115262201","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
Space-time codes for wireless optical channels 无线光信道的空时码
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936107
S. M. Haas, J. Shapiro, V. Tarokh
{"title":"Space-time codes for wireless optical channels","authors":"S. M. Haas, J. Shapiro, V. Tarokh","doi":"10.1109/ISIT.2001.936107","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936107","url":null,"abstract":"A space-time channel coding technique is presented for overcoming turbulence-induced fading in an atmospheric optical communication system that uses multiple transmit and receive apertures, In particular, a design criterion for minimizing the pairwise probability of codeword error in a space-time code (STC) is developed from a central limit theorem approximation. This design criterion maximizes the ratio of mean to standard deviation of the received energy difference between codewords. It leads to STCs that are a subset of the previously reported STCs for Rayleigh channels, namely those created from orthogonal designs.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116585236","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}
引用次数: 17
Entropy and channel capacity in the regenerative setup with applications to Markov channels 再生设置中的熵和信道容量及其在马尔可夫信道中的应用
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936146
V. Sharma, S.K. Singh
{"title":"Entropy and channel capacity in the regenerative setup with applications to Markov channels","authors":"V. Sharma, S.K. Singh","doi":"10.1109/ISIT.2001.936146","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936146","url":null,"abstract":"We obtain new entropy and mutual information formulae for regenerative stochastic processes. We use them on Markov channels to generalize the results in Goldsmith and Varaiya (1996). Also we obtain tighter bounds on capacity and better algorithms than in Goldsmith and Varaiya.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116652110","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}
引用次数: 112
Entropy and the timing capacity of discrete queues 离散队列的熵与定时容量
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936091
B. Prabhakar, R. Gallager
{"title":"Entropy and the timing capacity of discrete queues","authors":"B. Prabhakar, R. Gallager","doi":"10.1109/ISIT.2001.936091","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936091","url":null,"abstract":"Queueing systems which map Poisson input processes to Poisson output processes have been well-studied in classical queueing theory. This paper considers two discrete-time queues whose analogs in the continuous-time possess the Poisson-in-Poisson-out property. It is shown that when packets arriving according to an arbitrary ergodic stationary arrival process are passed through these queueing systems, the corresponding departure process has an entropy rate no less (some times strictly more) than the entropy rate of the arrival process. Some useful by-products are discrete-time versions of: (i) a proof of Burke's (1956) theorem; (ii) a proof of the uniqueness, amongst renewal inputs, of the Poisson process as a fixed point for exponential server queues; and (iii) connections with the timing capacity of queues.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116668799","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}
引用次数: 49
Error floor assessment of digital phase detectors with carrier phase tracking. A large deviations approach 载波相位跟踪数字鉴相器的误差下限评估。大偏差方法
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936000
F. Silva, J. Leitão
{"title":"Error floor assessment of digital phase detectors with carrier phase tracking. A large deviations approach","authors":"F. Silva, J. Leitão","doi":"10.1109/ISIT.2001.936000","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936000","url":null,"abstract":"This paper proposes an importance sampling methodology based on large deviations theory for the error floor assessment of a class of open-loop receivers with random carrier phase tracking in additive white Gaussian noise channels. Our simulations exhibit remarkable time gains when compared with conventional Monte Carlo.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121669027","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
Binary arrays with zero correlation zone 零相关区二进制数组
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935960
Xiaohu Tang, P. Fan, Daoben Li, N. Suehiro
{"title":"Binary arrays with zero correlation zone","authors":"Xiaohu Tang, P. Fan, Daoben Li, N. Suehiro","doi":"10.1109/ISIT.2001.935960","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935960","url":null,"abstract":"A class of binary arrays with zero correlation zone, based on two-dimensional mutually orthogonal complementary codes, is presented.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121804526","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
On the structure of entropy-constrained scalar quantizers 熵约束标量量化子的结构
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935892
A. Gyorgy, T. Linder
{"title":"On the structure of entropy-constrained scalar quantizers","authors":"A. Gyorgy, T. Linder","doi":"10.1109/ISIT.2001.935892","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935892","url":null,"abstract":"New results concerning the structure and existence of optimal entropy-constrained scalar quantizers (ECSQs) are presented. One main result shows that for continuous sources and a wide class of distortion measures, any finite-level ECSQ can be replaced by an ECSQ with interval cells which has the same entropy and equal or less distortion. Furthermore, the existence of an optimal ECSQ for an arbitrary entropy constraint is shown under rather general conditions.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122388027","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
A family of self-dual codes which behave in many respects like random linear codes of rate 1/2 一组自对偶码，在许多方面表现得象速率为1/2的随机线性码
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935878
G. Olocco, J. Tillich
{"title":"A family of self-dual codes which behave in many respects like random linear codes of rate 1/2","authors":"G. Olocco, J. Tillich","doi":"10.1109/ISIT.2001.935878","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935878","url":null,"abstract":"We perform the analysis of the minimum distance and decoding capacity of a family of self-dual codes. These rate 1/2 codes are built with a very simple multistage construction using short base codes and interleavers as in turbo-codes. We only consider the case where the base code is an extended [8,4,4] Hamming code, though our analysis would carry over to other base codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122812159","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信