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

2010 IEEE Information Theory Workshop最新文献

筛选
英文 中文
Coding for the MIMO ARQ block-fading channel with imperfect feedback and CSIR 具有不完全反馈和CSIR的MIMO ARQ块衰落信道编码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592842
A. Asyhari, A. G. Fàbregas
{"title":"Coding for the MIMO ARQ block-fading channel with imperfect feedback and CSIR","authors":"A. Asyhari, A. G. Fàbregas","doi":"10.1109/CIG.2010.5592842","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592842","url":null,"abstract":"We investigate the effects of imperfect channel knowledge and feedback in incremental-redundancy automatic-repeat request (INR-ARQ) coding systems over multiple-input multiple-output (MIMO) block-fading channels. We propose an ARQ decoder based on nearest neighbour decoding and evaluate the corresponding achievable rates. We then derive the optimal code diversity assuming that the feedback channel is modelled as a binary symmetric channel. Our main results show that the feedback link reliability must improve with the forward (transmission) signal-to-noise ratio (SNR) for the code to exploit the diversity offered by ARQ scheme. We also identify the conditions for achieving full diversity and for ARQ not helping in improving the system's diversity.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127886718","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
Improved linear programming decoding and bounds on the minimum distance of LDPC codes 改进了LDPC码的线性规划译码和最小距离限制
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592887
D. Burshtein, I. Goldenberg
{"title":"Improved linear programming decoding and bounds on the minimum distance of LDPC codes","authors":"D. Burshtein, I. Goldenberg","doi":"10.1109/CIG.2010.5592887","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592887","url":null,"abstract":"We propose a technique for improving LP decoding, based on the merging of check nodes. This technique can be applied to standard as well as generalized LDPC codes. Furthermore, we show how a recently-discovered linear-complexity LP decoder can be used to derive non-trivial lower bounds on the minimum distance of specific LDPC codes, with complexity that exhibits quadratic growth with respect to the block length. This bound can be refined using the check node merging technique. The lower bound on the minimum distance is shown to be an upper bound on the fractional distance of the code.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122162403","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
Wiretap channel with shared key 使用共享密钥窃听信道
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592665
Wei Kang, Nan Liu
{"title":"Wiretap channel with shared key","authors":"Wei Kang, Nan Liu","doi":"10.1109/CIG.2010.5592665","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592665","url":null,"abstract":"This paper studies the problem of secure communication over a wiretap channel where the transmitter and the legitimate receiver share a secret key, which is concealed from the eavesdropper. We find the secrecy capacity under this scenario. This result generalizes that of Yamamoto, which is applicable only to less noisy wiretap channels, to the general wiretap channel when no distortion is allowed at the legitimate receiver.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121065363","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}
引用次数: 53
Secrecy-achieving polar-coding Secrecy-achieving polar-coding
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592878
E. Hof, S. Shamai
{"title":"Secrecy-achieving polar-coding","authors":"E. Hof, S. Shamai","doi":"10.1109/CIG.2010.5592878","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592878","url":null,"abstract":"A polar coding scheme is suggested for the binary-input memoryless symmetric and degraded wire-tap channel. The provided scheme achieves the entire rate-equivocation region for the considered model.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116738086","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}
引用次数: 90
Universal portfolio algorithms in realistic-outcome markets 现实结果市场中的通用投资组合算法
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592791
A. Tavory, M. Feder
{"title":"Universal portfolio algorithms in realistic-outcome markets","authors":"A. Tavory, M. Feder","doi":"10.1109/CIG.2010.5592791","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592791","url":null,"abstract":"Universal portfolio algorithms find investment strategies competitive against any CRP (constant rebalanced portfolio) for each and every market sequence. This work studies the problem of competitiveness over a subset of realistic, non-pathological, market sequences observed in many settings, e.g., high-frequency trading. Competitive investment in this setting will be shown to be more an extension of the easier universal 0–1 loss problem than of universal gambling (or coding). Analysis of realism-agnostic investment algorithms will show that they perform much better on in-hindsight realistic sequences than previously demonstrated. We suggest that this implies that the study of realistic universal portfolio algorithms must involve a comparison to a stronger adversary than the CRP adversary: an adversary that rebalances a portfolio often enough to avoid pathological sequences, but not so frequently that transaction costs dominate.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127556017","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
On encoders for quantum convolutional codes 量子卷积码的编码器
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592857
M. Grassl, M. Rötteler
{"title":"On encoders for quantum convolutional codes","authors":"M. Grassl, M. Rötteler","doi":"10.1109/CIG.2010.5592857","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592857","url":null,"abstract":"We consider the problem of computing an encoding circuit for a quantum convolutional code given by a polynomial stabilizer matrix S(D) = (X(D) | Z(D)). We present an algorithm that is very similar to a polynomial-time algorithm for computing the Smith form of a polynomial matrix. This is a step towards the conjecture that any quantum convolutional code has an encoder with polynomially bounded depth.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132360647","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
Secure type-based multiple access: Transmission strategy and analysis for perfect secrecy 基于安全类型的多路访问:传输策略和完全保密的分析
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592683
Hyoungsuk Jeon, Daesung Hwang, Hyuckjae Lee, J. Ha, Jinho Choi
{"title":"Secure type-based multiple access: Transmission strategy and analysis for perfect secrecy","authors":"Hyoungsuk Jeon, Daesung Hwang, Hyuckjae Lee, J. Ha, Jinho Choi","doi":"10.1109/CIG.2010.5592683","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592683","url":null,"abstract":"Since wireless sensor networks (WSNs) are vulnerable to threats and attacks due to the nature of wireless communications between sensors and fusion center (FC), it is often necessary to secure transmissions from any possible eavesdropping. In this paper, we study the eavesdropping issue when sensors are over-deployed and the channels between sensors and the ally FC are modeled as time-varying Rayleigh fading channels. We propose a transmission scheme in which only the sensors of strong and weak channel gains report their decisions in a predetermined way based on type-based multiple access protocol. By taking advantage of random behaviors of wireless channels in the form of the multiuser diversity and carefully design different roles of sensors of strong and weak channel gains to the ally FC, the proposed scheme can confuse the enemy FC in making a decision. Eventually, it guarantees the perfect secrecy promised by an information theoretic measure. We also analyze detection error probability and equivocation at the ally and enemy FCs, respectively.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115076527","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
Information sets for abelian codes 阿贝尔码的信息集
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592836
J. J. Bernal, J. Simón
{"title":"Information sets for abelian codes","authors":"J. J. Bernal, J. Simón","doi":"10.1109/CIG.2010.5592836","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592836","url":null,"abstract":"All throughout F denotes the field with q elements where q is a power of a prime p. Given C, a linear code of dimension k, and length n over the field F, an information set for C is a set of positions {i1, …, ik} such that restricting the codewords to these positions we get the hole space Fk. The codeword symbols in these positions are called information symbols and the other n — k positions are called check positions ([10]).","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115366319","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
Identification codes in cryptographic protocols 密码协议中的识别码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592911
J. Bringer, H. Chabanne, G. Cohen, B. Kindarji
{"title":"Identification codes in cryptographic protocols","authors":"J. Bringer, H. Chabanne, G. Cohen, B. Kindarji","doi":"10.1109/CIG.2010.5592911","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592911","url":null,"abstract":"Identification codes were introduced by Ahlswede and Dueck more than twenty years ago. There is today a lot of studies to identify objects such as contactless devices (for instance RFID tags) but, surprisingly, no one has considered the use of this kind of codes in the literature for that purpose until the recent work of Bringer et al. at Indocrypt '09. We here show how the security of these new identification protocols is related to some well-known problems in coding theory. We also extend the original proposal to a new problem.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114579732","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
Topological color codes over higher alphabet 在更高的字母上的拓扑颜色代码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592860
P. Sarvepalli
{"title":"Topological color codes over higher alphabet","authors":"P. Sarvepalli","doi":"10.1109/CIG.2010.5592860","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592860","url":null,"abstract":"Color codes are a class of topological codes that have come into prominence in the recent years. Like the surface codes the codespace defined by them can be associated to the degenerate ground state of a local Hamiltonian. In addition they can be designed to have an extended set of transversal encoded gates (compared to surface codes) increasing their appeal for fault tolerant quantum computation. In this paper we generalize the color codes to arbitrary prime power alphabet. We show that in the 2D case there exist color codes for which the nonbinary Clifford group can be implemented transversally.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121277354","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
首页 上一页 下一页 尾页
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学术官方微信