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

2010 IEEE Information Theory Workshop最新文献

筛选
英文 中文
How to achieve the optimal DMT of selective fading MIMO channels? 如何实现选择性衰落MIMO信道的最优DMT ?
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592638
L. Mroueh, J. Belfiore
{"title":"How to achieve the optimal DMT of selective fading MIMO channels?","authors":"L. Mroueh, J. Belfiore","doi":"10.1109/CIG.2010.5592638","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592638","url":null,"abstract":"In this paper, we extend the non-vanishing determinant (NVD) criterion to the selective fading channel case. A new family of split NVD parallel codes, that satisfies this design criterion, is proposed to achieve the optimal diversity multiplexing tradeoff (DMT) derived by Coronel and Bölcskei, IEEE ISIT, 2007. This result is of significant interest not only in its own right, but also because it settles a long-standing debate in the literature related to the optimal DMT of selective fading channels.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"9 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":"122844808","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 secure network coding with unequal link capacities and restricted wiretapping sets 不等链路容量和限制窃听集的安全网络编码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592818
T. Cui, T. Ho, J. Kliewer
{"title":"On secure network coding with unequal link capacities and restricted wiretapping sets","authors":"T. Cui, T. Ho, J. Kliewer","doi":"10.1109/CIG.2010.5592818","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592818","url":null,"abstract":"We address secure network coding over networks with unequal link capacities in the presence of a wiretapper who has only access to a restricted number of k links in the network. Previous results show that for the case of equal link capacities and unrestricted wiretapping sets, the secrecy capacity is given by the cut-set bound, whether or not the location of the wiretapped links is known. The cut-set bound can be achieved by injecting k random keys at the source which are decoded at the sink along with the message. In contrast, for the case where the wiretapping set is restricted, or where link capacities are not equal, we show that the cut-set bound is not achievable in general. Finally, it is shown that determining the secrecy capacity is a NP-hard problem.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"20 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":"124155452","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
Stabilizer subsystem codes with spatially local generators 具有空间局部生成器的稳定器子系统代码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592872
S. Bravyi
{"title":"Stabilizer subsystem codes with spatially local generators","authors":"S. Bravyi","doi":"10.1109/CIG.2010.5592872","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592872","url":null,"abstract":"We derive new tradeoffs for reliable quantum information storage in a 2D local architecture based on subsystem quantum codes. Our results apply to stabilizer subsystem codes, that is, stabilizer codes in which part of the logical qubits does not encode any information. A stabilizer subsystem code can be specified by its gauge group — a subgroup of the Pauli group that includes the stabilizers and the logical operators on the unused logical qubits. We assume that the physical qubits are arranged on a two-dimensional grid and the gauge group has spatially local generators such that each generator acts only on a few qubits located close to each other. Our main result is an upper bound kd = O(n), where k is the number of encoded qubits, d is the minimal distance, and n is the number of physical qubits. In the special case when both gauge group and the stabilizer group have spatially local generators, we derive a stronger bound kd2 = O(n) which is tight up to a constant factor.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"11 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":"123639451","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
Rotate-and-add coding: A novel algebraic network coding scheme 旋转加编码:一种新颖的代数网络编码方案
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592671
A. Keshavarz-Haddad, M. Khojastepour
{"title":"Rotate-and-add coding: A novel algebraic network coding scheme","authors":"A. Keshavarz-Haddad, M. Khojastepour","doi":"10.1109/CIG.2010.5592671","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592671","url":null,"abstract":"In this paper we introduce a novel linear network coding scheme, namely “rotate-and-add coding”, that possesses low encoding complexity and operates fundamentally different from the traditional network codes. This scheme can operate on a small field (e.g. F2), thereby, it alleviates the computational complexities due to multiplication and addition operations in large finite fields. The key idea is to function on a vector of symbols instead of working with a single symbol of a large field. Each node encodes its received vectors by simply rotationally shifting the vectors and then adding them, i.e., here the addition is done in vector form and the multiplication is replaced by rotation. We verify that the new scheme requires lower computation and overhead than the existing schemes. However, as the cost of reducing the complexity, it provides slightly smaller throughput.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"23 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":"133193511","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
Capacity regions for some classes of Causal Cognitive Interference Channels with delay 一类具有延迟的因果认知干扰通道的容量区域
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592689
M. Mirmohseni, Bahareh Akhbari, M. Aref
{"title":"Capacity regions for some classes of Causal Cognitive Interference Channels with delay","authors":"M. Mirmohseni, Bahareh Akhbari, M. Aref","doi":"10.1109/CIG.2010.5592689","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592689","url":null,"abstract":"In this paper, we investigate Causal Cognitive Interference Channel (CC-IFC) with delay in which the cognitive user transmission can depend on L future received symbols as well as the past ones. We study two special cases: CC-IFC without delay (L = 1), where the cognitive user can use only current and past received symbols, and CC-IFC with a block length delay (L = n), wherein the entire received sequence can be used. In each case, we obtain an inner bound on the capacity region. Our coding schemes are based on the generalized block Markov superposition coding and instantaneous relaying for CC-IFC without delay, and non-causal partial Decode-and-Forward (DF) for CC-IFC with a block length delay. Further, providing converse proofs, we show that the derived inner bounds are tight in some cases. Hence, we characterize the capacity regions for the classes of degraded and semi-deterministic CC-IFC without delay and CC-IFC with a block length delay, under strong interference conditions.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"6 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":"128681090","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
Group permutable constant weight codes 分组可变常权码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592644
O. Moreno, J. Ortiz-Ubarri
{"title":"Group permutable constant weight codes","authors":"O. Moreno, J. Ortiz-Ubarri","doi":"10.1109/CIG.2010.5592644","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592644","url":null,"abstract":"Improvements to the Johnson Bound for Optical Orthogonal Codes have been used to prove the optimality of double-periodic arrays with row and column length relatively prime. In our work we produce families of double-periodic arrays where the row and column length are not relatively prime. In this work we introduce the concept of group permutable constant weight codes and non-binary group permutable constant weight codes. We present improvements to the Johnson Bound to bound the cardinality of the families of double-periodic arrays whose row and column length are not relatively prime. We present some families of group permutable constant weight codes and prove the optimality of these families.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"45 33","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133783196","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
Exact PWM representation of bandlimited signals 带宽限制信号的精确PWM表示
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592737
Jing Huang, K. Padmanabhan, O. Collins
{"title":"Exact PWM representation of bandlimited signals","authors":"Jing Huang, K. Padmanabhan, O. Collins","doi":"10.1109/CIG.2010.5592737","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592737","url":null,"abstract":"This paper proves that any bandlimited signal within ±0.637V can be represented by a PWM waveform with amplitude V. The number of the pulses in the waveform is equal to the number of the Nyquist samples. This paper also provides a practical iterative procedure to generate the PWM waveform for a given bandlimited signal. The error of this procedure decreases exponentially with the number of iterations.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"78 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":"133210635","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
Generalized Frobenius extensions of finite rings and trace functions 有限环与迹函数的广义Frobenius扩展
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592917
M. Greferath, A. Nechaev
{"title":"Generalized Frobenius extensions of finite rings and trace functions","authors":"M. Greferath, A. Nechaev","doi":"10.1109/CIG.2010.5592917","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592917","url":null,"abstract":"We present a notion of generalized Frobenius extension for finite rings, and study related trace functions. Then we show applications of such extensions for algebraic coding theory.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"78 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":"125031495","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
Abelian varieties in coding and cryptography 编码和密码学中的阿贝尔变体
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592929
I. Blake
{"title":"Abelian varieties in coding and cryptography","authors":"I. Blake","doi":"10.1109/CIG.2010.5592929","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592929","url":null,"abstract":"Algebraic curves over a finite field have played a central role in both coding theory and cryptography over the past three decades. In coding theory the use of algebraic curves led to the discovery of asymptotically good codes whose parameters lie above the Varshamov-Gilbert bound in certain cases while in cryptography the use of elliptic curves led to public key cryptosystems that are more efficient, in some sense, for a given level of security than integer factorization based ones. It would seem natural that the use of higher dimensional varieties might lead to even better results for both applications. Such has not so far been the case in any dramatic way. The purpose of this talk is to review the situation on the use of Abelian varieties in these two areas.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"20 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":"127297935","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
The projective Kerdock code 投影Kerdock代码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592761
M. Nastasescu, A. Calderbank
{"title":"The projective Kerdock code","authors":"M. Nastasescu, A. Calderbank","doi":"10.1109/CIG.2010.5592761","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592761","url":null,"abstract":"Certain nonlinear binary codes can be constructed as binary images of Z4-linear codes under the Gray map. Examples include the second-order Reed-Muller code and the Kerdock and Preparata codes. In this paper, we consider a new quaternary code which is an additive subcode of the Z4-linear Kerdock code. The Kerdock code is the direct sum of a one-dimensional quaternary code and the quaternary subcode examined in this paper. This paper calculates the weight distribution of the projective Kerdock code from which the weight distribution of the dual code can be computed. The dual code is a supercode of the quaternary Preparata code. The projective Kerdock code is used to construct a deterministic measurement matrix for compressed sensing. Numerical experiments are presented for sparse reconstruction using the LASSO that show improvement over random Gaussian matrices of the same size.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"11 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":"130503198","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
首页 上一页 下一页 尾页
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学术官方微信