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

2010 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Heavy weight codes 重量级代码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-07-23 DOI: 10.1109/ISIT.2010.5513691
G. Cohen, P. Solé, A. Tchamkerten
{"title":"Heavy weight codes","authors":"G. Cohen, P. Solé, A. Tchamkerten","doi":"10.1109/ISIT.2010.5513691","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513691","url":null,"abstract":"Motivated by certain recent problems in asynchronous communication, we introduce and study B(n, d, w), defined as the maximum number of length n binary sequences with minimum distance d, and such that each sequence has weight at least w. Specifically, we investigate the asymptotic exponential growth rate of B(n, d, w) with respect to n and with fixed ratios δ = d/n and ω = w/n. For ω ∈ [0, 1/2], this growth rate function b(δ, ω) is shown to be equal to a(δ), the asymptotic exponential growth rate of A(n, d) — the maximum number of length n binary sequences with minimum distance d. For ω ∈ (1/2, 1], we show that b(δ, ω) ≤ a(δ, ω) + f(ω), where a(δ, ω) denotes the asymptotic exponential growth rate of A(n, d, w), the maximum number of length n binary sequences with minimum distance d and constant weight w, and where f(w) is a certain function that satisfies 0 < f(ω) < 0.088 and lim<inf>ω→1</inf> f(ω) = lim<inf>ω→1/2</inf> f(ω) = 0. Based on numerical evidence, we conjecture that b(δ, ω) is actually equal to a(δ, ω) for ω ∈ (1/2, 1]. Finally, lower bounds on B(n, d, w) are obtained via explicit code constructions.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126344744","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
A practical message-wise unequal error protection coding scheme 一种实用的消息不均等错误保护编码方案
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513487
Chen Gong, G. Yue, Xiaodong Wang
{"title":"A practical message-wise unequal error protection coding scheme","authors":"Chen Gong, G. Yue, Xiaodong Wang","doi":"10.1109/ISIT.2010.5513487","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513487","url":null,"abstract":"We propose a practical message-wise unequal error protection (UEP) scheme using low-density parity-check (LDPC) codes, where one or more special messages are more protected than other ordinary messages, which performs codeword flipping to separate the codewords of special and ordinary messages. To better distinguish the original and flipped codewords, the LDPC codes with all-odd degree check nodes are employed. The decoder performs message type detection and codeword flipping detection by tracking the number of unsatisfied check nodes in iterative decoding. We provide both finite-length and asymptotic performance analysis for the proposed coding scheme. Simulation results are provided to show that the proposed practical message-wise UEP schemes offer capacity-approaching protections to both types of messages as if only one type of message is transmitted.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"5 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":"116857662","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
Clifford subsystem codes 克利福德子系统代码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513672
A. Klappenecker
{"title":"Clifford subsystem codes","authors":"A. Klappenecker","doi":"10.1109/ISIT.2010.5513672","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513672","url":null,"abstract":"Subsystem codes are a generalization of decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. The known constructions of subsystem codes from classical codes are limited to quantum systems that all have the same dimension, and this dimension must be a power of a prime. It is shown that one can remove these restrictions and obtain subsystem codes in quantum systems of arbitrary finite dimension from classical codes that are subgroups of an abelian group. The constructions are derived from Clifford codes over abstract error groups with abelian index groups.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"626 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120975355","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
Limited feedback design for MIMO-relay assisted cellular networks with beamforming 具有波束形成的mimo中继辅助蜂窝网络的有限反馈设计
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513696
Wei Xu, Xiaodai Dong
{"title":"Limited feedback design for MIMO-relay assisted cellular networks with beamforming","authors":"Wei Xu, Xiaodai Dong","doi":"10.1109/ISIT.2010.5513696","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513696","url":null,"abstract":"We consider a MIMO relay downlink system using beamforming techniques with quantized channel state information (CSI) feedback from two hop channels. With this scheme, each remote user feeds back its quantized CSI to the relay, and the relay sends the quantized beamforming vectors to the base station (BS). An upper bound on the rate loss due to feedback quantization is first characterized. Then, a strategy of scaling the quantization accuracy of both hop links in order to maintain the rate loss within a predetermined gap for growing SNRs is proposed. It is revealed that the numbers of feedback bits of both links should scale linearly with the transmit power at the relay, while the number of feedback bits from the relay to the BS needs to grow with the transmit power at the BS.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"1 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":"121042919","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
New bounds for the sum capacity of binary and nonbinary synchronous CDMA systems 二元和非二元同步CDMA系统容量总和的新边界
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513400
Shayan Dashmiz, Mohammad Reza Takapoui, P. Pad, F. Marvasti
{"title":"New bounds for the sum capacity of binary and nonbinary synchronous CDMA systems","authors":"Shayan Dashmiz, Mohammad Reza Takapoui, P. Pad, F. Marvasti","doi":"10.1109/ISIT.2010.5513400","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513400","url":null,"abstract":"Lower and upper bounds are derived for the sum capacity of synchronous CDMA where the signature matrix and input alphabets are binary or (2p + 1)-ary, in two cases of noiseless and noisy channels. The bounds are very tight in some regions. Interestingly, simulations show that the formulas for noisy systems tend to the ones for noiseless system as noise tends to 0 while it cannot be deduced easily from the formulas. The results give good insights about the extent of the number of users in which errorless communication is possible for a system with a given chip rate.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"21 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":"125167803","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
New classes of topological quantum codes derived from embeddings of graphs on compact surfaces 由紧曲面上图的嵌入导出的新型拓扑量子码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513645
C. D. Albuquerque, R. P. Júnior, E. B. Silva
{"title":"New classes of topological quantum codes derived from embeddings of graphs on compact surfaces","authors":"C. D. Albuquerque, R. P. Júnior, E. B. Silva","doi":"10.1109/ISIT.2010.5513645","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513645","url":null,"abstract":"In this paper we present classes of topological quantum codes (TQC) derived from the embedding of complete bipartite graphs on the corresponding compact surfaces. Every code achieves minimum distance 3 and its encoding rate is such that kovern → 1 as n → 8.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"56 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":"123434109","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
Properties of quasi-uniform codes 准一致码的性质
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513674
T. Chan, A. Grant, Thomas Britz
{"title":"Properties of quasi-uniform codes","authors":"T. Chan, A. Grant, Thomas Britz","doi":"10.1109/ISIT.2010.5513674","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513674","url":null,"abstract":"Quasi-uniform random variables have probability distributions that are uniform over their supports. They are of fundamental interest because a linear information inequality is valid if and only if it is satisfied by all quasi-uniform random variables. In this paper, we investigate properties of codes induced by quasi-uniform random variables.We prove that quasi-uniform codes (which include linear and almost affine codes as special cases) are distance-invariant and that Greene's Theorem and the Critical Theorem of Crapo and Rota hold in the setting of quasi-uniform codes. We also outline how these results provide a coding theoretic approach to construct information inequalities.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"108 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":"115074734","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
Distortion exponents of two-way relaying cooperative networks 双向中继合作网络的失真指数
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513258
J. Wang, Jie Liang
{"title":"Distortion exponents of two-way relaying cooperative networks","authors":"J. Wang, Jie Liang","doi":"10.1109/ISIT.2010.5513258","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513258","url":null,"abstract":"In this paper, we study the transmission of Gaussian signals in a three-node half-duplex bidirectional relaying network, where two users communicate in both directions with the help of one relay, and can transmit at different rates. The relay employs amplify-and-forward (AF) or decode-and-forward (DF) based cooperation protocols. We analyze the distortion exponent that characterizes the high signal-to-noise ratio (SNR) behavior of the end-to-end distortion of the reconstructed signal at each user node. The different rates of the two users necessitate the study of a new concept - the achievable distortion exponent region of the system. We first derive an outer bound on the distortion exponent region of two-way relaying communications, which is tight at large bandwidth ratio. We then obtain the optimal distortion exponent pairs of conventional one-way relaying strategies and AF/DF based two-way relaying protocols with single-rate coding. The results illustrate the effect of the bandwidth ratio and cooperation strategies on the optimal distortion exponents.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"24 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":"115107469","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
Fast-decodable MIDO codes from crossed product algebras 从交叉积代数快速可解码的MIDO代码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513709
F. Oggier, R. Vehkalahti, C. Hollanti
{"title":"Fast-decodable MIDO codes from crossed product algebras","authors":"F. Oggier, R. Vehkalahti, C. Hollanti","doi":"10.1109/ISIT.2010.5513709","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513709","url":null,"abstract":"The goal of this paper is to design fast-decodable space-time codes for four transmit and two receive antennas. The previous attempts to build such codes have resulted in codes that are not full rank and hence cannot provide full diversity or high coding gains. Extensive work carried out on division algebras indicates that in order to get, not only non-zero but perhaps even non-vanishing determinants (NVD) one should look at division algebras and their orders. To further aid the decoding, we will build our codes so that they consist of four generalized Alamouti blocks which allows decoding with reduced complexity. As far as we know, the resulting codes are the first having both reduced decoding complexity, and at the same time allowing one to give a proof of the NVD property.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"93 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":"116418963","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}
引用次数: 24
Marker code optimization and symbol-level synchronization for insertion/deletion channels 标记代码优化和符号级同步的插入/删除通道
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513742
Feng Wang, D. Fertonani, T. Duman
{"title":"Marker code optimization and symbol-level synchronization for insertion/deletion channels","authors":"Feng Wang, D. Fertonani, T. Duman","doi":"10.1109/ISIT.2010.5513742","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513742","url":null,"abstract":"We consider serially-concatenated coding schemes over channels impaired by insertion, deletion, and substitution errors. Specifically, we focus on the interleaved concatenation of an outer channel code with error-correction capabilities and an inner marker code with synchronization capabilities. To limit the decoding latency, marker code-based synchronization is performed only once per received packet, i.e., iterations with the outer decoder are not allowed. We first numerically evaluate, through mutual information analyses, the ultimate rate achievable by this concatenated scheme when standard bit-level synchronization is performed. Then, we introduce a novel symbol-level synchronization algorithm that works on groups of consecutive bits, and show that it improves the achievable rate. Besides the achievable rate analyses, which allow us to optimize the marker code, we also report error-rate simulation results that confirm the superiority of symbol-level synchronization.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"41 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":"122513582","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
下一页 尾页
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学术官方微信