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

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

筛选
英文 中文
Error recovery for Ziv-Lempel coding by using UEP schemes 基于UEP方案的Ziv-Lempel编码错误恢复
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866727
E. Fujiwara, Hongyuan Chen, M. Kitakami
{"title":"Error recovery for Ziv-Lempel coding by using UEP schemes","authors":"E. Fujiwara, Hongyuan Chen, M. Kitakami","doi":"10.1109/ISIT.2000.866727","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866727","url":null,"abstract":"Lossless data compression, such as arithmetic coding and Ziv-Lempel coding, is widely used for text compression. Since errors in compressed data have a great influence on the decompression, error control for the compressed data is necessary. From this view point, the authors propose a burst error recovery method in arithmetic coding. They consider error recovery schemes for LZW coding and LZ77 coding by using unequal error protection (UEP) schemes, which protect the important parts of the compressed data more strongly.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"35 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":"114810055","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
The consistency of the BIC Markov order estimator BIC马尔可夫阶估计的相合性
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866316
I. Csiszár, P. Shields
{"title":"The consistency of the BIC Markov order estimator","authors":"I. Csiszár, P. Shields","doi":"10.1109/ISIT.2000.866316","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866316","url":null,"abstract":"We show that the BIC (Bayesian information criterion) estimator of the order of a Markov chain (with finite alphabet) gives the correct order, eventually almost surely as the sample size goes to /spl infin/, thereby strengthening earlier consistency results that assumed an apriori bound on the order. A key tool is a strong typicality result for Markov sample paths. We also show that the Bayesian or MDL estimator, of which the BIC estimator is regarded as an approximation, fails to be consistent for the uniformly distributed i.i.d. process.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"82 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":"124333074","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}
引用次数: 202
Lower bound to the feedback capacity of the colored Gaussian noise channel 彩色高斯噪声信道反馈容量的下界
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866759
T. Klein, R. Gallager
{"title":"Lower bound to the feedback capacity of the colored Gaussian noise channel","authors":"T. Klein, R. Gallager","doi":"10.1109/ISIT.2000.866759","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866759","url":null,"abstract":"We present a new lower bound on the feedback capacity of the colored Gaussian noise channel. Under the assumption of large power, this lower bound is shown to be strictly larger than the non-feedback capacity. Insight into the role of the feedback and the capacity-achieving strategy have been obtained.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"22 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":"124489324","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
Convolutional code and 2-dimensional PRML class IV for multi-track magnetic recording system 多道磁记录系统的卷积码和二维PRML IV类
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866607
N. Kogo, N. Hirano, R. Kohno
{"title":"Convolutional code and 2-dimensional PRML class IV for multi-track magnetic recording system","authors":"N. Kogo, N. Hirano, R. Kohno","doi":"10.1109/ISIT.2000.866607","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866607","url":null,"abstract":"This paper proposes a method of joint decoding for a combined system between a 2D partial response (2-D PR) system and convolutional codes for the purpose of high density magnetic recording. Since both the 2D PR system and convolutional code can be represented with trellis diagrams, decoding performance can be improved by joint decoding with their overall trellis diagram. Moreover, a method of decoding which can achieve a low amount of calculation is also investigated.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"24 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":"125452321","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}
引用次数: 3
Statistical multiplexing of many independent ATM-streams with temporally constrained long-range dependence 具有时间约束的远程依赖的多个独立atm流的统计复用
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866395
S. Caibi
{"title":"Statistical multiplexing of many independent ATM-streams with temporally constrained long-range dependence","authors":"S. Caibi","doi":"10.1109/ISIT.2000.866395","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866395","url":null,"abstract":"The broader design possibilities for statistical multiplexing are of our interest provided the ATM-streams to be merged are not just independent but also many.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"43 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":"125475669","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
Gaussian ISI channels and the generalized likelihood ratio test 高斯ISI信道与广义似然比检验
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866758
A. Lapidoth, E. Telatar
{"title":"Gaussian ISI channels and the generalized likelihood ratio test","authors":"A. Lapidoth, E. Telatar","doi":"10.1109/ISIT.2000.866758","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866758","url":null,"abstract":"Decoders employing the generalized likelihood ratio test can achieve rates that can be achieved by maximum likelihood decoders on ISI channels even though they are ignorant of the channel characteristics.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"17 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":"126001447","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
A technique for prediction and probability assignment (PPA) in lossless data compression 无损数据压缩中的预测与概率分配(PPA)技术
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866362
N. Ekstrand, B. Smeets
{"title":"A technique for prediction and probability assignment (PPA) in lossless data compression","authors":"N. Ekstrand, B. Smeets","doi":"10.1109/ISIT.2000.866362","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866362","url":null,"abstract":"The prediction and probability assignment (PPA) concept is important in lossless image compression. We report on a new approximate technique for PPA based on local optimization.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"217 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":"121944087","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
A system-theoretic derivation of the Welch-Berlekamp algorithm Welch-Berlekamp算法的系统理论推导
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866716
M. Kuijper
{"title":"A system-theoretic derivation of the Welch-Berlekamp algorithm","authors":"M. Kuijper","doi":"10.1109/ISIT.2000.866716","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866716","url":null,"abstract":"The similarity of the Berlekamp-Massey (B-M) algorithm and the Welch-Berlekamp (W-B) algorithm is demonstrated in showing that both algorithms are special instances of one iterative modeling procedure. In particular, from Reed and Solomon's original problem statement a W-B type algorithm is directly derived through a system-theoretic interpolation approach.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"14 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":"121758647","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
Dealing with short cycles in graphical codes 处理图形代码中的短周期
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866300
A. Guyader, É. Fabre
{"title":"Dealing with short cycles in graphical codes","authors":"A. Guyader, É. Fabre","doi":"10.1109/ISIT.2000.866300","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866300","url":null,"abstract":"The graphical representation of codes has opened the way to soft decoding by belief propagation, which extends the usual soft Viterbi decoding. This simple algorithm is most often used for constructing and evaluating graphical codes. We show that belief propagation on graphs is not always appropriate and that the algorithmic resources for graphical models are far more extended than belief propagation. In particular, we propose new approximate decoders based on the \"conditioning technique\" to solve the short cycles problem of graphical codes.","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":"132380785","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}
引用次数: 6
The weight distributions of some product codes 一些产品代码的权重分布
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866524
R. Andrew
{"title":"The weight distributions of some product codes","authors":"R. Andrew","doi":"10.1109/ISIT.2000.866524","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866524","url":null,"abstract":"General expressions are derived for the weight distributions of the binary product codes S/sub m1//spl otimes/S/sub m2/, R/sub m1//spl otimes/R/sub m2/, S/sub m1//spl otimes/R/sub m2/, E/sub m1//spl otimes/S/sub m2/, and E/sub m1//spl otimes/R/sub m2/, where S/sub m/ is the [2/sup m/-1, m, 2/sup m-1/] simplex code, R/sub m/ is the [2/sup m/, m+1, 2/sup m-1/] first order Reed Muller code, and E/sub m/ is the [m, m-1, 2] even weight code.","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":"130276910","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
首页 上一页 下一页 尾页
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学术官方微信