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

2010 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Towards robust phoneme classification with hybrid features 基于混合特征的稳健音素分类
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513345
J. Yousafzai, Z. Cvetković, Peter Sollich
{"title":"Towards robust phoneme classification with hybrid features","authors":"J. Yousafzai, Z. Cvetković, Peter Sollich","doi":"10.1109/ISIT.2010.5513345","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513345","url":null,"abstract":"In this paper, we investigate the robustness of phoneme classification to additive noise with hybrid features using support vector machines (SVMs). In particular, the cepstral features are combined with short term energy features of acoustic waveform segments to form a hybrid representation. The energy features are then taken into account separately in the SVM kernel, and a simple subtraction method allows them to be adapted effectively in noise. This hybrid representation contributes significantly to the robustness of phoneme classification and narrows the performance gap to the ideal baseline of classifiers trained under matched noise conditions.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114503169","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
Two-level fingerprinting: Stronger definitions and code constructions 两级指纹识别:更强的定义和代码结构
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513761
N. Anthapadmanabhan, A. Barg
{"title":"Two-level fingerprinting: Stronger definitions and code constructions","authors":"N. Anthapadmanabhan, A. Barg","doi":"10.1109/ISIT.2010.5513761","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513761","url":null,"abstract":"We develop the concept of hierarchical fingerprinting introduced in our recent work (ISIT2009). The object of two-level fingerprinting is content protection against coalitions of t pirates in such a manner that one of the pirates can be identified exactly if t ≤ t2 or localized to within a small group if t2 < t ≤ t1, where t1 and t2 are parameters of the system. In this work, we require the additional property that in the latter case no innocent users are accused of belonging to the pirate coalition. We construct two-level fingerprinting codes with polynomial complexity of identification that satisfy the strong definition of hierarchical fingerprinting described above.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"325 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116439954","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
On sufficient conditions for testing optimality of codewords in ISI channels ISI信道码字最优性测试的充分条件
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513789
Fabian Lim, A. Kavcic, M. Fossorier
{"title":"On sufficient conditions for testing optimality of codewords in ISI channels","authors":"Fabian Lim, A. Kavcic, M. Fossorier","doi":"10.1109/ISIT.2010.5513789","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513789","url":null,"abstract":"For the memoryless AWGN channel, there exists low complexity methods to test the optimality of any chosen candidate codeword (i.e., whether the codeword in question equals the most-likely codeword or not). Such optimality tests find application in practical decoders that perform heuristic searches for the most-likely codeword. If some located codeword passes the optimality test, then the search may be terminated and computations saved. In this paper, we generalize techniques for determining if a codeword is optimal, for intersymbol interference (ISI) channels.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"391 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116494446","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
Distributed consensus with finite messaging 具有有限消息传递的分布式共识
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513279
D. Dash, A. Sabharwal
{"title":"Distributed consensus with finite messaging","authors":"D. Dash, A. Sabharwal","doi":"10.1109/ISIT.2010.5513279","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513279","url":null,"abstract":"Inspired by distributed resource allocation problems in dynamic topology networks, we initiate the study of distributed consensus with finite messaging passing. We first find a sufficient condition on the network graph for which no distributed protocol can guarantee a conflict-free allocation after R rounds of message passing. Secondly we fully characterize the conflict minimizing zero-round protocol for path graphs, namely random allocation, which partitions the graph into small conflict groups. Thirdly, we enumerate all one-round protocols for path graphs and show that the best one further partitions each of the smaller groups. Finally, we show that the number of conflicts decrease to zero as the number of available resources increase.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"154 11‐12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120836506","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
Vector network coding algorithms 矢量网络编码算法
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513771
Javad Ebrahimi, C. Fragouli
{"title":"Vector network coding algorithms","authors":"Javad Ebrahimi, C. Fragouli","doi":"10.1109/ISIT.2010.5513771","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513771","url":null,"abstract":"We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L × L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algorithms optimize the length L while designing the coding matrices. These algorithms apply both for regular network graphs as well as linear deterministic networks.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125050648","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
On cooperative secrecy for discrete memoryless relay networks 离散无记忆中继网络的协同保密
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513772
E. Perron, S. Diggavi, E. Telatar
{"title":"On cooperative secrecy for discrete memoryless relay networks","authors":"E. Perron, S. Diggavi, E. Telatar","doi":"10.1109/ISIT.2010.5513772","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513772","url":null,"abstract":"In this paper we consider information-theoretically secure communication between two special nodes (“source” and “destination”) in a memoryless network with authenticated relays, where the secrecy is with respect to a class of eavesdroppers. We develop achievable secrecy rates when authenticated relays also help increase secrecy rate by inserting noise into the network.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128417541","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}
引用次数: 11
Outage capacity of the broadcast channel in the low power regime 低功率状态下广播信道的中断容量
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513537
M. Uppal, A. Høst-Madsen, Zixiang Xiong
{"title":"Outage capacity of the broadcast channel in the low power regime","authors":"M. Uppal, A. Høst-Madsen, Zixiang Xiong","doi":"10.1109/ISIT.2010.5513537","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513537","url":null,"abstract":"We consider outage capacity in the broadcast channel when the base-station has none or little channel knowledge. We find the minimum energy per bit needed to achieve a certain outage probability and the corresponding wideband slope.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128610132","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
Wireless multicasting via iterative optimization 无线多播迭代优化
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513678
Lihua Wan, Jie Luo
{"title":"Wireless multicasting via iterative optimization","authors":"Lihua Wan, Jie Luo","doi":"10.1109/ISIT.2010.5513678","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513678","url":null,"abstract":"A class of wireless multicast utility optimization problems are considered. Assume network utility is only a function of link throughput and nodes' transmission power. Under a set of physical layer assumptions, the impact of physical and data-link layer configurations to the upper layers in a wireless network can be characterized using a configuration graph. Network layer utility optimization can consequently be carried out via iterations that optimize network layer algorithms over the configuration graph and revise physical, data-link layer configurations to improve the configuration graph. For a class of wireless multicast networks with optimal network coding, the number of point-to-multipoint links involved in network utility optimization is only polynomial, as opposed to exponential, in the number of nodes. This leads to a reduced complexity in exhaustive searching algorithms, such as optimal utility maximization. Consequently, simulations of these algorithms for moderate-sized networks become feasible. 1","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129342927","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
Generalizing the Blum-Elias method for generating random bits from Markov chains 推广了从马尔可夫链生成随机比特的Blum-Elias方法
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513679
Hongchao Zhou, Jehoshua Bruck
{"title":"Generalizing the Blum-Elias method for generating random bits from Markov chains","authors":"Hongchao Zhou, Jehoshua Bruck","doi":"10.1109/ISIT.2010.5513679","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513679","url":null,"abstract":"The problem of random number generation from an uncorrelated random source (of unknown probability distribution) dates back to von Neumann's 1951 work. Elias (1972) generalized von Neumann's scheme and showed how to achieve optimal efficiency in unbiased random bits generation. Hence, a natural question is what if the sources are correlated? Both Elias and Samueleson proposed methods for generating unbiased random bits in the case of correlated sources (of unknown probability distribution), specifically, they considered finite Markov chains. However, their proposed methods are not efficient (Samueleson) or have implementation difficulties (Elias). Blum (1986) devised an algorithm for efficiently generating random bits from degree-2 finite Markov chains in expected linear time, however, his beautiful method is still far from optimality. In this paper, we generalize Blum's algorithm to arbitrary degree finite Markov chains and combine it with Elias's method for efficient generation of unbiased bits. As a result, we provide the first known algorithm that generates unbiased random bits from an arbitrary finite Markov chain, operates in expected linear time and achieves the information-theoretic upper bound on efficiency.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127269160","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}
引用次数: 8
Using coding techniques to analyze weak feedback polynomials 利用编码技术分析弱反馈多项式
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513760
Martin Hell
{"title":"Using coding techniques to analyze weak feedback polynomials","authors":"Martin Hell","doi":"10.1109/ISIT.2010.5513760","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513760","url":null,"abstract":"We consider a class of weak feedback polynomials for LFSRs in the nonlinear combiner. When feedback taps are located in small groups, a distinguishing attack can sometimes be improved considerably, compared to the common attack that uses low weight multiples. This class of weak polynomials was introduced in 2004 and the main property of the attack is that the noise variables are represented as vectors. We analyze the complexity of the attack using coding theory. We show that the groups of polynomials can be seen as generator polynomials of a convolutional code. Then, the problem of finding the attack complexity is equivalent to finding the minimum row distance of the corresponding generator matrix. A modified version of BEAST is used to search all encoders of memory up to 13. Moreover, we give a tight upper bound on the required size of the vectors in the attack.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130064431","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学术官方微信