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

2010 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Zero-forcing for the symmetric Interference Channel with conferencing encoders 带会议编码器的对称干扰信道的强制零
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513355
H. Bagheri, A. Motahari, A. Khandani
{"title":"Zero-forcing for the symmetric Interference Channel with conferencing encoders","authors":"H. Bagheri, A. Motahari, A. Khandani","doi":"10.1109/ISIT.2010.5513355","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513355","url":null,"abstract":"A two-user Gaussian Interference Channel (GIC) is considered in which encoders are connected through noiseless links with finite capacities. New genie-aided upper bounds on the sum-capacity are developed which incorporate the capacities of the cooperative links. When the GIC is symmetric, with possibly different cooperation link capacities, the sum-capacity is characterized within 2.13 bits gap for all values of the channel parameters. In the achievable scheme, each transmitter sends a private and a common message, and zero-forces the part of the other transmitter's private message, communicated over the conference between the encoders.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"22 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":"134419701","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
The tradeoff function for a class of RLL(d, k) constraints 一类RLL(d, k)约束的权衡函数
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513657
Erez Louidor Ilan
{"title":"The tradeoff function for a class of RLL(d, k) constraints","authors":"Erez Louidor Ilan","doi":"10.1109/ISIT.2010.5513657","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513657","url":null,"abstract":"A reverse concatenation coding scheme for storage systems in which the information is encoded first by a modulation (constraint) code and then by a systematic error-correcting code is considered. In this scheme, the output of the modulation coding stage has certain positions left “unconstrained”-in the sense that any way of filling them with bits results in a sequence that satisfies the constraint. These positions are then used to store the parity-check bits of the error-correcting code so that the result is a valid constrained sequence. The tradeoff function defines the maximum overall rate of the encoding scheme for a given density of unconstrained positions. This function is determined for two families of RLL constraints: RLL(d,∞) and RLL(d, 2d+2). For RLL(d, 2d+2), a curious dichotomy in the shape of the tradeoff function between different ranges of values of d is shown to exist.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"8 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":"130809644","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
LP decoding of regular LDPC codes in memoryless channels 无存储器信道中规则LDPC码的LP解码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513612
N. Halabi, G. Even
{"title":"LP decoding of regular LDPC codes in memoryless channels","authors":"N. Halabi, G. Even","doi":"10.1109/ISIT.2010.5513612","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513612","url":null,"abstract":"We study error bounds for linear programming decoding of regular LDPC codes. For memoryless binary-input output-symmetric channels, we prove bounds on the word error probability that are inverse doubly-exponential in the girth of the factor graph. For memoryless binary-input AWGN channels, we derive lower bounds on the thresholds for regular LDPC codes under LP decoding. Specifically, we prove a lower bound of σ = 0.735 on the threshold of (3, 6)-regular LDPC codes with logarithmic girth.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"62 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":"133362168","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}
引用次数: 25
Set-partition methods and orthogonal designs 集分法与正交设计
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513710
Smarajit Das
{"title":"Set-partition methods and orthogonal designs","authors":"Smarajit Das","doi":"10.1109/ISIT.2010.5513710","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513710","url":null,"abstract":"Space-time block codes based on orthogonal designs are useful from practical point of view as these codes admit symbol-by-symbol maximum-likelihood decoding and also achieve full diversity. Though the square orthogonal designs have been studied quite extensively, there is very little progress in the area of non-square orthogonal designs. Some of the results pertaining to rectangular orthogonal designs have been obtained through various combinatorial methods which are quite involved and complicated. In this paper, we study non-square orthogonal designs using set partition methods. Using this method, some of the problems in complex orthogonal designs have been addressed. Moreover, the proposed method provides a simple and an elegant approach for the study of rectangular designs.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"60 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":"132658500","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
Data-dependent write channel model for Magnetic Recording 基于数据的磁记录写入通道模型
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513433
Aravind R. Iyengar, P. Siegel, J. Wolf
{"title":"Data-dependent write channel model for Magnetic Recording","authors":"Aravind R. Iyengar, P. Siegel, J. Wolf","doi":"10.1109/ISIT.2010.5513433","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513433","url":null,"abstract":"We propose a new channel model for the write channel in Magnetic Recording with Bit-Patterned Media. We study information theoretic propoerties of this channel and suggest a simplistic rate-1/2 coding scheme that achieves zero error. Based on this channel model, we propose a channel with insertion and deletion errors.","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":"128903555","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
Clustered bounded-distance decoding of codeword-stabilized quantum codes 码字稳定量子码的聚类有界距离译码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513671
Yunfan Li, I. Dumer, M. Grassl, L. Pryadko
{"title":"Clustered bounded-distance decoding of codeword-stabilized quantum codes","authors":"Yunfan Li, I. Dumer, M. Grassl, L. Pryadko","doi":"10.1109/ISIT.2010.5513671","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513671","url":null,"abstract":"Codeword stabilized (CWS) codes form a general class of quantum codes that includes stabilizer codes and many families of nonadditive codes with good parameters. Similar to classical nonlinear codes, a CWS code can be decoded by screening all possible errors. For an n-qubit quantum code correcting up to t errors, this brute-force approach consecutively tests different errors of weight t or less, and employs a separate n-qubit measurement in each test. To simplify decoding, we propose an algorithm that employs a single measurement to process all errors located on a given cluster of t qubits. Compared to an exhaustive error screening, this reduces the total number of measurements required for error correction about 3t times.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"239 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":"133796315","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
Local-testability and self-correctability of q-ary sparse linear codes q元稀疏线性码的局部可测性和自校正性
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513421
Widad Machmouchi
{"title":"Local-testability and self-correctability of q-ary sparse linear codes","authors":"Widad Machmouchi","doi":"10.1109/ISIT.2010.5513421","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513421","url":null,"abstract":"We prove that q-ary sparse codes with small bias are self-correctable and locally testable. We generalize a result of Kaufman and Sudan [3] that proves the local testability and correctability of binary sparse codes with small bias. We use properties of q-ary Krawtchouk polynomials and the McWilliams identity -that relates the weight distribution of a code to the weight distribution of its dual- to derive bounds on the error probability of the randomized tester and self-corrector we are analyzing.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"294 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":"133847005","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
On reversible Markov chains and maximization of directed information 可逆马尔可夫链与有向信息最大化
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513240
S. K. Gorantla, T. Coleman
{"title":"On reversible Markov chains and maximization of directed information","authors":"S. K. Gorantla, T. Coleman","doi":"10.1109/ISIT.2010.5513240","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513240","url":null,"abstract":"In this paper, we consider a dynamical system, whose state is an input to a memoryless channel. The state of the dynamical system is affected by its past, an exogenous input, and causal feedback from the channel's output. We consider maximizing the directed information between the input signal and the channel output, over all exogenous input distributions and/or dynamical system policies. We demonstrate that under certain conditions, reversibility of a Markov chain implies directed information is maximized. With this, we develop achievability theorems for channels with (infinite) memory as well as optimality conditions for sequential estimation of Markov processes through dynamical systems with causal feedback. We provide examples, which includes the exponential server timing channel and the trapdoor channel.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"118 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":"115549055","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}
引用次数: 15
Rotated modulations for outage probability minimization: a fading space approach 最小停电概率的旋转调制:衰落空间方法
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513716
Dieter Duyck, J. Boutros, M. Moeneclaey
{"title":"Rotated modulations for outage probability minimization: a fading space approach","authors":"Dieter Duyck, J. Boutros, M. Moeneclaey","doi":"10.1109/ISIT.2010.5513716","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513716","url":null,"abstract":"The outage probability limit is a fundamental lower bound on the word error rate of coded communications systems. It is mainly determined by two parameters: the diversity order and the coding gain. With linear precoding, the maximum achievable coding rate yielding full-diversity can exceed the upper limit given by the standard Singleton bound. However, the effect of precoding on the coding gain is not well understood. This paper analyzes linear precoding from an information theoretical point of view and tries to optimize the coding gain. For discrete constellations, it is shown that constellation expansion together with one optimized precoding parameter is sufficient to approach the best outage achieved by a Gaussian alphabet, thus maximizing the coding gain.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"155 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":"124335266","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
Small ensembles of sampling matrices constructed from coding theory 由编码理论构造的采样矩阵的小集合
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513359
A. Barg, A. Mazumdar
{"title":"Small ensembles of sampling matrices constructed from coding theory","authors":"A. Barg, A. Mazumdar","doi":"10.1109/ISIT.2010.5513359","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513359","url":null,"abstract":"In the area of compressed sensing it is known that high-dimensional, approximately sparse signals x ∈ RN can be accurately recovered from a small number m of linear samples. Most known recovery procedures rely in some form on a special property of the sampling matrix, called the Restricted Isometry Property (RIP). It has been shown that random Gaussian matrices possess the RIP and allow an efficient reconstruction of the signal, for instance, by linear programming or by other methods, and similar results are known for the ensembles of random binary matrices. We pursue a link between coding theory and compressed sensing, discussing the construction problem of sampling matrices with short sketches. The best known constructions of “small-bias probability spaces” (aka codes with narrow distance distribution) account for deterministic sampling matrices with sketch length m = O(k3 log N/log k) while the best randomized constructions require only m = Ω(k log(N/k)) samples, where k is the number of essential entries of the signal. We address the construction problem of sampling matrices in the region between these two extremes, allowing the sketch length of order k2 log N. We show that in this case it is possible to construct ensembles of sampling matrices of size much smaller than the ensembles known previously. For instance, the number of random bits required to construct a matrix in one of our ensembles equals O(k2 log k logN), which compares favorably with the previously known estimate of O(kN log(N/k)) random bits for ensembles of random binary matrices.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"73 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":"114821982","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学术文献互助群
群 号：604180095
Book学术官方微信