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

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.最新文献

筛选
英文 中文
Hierarchical and joint source-channel coding with coded state information at the transmitter 在发送端具有编码状态信息的分层和联合源信道编码
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523413
Yakup Cemal, Y. Steinberg
{"title":"Hierarchical and joint source-channel coding with coded state information at the transmitter","authors":"Yakup Cemal, Y. Steinberg","doi":"10.1109/ISIT.2005.1523413","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523413","url":null,"abstract":"This paper considers joint state-source-channel coding and multiple descriptions coding of channel state information (CSI), for state dependent channels. Specifically, we examine coded, non-causal CSI at the transmitter (CSIT) and full CSI at the receiver (CSIR)","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127439735","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
On the design of efficient constrained parity-check codes for optical recording 光学记录中高效约束奇偶校验码的设计
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523588
K. Cai, Kees A. Schouhamer Immink
{"title":"On the design of efficient constrained parity-check codes for optical recording","authors":"K. Cai, Kees A. Schouhamer Immink","doi":"10.1109/ISIT.2005.1523588","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523588","url":null,"abstract":"This paper proposes a general and systematic way to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constrained PC code includes two component codes: the normal constrained (NC) code and the parity-related constrained (PRC) code. They are designed based on the same finite state machine (FSM). The code rates are only a few tenths below the theoretical maximum. The parity-check constraint is defined by the generator matrix (or generator polynomial) of a linear binary PC code, which can detect any type of dominant error events as well as error event combinations of the system. Two approaches are proposed to design the code in the non-return-to-zero-inverse (NRZI) format and the non-return-to-zero (NRZ) format, respectively. Designing the codes in NRZ format may reduce the number of parity bits required for error detection and simplify post-processing for error correction. Finally, examples of several newly designed codes and their performances are illustrated","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127243639","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 comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes 线性分组码译码中自适应信念传播算法与最佳图算法的比较
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523431
Aditi Kothiyal, O. Takeshita
{"title":"A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes","authors":"Aditi Kothiyal, O. Takeshita","doi":"10.1109/ISIT.2005.1523431","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523431","url":null,"abstract":"In this paper, two iterative message passing algorithms based on belief propagation proposed for the decoding of any binary linear block code are compared. The innovation of these algorithms lies in the fact that the structure of the graph of the parity check matrix is adaptively modified to render it suitable to belief propagation decoding. The modification is done such that the least reliable bits received from the channel are leaves of the graph. These algorithms perform favorably when compared with existing hard and iterative soft decision decoding algorithms in terms of error rate while maintaining a complexity polynomial in block length. It was found that while these two algorithms are conceptually similar, their performance in terms of word error rate (as a function of signal-to-noise ratio), decoding time (average number of iterations) and the updated bit reliabilities are very different","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131055301","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}
引用次数: 14
Properties of Kullback-Leibler cross-entropy minimization in nonextensive framework 非扩展框架下Kullback-Leibler交叉熵最小化的性质
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523773
Ambedkar Dukkipati, Narasimha Murty Musti, S. Bhatnagar
{"title":"Properties of Kullback-Leibler cross-entropy minimization in nonextensive framework","authors":"Ambedkar Dukkipati, Narasimha Murty Musti, S. Bhatnagar","doi":"10.1109/ISIT.2005.1523773","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523773","url":null,"abstract":"Kullback-Leibler cross-entropy has unique properties in cases involving distributions resulting from cross-entropy minimization. Nonextensive entropy (Tsallis entropy), which is a one-parameter generalization of Shannon entropy, is proposed to study certain class of physical systems. Thermostatistics based on Tsallis entropy is termed as nonextensive statistics or Tsallis statistics. Previously, Kullback-Leibler cross-entropy has been generalized and studied in this framework. In this paper we study properties of generalized cross-entropy minimization and present some differences with the classical case. In the representation of such a minimum cross-entropy distribution, we highlight the use of the q-product, an operator that has been recently introduced, to derive the mathematical structure behind the Tsallis statistics. One of our main results is the generalization of the triangle equality of cross-entropy minimization, in nonextensive framework","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131080923","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
Traitor tracing against powerful attacks 追踪叛徒对抗强大攻击
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523671
Simon McNicol, S. Boztaş, Asha Rao
{"title":"Traitor tracing against powerful attacks","authors":"Simon McNicol, S. Boztaş, Asha Rao","doi":"10.1109/ISIT.2005.1523671","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523671","url":null,"abstract":"We describe narrow, erasure, hybrid and wide attacks on fingerprinting schemes used for securing digital content, and introduce new classes of codes, namely vector space block design codes and delta-nonlinear codes, which can be used to defend against such attacks by means of traitor tracing","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132502940","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
Lower bounds on the capacity of asymmetric two-dimensional (d, /spl infin/)-constraints 非对称二维(d， /spl中/)约束的容量下界
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523419
Jiangxin Chen, P. Siegel
{"title":"Lower bounds on the capacity of asymmetric two-dimensional (d, /spl infin/)-constraints","authors":"Jiangxin Chen, P. Siegel","doi":"10.1109/ISIT.2005.1523419","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523419","url":null,"abstract":"We derive lower bounds on the capacity of asymmetric two-dimensional (d, infin)-constraints from bounds on the output entropy of bit-stuffing encoders for general asymmetric (d, infin)-constraints on both the square lattice and the hexagonal lattice. For the (d, infin; 1, infin)-constraint on the square lattice and the (d, infin; 1, infin; 1, infin)-constraint on the hexagonal lattice, we derive exact encoder output entropies which provide even tighter bounds on the capacity of these constraints","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131965044","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
Gallager bounds for linear codes in binary-input output-symmetric memoryless channels 二进制输入输出对称无内存信道中线性码的Gallager界
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523447
Alfonso Martinez, A. G. Fàbregas, G. Caire
{"title":"Gallager bounds for linear codes in binary-input output-symmetric memoryless channels","authors":"Alfonso Martinez, A. G. Fàbregas, G. Caire","doi":"10.1109/ISIT.2005.1523447","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523447","url":null,"abstract":"This paper presents a general methodology to extend Gallager bounds on the maximum-likelihood decoding error probability to arbitrary binary-input output-symmetric memoryless channels. Based on the log-likelihood ratios, a new space is constructed in which the signals naturally lie on a sphere, and for which geometric analysis is straightforward. In particular, we focus on Poltyrev's tangential-sphere bound, and we illustrate its connections with the Engdahl-Zigangirov bound. Approximations to these bounds are shown to be very tight","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132327225","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
Block turbo equalization for imperfect channel state information 不完全信道状态信息的块涡轮均衡
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523699
M. Dangl, C. Sgraja, J. Lindner
{"title":"Block turbo equalization for imperfect channel state information","authors":"M. Dangl, C. Sgraja, J. Lindner","doi":"10.1109/ISIT.2005.1523699","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523699","url":null,"abstract":"We propose a soft-input soft-output block equalizer based on constrained minimum variance filters. In contrast to other schemes, our receiver is designed for imperfect channel state information and incorporates the statistics of the channel estimation error. Thereby, we distinguish between data independent and data dependent evaluation of the covariance matrix of the estimation error. We show that the performance of our block equalizer is significantly improved when considering the influence of the actual data symbols on the estimation error. The additional complexity compared to the case when ignoring the data dependency of the estimation error increases quadratically with the block length. We assess the performance of our equalizer for block Rayleigh fading channels via Monte Carlo simulation, employing turbo equalization and one-shot training-based channel estimation","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128800840","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
Comparison of code design requirements for single- and multi-carrier transmission over frequency-selective MIMO channel 选频MIMO信道上单载波和多载波传输的编码设计要求比较
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523519
R. Fischer, C. Stierstorfer
{"title":"Comparison of code design requirements for single- and multi-carrier transmission over frequency-selective MIMO channel","authors":"R. Fischer, C. Stierstorfer","doi":"10.1109/ISIT.2005.1523519","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523519","url":null,"abstract":"Point-to-point transmission over multiple-input/multiple-output channels with intersymbol interference is considered. Two different equalization strategies - single-carrier transmission with spatial/temporal decision-feedback equalization and multicarrier transmission with V-BLAST in each carrier - and the respective requirements on channel coding are studied and compared. Via capacity arguments, it is shown that bit-inter-leaved coded modulation is not well suited for the situations at hand. This holds in particular if channel coding is used in combination with rate loading, i.e., non-uniform rate distribution over the carriers. Approaches to overcome this problem are discussed","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123246812","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
Rates of convergence for adaptive regression estimates with multiple hidden layer feedforward neural networks 多隐层前馈神经网络自适应回归估计的收敛速率
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523580
M. Kohler, A. Krzyżak
{"title":"Rates of convergence for adaptive regression estimates with multiple hidden layer feedforward neural networks","authors":"M. Kohler, A. Krzyżak","doi":"10.1109/ISIT.2005.1523580","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523580","url":null,"abstract":"We present a general bound on the expected L2 error of adaptive least squares estimates. By applying it to multiple hidden layer feedforward neural network regression function estimates we are able to obtain optimal (up to log factor) rates of convergence for Lipschitz classes and fast rates of convergence for some classes of regression functions such as additive functions","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121451337","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学术文献互助群
群 号：481959085
Book学术官方微信