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

Proceedings. IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
New binary fix-free codes with Kraft sum 3/4 新的二进制固定免费代码与卡夫和3/4
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023450
Z. Kukorelly, K. Zeger
{"title":"New binary fix-free codes with Kraft sum 3/4","authors":"Z. Kukorelly, K. Zeger","doi":"10.1109/ISIT.2002.1023450","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023450","url":null,"abstract":"Two sufficient conditions are given for the existence of binary fix-free codes. The results move closer to the Ahlswede-Balkenhol-Khachatrian conjecture that Kraft sums of at most 3/4 suffice for the existence of fix-free codes.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"23 1","pages":"178-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73708372","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
On permutations with second order separations between cascaded convolutional encoders 级联卷积编码器间二阶分离的排列
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023756
A. Huebner, R. Jordan, J. Grill
{"title":"On permutations with second order separations between cascaded convolutional encoders","authors":"A. Huebner, R. Jordan, J. Grill","doi":"10.1109/ISIT.2002.1023756","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023756","url":null,"abstract":"A new set of permutation parameters is introduced. It is called the set of second order separations and is a generalization of the well-known symbol separation. A construction method is presented that allows us to generate permutors with large second order separations. Additionally, we derive a lower bound on the minimum distance of serially concatenated codes with a permutation of sufficiently large second order separations.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"22 1","pages":"484-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74243625","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
On the utilization of residual source redundancy for iterative joint source-channel decoding of variable-length codes 利用剩余信源冗余进行变长码迭代联合码道译码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023471
J. Kliewer, R. Thobaben
{"title":"On the utilization of residual source redundancy for iterative joint source-channel decoding of variable-length codes","authors":"J. Kliewer, R. Thobaben","doi":"10.1109/ISIT.2002.1023471","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023471","url":null,"abstract":"We present a novel symbol-based a posteriori probability (APP) decoder for packetized variable-length encoded source indices transmitted over wireless channels, which exploits residual index correlations after source encoding for error correction. By additionally protecting the variable-length encoded bitstream with channel codes, an iterative decoding scheme can be obtained where the proposed APP source decoder serves as constituent decoder.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"24 2","pages":"199-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ISIT.2002.1023471","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72447515","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
Codes for iterative decoding from partial geometries 从部分几何图形进行迭代解码的代码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023582
Sarah J. Johnson, S. Weller
{"title":"Codes for iterative decoding from partial geometries","authors":"Sarah J. Johnson, S. Weller","doi":"10.1109/ISIT.2002.1023582","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023582","url":null,"abstract":"This work develops codes suitable for iterative decoding using the sum-product algorithm. We consider regular low-density parity-check (LDPC) codes derived from partial geometries, a large class of combinatorial structures which include several of the previously proposed algebraic constructions for LDPC codes as special cases. We derive bounds on minimum distance and rank/sub 2/(H) for codes from partial geometries, and present constructions and performance results for two classes of partial geometries which have not previously been proposed for use with iterative decoding.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"98 1","pages":"310-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78685452","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
Efficient oblivious transfer from any non-trivial binary-symmetric channel 有效的从任何非平凡的二元对称信道转移
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023565
D. Stebila, S. Wolf
{"title":"Efficient oblivious transfer from any non-trivial binary-symmetric channel","authors":"D. Stebila, S. Wolf","doi":"10.1109/ISIT.2002.1023565","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023565","url":null,"abstract":"In 1997, Crepeau proved that the important cryptographic primitive of oblivious transfer can be efficiently realized by using a binary-symmetric channel with symbol-error probability less than 0.1982. We show that this restriction is unnecessary: Oblivious transfer can be realized as efficiently based on any non-trivial binary-symmetric channel between the involved parties.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"45 1","pages":"293-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75995003","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}
引用次数: 16
Fast layered network data detection based on transmission system properties 基于传输系统特性的快速分层网络数据检测
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023544
D. Khedim, A. Benyettou
{"title":"Fast layered network data detection based on transmission system properties","authors":"D. Khedim, A. Benyettou","doi":"10.1109/ISIT.2002.1023544","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023544","url":null,"abstract":"To drastically accelerate the training process of an M-ary data detector over noisy dispersive channels, based on a radial basis function neural network (RBFNN), data transmission is considered as a whole experiment including the training sequence, the channel, and the adaptive detector. Such a strategy allows only one network basis function center to be updated, leaving the remaining centers to be set in a one-shot fashion prior to data mode. A logarithmic reduction of training time and computation, most beneficial for M>2, is thus possible.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"1155 1","pages":"272-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77669643","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
A class of random multiple bits within a byte error correcting codes with single byte error detecting capability for memory systems 存储系统中具有单字节错误检测能力的字节内随机多比特纠错码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023391
G. Umanesan, E. Fujiwara
{"title":"A class of random multiple bits within a byte error correcting codes with single byte error detecting capability for memory systems","authors":"G. Umanesan, E. Fujiwara","doi":"10.1109/ISIT.2002.1023391","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023391","url":null,"abstract":"We propose a class of codes called single t-bits within a b-bit byte error correcting-single b-bit byte error detecting (S/sub t/b/EC-S/sub b/ED) code for high speed semiconductor memory systems.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"10 1","pages":"119-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77694853","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
New bounds on the communication complexity of metering schemes 计量方案通信复杂度的新界限
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023710
C. Blundo, S. Martin, B. Masucci, C. Padró
{"title":"New bounds on the communication complexity of metering schemes","authors":"C. Blundo, S. Martin, B. Masucci, C. Padró","doi":"10.1109/ISIT.2002.1023710","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023710","url":null,"abstract":"In this paper we show new lower bounds on the communication complexity of metering schemes.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"114 1","pages":"438-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77744301","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
Gallager codes for multiple user applications 多用户应用程序的Gallager代码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023607
A. de Baynast, D. Declercq
{"title":"Gallager codes for multiple user applications","authors":"A. de Baynast, D. Declercq","doi":"10.1109/ISIT.2002.1023607","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023607","url":null,"abstract":"We study the performance limits of a multiple access system based on the Gallager codes. We show that we can bypass the spreading sequences in a multiple access system. The algebraic orthogonality is replaced by a statistical orthogonality provided by the randomness of the Gallager codes. The performance of our system are close to the optimum achievable bound.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"71 1","pages":"335-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80408627","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
Asymptotic delay in random wireless networks 随机无线网络中的渐近延迟
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023284
M. Ahmed, G. Pottie
{"title":"Asymptotic delay in random wireless networks","authors":"M. Ahmed, G. Pottie","doi":"10.1109/ISIT.2002.1023284","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023284","url":null,"abstract":"An estimate of the average delay experienced by data bits transported through randomly distributed nodes forming a multi-hop wireless network is presented, as an order of the number of nodes in the network. It is seen that the expected asymptotic delay observed per bit, from a source to a destination node, essentially averages to the order of O (/spl radic/n), for n nodes in the network.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"42 1","pages":"12-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81517884","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学术官方微信
小红书