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

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

筛选
英文 中文
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes 量子码Ashikhmin-Litsyn-Tsfasman界的改进
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-07-01 DOI: 10.1109/ISIT.2002.1023476
R. Matsumoto
{"title":"Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes","authors":"R. Matsumoto","doi":"10.1109/ISIT.2002.1023476","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023476","url":null,"abstract":"We improve performance of the asymptotically good quantum codes constructed by Ashikhmin, Litsyn, and Tsfasman (see Phys. Rev. A, vol.63, no.3, p.032311, Mar. 2001), by using more rational points on algebraic curves.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"96 1","pages":"204-"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ISIT.2002.1023476","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72528741","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}
引用次数: 47
Power requirements for connectivity in clustered wireless networks 集群无线网络中连接的电源要求
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023625
L. Booth, Jehoshua Bruck, M. Franceschetti, R. Meester
{"title":"Power requirements for connectivity in clustered wireless networks","authors":"L. Booth, Jehoshua Bruck, M. Franceschetti, R. Meester","doi":"10.1109/ISIT.2002.1023625","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023625","url":null,"abstract":"We consider wireless networks in which a subset of the nodes provide coverage to clusters of clients and route data packets from source to destination. We generalize previous work of Gilbert (1961), deriving conditions on the communication range of the nodes and on the placement of the covering stations to provide, with probability one, some long distance multi-hop communication. One key result is that the network can almost surely (a.s.) provide some long distance multi-hop communication, regardless of the algorithm used to place the covering stations, if the density of the clients is high enough and their communication range is less than half the communication range of the base stations. As the ratio between the two communication ranges becomes greater than half, a malicious covering algorithm that never provides long distance, multi-hop communication in the network, exists even if we constrain the base station to be placed at the vertices of a fixed grid-which is the typical scenario in the case of commercial networks.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"44 1","pages":"353-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73461615","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
Designing irregular LPDC codes using EXIT charts based on message error rate 基于消息错误率的EXIT图设计不规则LPDC码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023726
Masoud Ardakani, F. Kschischang
{"title":"Designing irregular LPDC codes using EXIT charts based on message error rate","authors":"Masoud Ardakani, F. Kschischang","doi":"10.1109/ISIT.2002.1023726","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023726","url":null,"abstract":"A new analysis of irregular low density parity check (LDPC) codes on AWGN channels based on modified extrinsic information transfer (EXIT) charts is presented. We modify EXIT charts to track the message error rate transfer characteristics of the constituent codes. Previous analyses, which make a Gaussian assumption for all messages passed, are inaccurate at low SNRs. We more accurately track the message error rate transfer by making a Gaussian approximation only for messages sent from variable nodes, with statistics of messages from check nodes computed by simulation. This makes the analysis more accurate, particularly for low rate codes where, at low SNR, the messages from check nodes are far from Gaussian. The new analysis simplifies understanding of the irregular codes to the level of regular case, leading to a simple approach to the design of irregular codes. We have used this method to design irregular LDPC codes that perform close to the Shannon limit over a wider range of rates and variable degrees as compared to previous work. The same method can be used for many other codes defined on graphs.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"175 1","pages":"454-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73507917","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}
引用次数: 20
Bit interleaved coded modulation using multiple turbo codes 位交错编码调制使用多个涡轮码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023715
Adrish Banerjee, D. Costello, T. Fuja, P. Massey
{"title":"Bit interleaved coded modulation using multiple turbo codes","authors":"Adrish Banerjee, D. Costello, T. Fuja, P. Massey","doi":"10.1109/ISIT.2002.1023715","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023715","url":null,"abstract":"Bandwidth efficient coding schemes employing bit interleaved coded modulation and low complexity multiple turbo codes are investigated. The BER performance of these designs is shown to be superior to bit interleaved coded modulation schemes using conventional turbo codes.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"45 1","pages":"443-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73745475","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}
引用次数: 10
Geometrical interpretation of iterative turbo decoding 迭代涡轮解码的几何解释
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023414
B. Muquet, P. Duhamel, A. de Courville
{"title":"Geometrical interpretation of iterative turbo decoding","authors":"B. Muquet, P. Duhamel, A. de Courville","doi":"10.1109/ISIT.2002.1023414","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023414","url":null,"abstract":"We provide a geometrical interpretation of the iterative decoding of bit interleaved coded modulation (BICM) as an algorithm performing successive projections of probabilities densities onto well defined density spaces with respect to the Kullback distance. This enables to derive a convergence result.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"67 1","pages":"142-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73993159","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
Irregular repeat accumulate codes for non-binary modulation schemes 非二进制调制方案的不规则重复累加码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023443
A. Khandekar, R. Palanki
{"title":"Irregular repeat accumulate codes for non-binary modulation schemes","authors":"A. Khandekar, R. Palanki","doi":"10.1109/ISIT.2002.1023443","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023443","url":null,"abstract":"In this paper, we review the performance of irregular repeat accumulate (IRA) codes. We present simulation results on the performance of IRA codes in two non-binary modulation schemes viz., turbo-coded modulation and multilevel coding. These results show that IRA codes are good for high data rate applications and that multilevel coding with IRA codes provides a low complexity alternative to TCM.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"36 1","pages":"171-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74160609","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
Network management information for light-path assessment 光路评估的网络管理信息
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023398
C. Ji, V. Chan, Guanglei Liu
{"title":"Network management information for light-path assessment","authors":"C. Ji, V. Chan, Guanglei Liu","doi":"10.1109/ISIT.2002.1023398","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023398","url":null,"abstract":"In this work, we consider assessing wavelength availability using partial management information for dynamically setting up a light-path across administrative domains. We cast the light-path assessment as a decision problem, define and analyze the performance as the probability of an erroneous decision. We show that the performance is related to the blocking probability, and a good performance may be achieved using local and aggregated information.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"80 1","pages":"126-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74317412","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 broadcast channel with random parameters 在广播频道上使用随机参数
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023497
Y. Steinberg
{"title":"On the broadcast channel with random parameters","authors":"Y. Steinberg","doi":"10.1109/ISIT.2002.1023497","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023497","url":null,"abstract":"A model for a broadcast channel controlled by random parameters is presented. Inner and outer bounds are derived on the capacity region when the random parameters are known non-causally to the encoder. Applications to watermarking are suggested. In particular, the capacity region is derived for a watermarking system where the channel (attacker) is fixed, and the encoder is required to encode watermarks for both private and public users.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"345 1","pages":"225-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75794372","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}
引用次数: 10
Analysis of decoding complexity using the Berry-Esseen theorem 用Berry-Esseen定理分析解码复杂度
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023558
Po-Ning Chen, Y.S. Han, C. Hartmann, Hong-Bin Wu
{"title":"Analysis of decoding complexity using the Berry-Esseen theorem","authors":"Po-Ning Chen, Y.S. Han, C. Hartmann, Hong-Bin Wu","doi":"10.1109/ISIT.2002.1023558","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023558","url":null,"abstract":"This work presents a novel technique to analyze the computational efforts of an ordering-free variant of the generalized Dijkstras's algorithm (GDA) and the maximum-likelihood sequential decoding algorithm (MLSDA) based on the Berry-Esseen theorem. Different from the theoretical bounds determined by the conventional central limit theorem argument, which often holds only for sufficiently large block length, the new bounds are valid for any block length.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"79 1","pages":"286-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74516770","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
On perfect traitor tracing 关于完美的叛徒追踪
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023711
Y. Desmedt, M. Burmester, K. Kurosawa
{"title":"On perfect traitor tracing","authors":"Y. Desmedt, M. Burmester, K. Kurosawa","doi":"10.1109/ISIT.2002.1023711","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023711","url":null,"abstract":"We analyze the perfect security aspects of traitor tracing and show that perfect fairness (an innocent party is never accused) is impossible, except if the pirate key allows full decryptability or if nobody is ever accused. Similarly, perfect accusability (at least one traitor is always correctly accused) is impossible, except if the pirate key allows full decryptability or some innocent people will always be among the accused. We also show possibility results.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"21 1","pages":"439-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72940253","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学术官方微信
小红书