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

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.最新文献

筛选
英文 中文
The zero-error capacity of compound channels 复合信道的零误差容量
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365414
J. Nayak, K. Rose
{"title":"The zero-error capacity of compound channels","authors":"J. Nayak, K. Rose","doi":"10.1109/ISIT.2004.1365414","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365414","url":null,"abstract":"The compound channel is one of the simplest generalizations of the discrete memoryless channel (DMC). In this paper, we characterize the zero-error capacity when neither the encoder nor the decoder is informed of the choice of DMC s. We present a complete characterization of the compound channel capacities","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131424361","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 bit-interleaved turbo-coded modulation with low error floors 低误差层的位交错涡轮编码调制
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365090
E. Rosnes, Øyvind Ytrehus
{"title":"On bit-interleaved turbo-coded modulation with low error floors","authors":"E. Rosnes, Øyvind Ytrehus","doi":"10.1109/ISIT.2004.1365090","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365090","url":null,"abstract":"In this work we introduce an algorithm to optimize the performance in the error floor region of bit-interleaved turbo-coded modulation (BITCM) on the additive white Gaussian noise (AWGN) channel. The key ingredient is an exact turbo code weight distribution algorithm producing a list of all codewords in the underlying turbo code of weight less than a given threshold. Using the union bounding technique, we show that a well-designed bit-interleaver is crucial to have a low error floor. Furthermore, the error rate performance in the waterfall region depends on the bit-interleaver, since the level of protection from channel noise on the bit-level depends on the bit-position and the neighboring bit values within the same symbol in the transmitted sequence. We observe a trade-off between error rate performance in the waterfall and error floor regions as illustrated by an extensive case study of a high-rate BITCM scheme.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115415433","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
Entropy amplification by aperiodic noise and side information problems 由非周期噪声和侧信息问题引起的熵放大
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365187
A. Cohen, R. Zamir
{"title":"Entropy amplification by aperiodic noise and side information problems","authors":"A. Cohen, R. Zamir","doi":"10.1109/ISIT.2004.1365187","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365187","url":null,"abstract":"A subset of an Abelian group has unique differences if for all nonzeros. when viewed as additive noise, sets with unique differences amplify the output entropy as much as possible for a large class of input distributions, which is known as entropy amplification property. Aperiodic (noise) distributions arise as extreme cases in the investigation of the rate loss in side information problems such as channel coding with additive interference known at the encoder and lossy source coding with side information at the decoder. The decoder outputs a reconstruction, which is required to satisfy a distortion constraint. Reconstructing the clean source with some distortion is equivalent to reconstructing the encrypted source with the same distortion. Using the EAP, the rate loss can be arbitrarily large and arbitrarily close to 100%.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115575900","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
Capacity approaching codes for relay channels 中继信道的容量逼近码
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365039
Zheng Zhang, I. Bahceci, T. Duman
{"title":"Capacity approaching codes for relay channels","authors":"Zheng Zhang, I. Bahceci, T. Duman","doi":"10.1109/ISIT.2004.1365039","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365039","url":null,"abstract":"In this paper, turbo-based coding scheme for relay systems together with iterative decoding algorithms is designed. The performance of the proposed schemes is about 1.0-1.5 dB away from the information theoretical limits for various channel models.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"351 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124444799","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}
引用次数: 23
Selection diversity in multiple antenna systems with matrix modulation 矩阵调制多天线系统中的选择分集
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365328
P. Pasanen, O. Tirkkonen
{"title":"Selection diversity in multiple antenna systems with matrix modulation","authors":"P. Pasanen, O. Tirkkonen","doi":"10.1109/ISIT.2004.1365328","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365328","url":null,"abstract":"Scheduling between several users introduces selection diversity and changes the statistics of the channel. Therefore, the problem of choosing the best user/transmission scheme in multiuser MIMO systems needs to be addressed. This work presents the selection diversity in multiple antenna systems with matrix modulation.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115067099","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
New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures 新结果和应用的叠加代码(和相关的组合结构)，以设计有效的组测试程序
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365291
Annalisa De Bonis, U. Vaccaro
{"title":"New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures","authors":"Annalisa De Bonis, U. Vaccaro","doi":"10.1109/ISIT.2004.1365291","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365291","url":null,"abstract":"Let s be the number of unknown positive elements in a population of n members, 2/spl les/s<n. We aim at finding all the s positive elements by testing group of members of the population, under the constraint that a group tests positive if and only if it contains exactly one positive element. This model was considered in [T. Berger et al., 1984, P. Damaschke, 1998]. We provide tight upper and lower bounds on the optimal number of tests needed to solve above group testing problem, improving on [A.G. Dyachkov, 2003]. Instrumental to our results are new and improved bounds for generalized superimposed codes in the sense of [A. De Bonis et al., 2003, A.G. Dyachkov et al., 1984].","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123530609","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
Computing and communicating statistics in sensor networks 传感器网络中的计算和通信统计
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365117
A. Giridhar, P. Kumar
{"title":"Computing and communicating statistics in sensor networks","authors":"A. Giridhar, P. Kumar","doi":"10.1109/ISIT.2004.1365117","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365117","url":null,"abstract":"This paper presents the computing and communicating statistics in sensor networks. A deterministic sequence of message passing between sensors, result in the vector of function values being, communicated to the fusion center, for any combination of individual measurement vectors. A wireless communication model using protocols is also discussed.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121919367","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
Reconstruction of a linear scrambler 线性扰频器的重构
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365271
M. Cluzeau
{"title":"Reconstruction of a linear scrambler","authors":"M. Cluzeau","doi":"10.1109/ISIT.2004.1365271","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365271","url":null,"abstract":"We present different techniques to reconstruct a linear scrambler from the knowledge of a large segment of the output stream, according to various assumptions on the input stream. A communication system usually includes a linear scrambler, which consists of a linear feedback shift register (LFSR) whose output is combined with the input sequence. This paper also describes the synchronous scramblers and self-synchronized scramblers.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117114729","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
On second-order properties of minimum redundancy block codes 最小冗余分组码的二阶性质
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365128
Y. Reznik
{"title":"On second-order properties of minimum redundancy block codes","authors":"Y. Reznik","doi":"10.1109/ISIT.2004.1365128","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365128","url":null,"abstract":"This paper presents the second-order properties of minimum redundancy block codes. A block Huffman code constructed for a binary memoryless source with probabilities is considered. The result proves that the variance of its redundancy distribution of block Shannon and Huffman code is distributed very uniformly between its codewords.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123954714","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
Analysis of an algorithm for irregular LDPC code construction 一种不规则LDPC码构造算法分析
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365107
A. Ramamoorthy, R. Wesel
{"title":"Analysis of an algorithm for irregular LDPC code construction","authors":"A. Ramamoorthy, R. Wesel","doi":"10.1109/ISIT.2004.1365107","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365107","url":null,"abstract":"This work presents a rigorous analysis of an algorithm proposed by Tian et al. (2003) for the construction of irregular LDPC codes with reduced stopping sets and low error floors. Computation of the expected number of stopping sets of a given size proves that the algorithm significantly outperforms a random construction. We show that the algorithm provably reduces the expected number of stopping sets up to a certain size (based on the input parameters). The expected number of cycles of a given size is computed for both constructions.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124609165","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}
引用次数: 12
首页 上一页 下一页 尾页
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学术官方微信