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

2019 IEEE Information Theory Workshop (ITW)最新文献

筛选
英文 中文
Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin Codes 基于插值的交错Gabidulin码解码的快速根查找
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989290
H. Bartz, Thomas Jerkovits, S. Puchinger, J. Rosenkilde
{"title":"Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin Codes","authors":"H. Bartz, Thomas Jerkovits, S. Puchinger, J. Rosenkilde","doi":"10.1109/ITW44776.2019.8989290","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989290","url":null,"abstract":"We show that the root-finding step in interpolation-based decoding of interleaved Gabidulin codes can be solved by finding a so-called minimal approximant basis of a matrix over a linearized polynomial ring. Based on existing fast algorithms for computing such bases over ordinary polynomial rings, we develop fast algorithms for computing them over linearized polynomials. As a result, root finding costs $O^{sim}(ell^{omega}mathcal{M}(n))$ operations in $F_{q^{m}}$, where ℓ is the interleaving degree, n the code length, $F_{q^{m}}$ the base field of the code, $2 leq omega leq 3$ the matrix multiplication exponent, and $mathcal{M}(n) in O(n^{1635})$ is the complexity of multiplying two linearized polynomials of degree at most n. This is an asymptotic improvement upon the previously fastest algorithm of complexity $O(ell^{3}n^{2})$, in some cases $O(ell^{2}n^{2})$.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133445298","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
Gabidulin Codes with Support Constraints 支持约束的Gabidulin代码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8988992
Hikmet Yildiz, B. Hassibi
{"title":"Gabidulin Codes with Support Constraints","authors":"Hikmet Yildiz, B. Hassibi","doi":"10.1109/ITW44776.2019.8988992","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8988992","url":null,"abstract":"Gabidulin codes are the first general construction of linear codes that are maximum rank distance (MRD). They have found applications in linear network coding, for example, when the transmitter and receiver are oblivious to the inner workings and topology of the network (the so-called incoherent regime). The reason is that Gabidulin codes can be used to map information to linear subspaces, which in the absence of errors cannot be altered by linear operations, and in the presence of errors can be corrected if the subspace is perturbed by a small rank. Furthermore, in distributed coding and distributed systems, one is led to the design of error correcting codes whose generator matrix must satisfy a given support constraint. In this paper, we give necessary and sufficient conditions on the support of the generator matrix that guarantees the existence of Gabidulin codes and general MRD codes. When the rate of the code is not very high, this is achieved with the same field size necessary for Gabidulin codes with no support constraint. When these conditions are not satisfied, we characterize the largest possible rank distance under the support constraints and show that they can be achieved by subcodes of Gabidulin codes. The necessary and sufficient conditions are identical to those that appear for MDS codes which were recently proven in [1], [2] in the context of settling the GM-MDS conjecture.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133021869","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
Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes 利用多维图形编码增加闪存的寿命
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989395
Ahmed Hareedy, Rohith Kuditipudi, R. Calderbank
{"title":"Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes","authors":"Ahmed Hareedy, Rohith Kuditipudi, R. Calderbank","doi":"10.1109/ITW44776.2019.8989395","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989395","url":null,"abstract":"In order to meet the demands of data-hungry applications, data storage devices are required to be increasingly denser. Various sources of error appear with this increase in density. Multi-dimensional (MD) graph-based codes are capable of mitigating error sources like interference and channel non-uniformity in dense storage devices. Recently, a technique was proposed to enhance the performance of MD spatially-coupled codes that are based on circulants. The technique carefully relocates circulants to minimize the number of short cycles. However, cycles become more detrimental when they combine together to form more advanced objects, e.g., absorbing sets, including low-weight codewords. In this paper, we show how MD relocations can be exploited to minimize the number of detrimental objects in the graph of an MD code. Moreover, we demonstrate the savings in the number of relocation arrangements earned by focusing on objects rather than cycles. Our technique is applicable to a wide variety of one-dimensional (OD) codes. Simulation results reveal significant lifetime gains in practical Flash systems achieved by MD codes designed using our technique compared with OD codes having similar parameters.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"34 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114042026","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
LDPC Code Design for Delayed Bit-Interleaved Coded Modulation 延迟位交错编码调制的LDPC码设计
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989384
Yihuan Liao, Lei Yang, Jinhong Yuan, Kechao Huang, Raymond W. K. Leung, Junyi Du
{"title":"LDPC Code Design for Delayed Bit-Interleaved Coded Modulation","authors":"Yihuan Liao, Lei Yang, Jinhong Yuan, Kechao Huang, Raymond W. K. Leung, Junyi Du","doi":"10.1109/ITW44776.2019.8989384","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989384","url":null,"abstract":"This paper proposes a method to design low-density parity-check (LDPC) codes for delayed bit-interleaved coded modulation (DBICM). In the method, the code variable node (VN) degree distributions and the assignments of VNs with different degrees to DBICM subchannels are optimized via two cascaded differential evolution (DE) steps. In each step, to optimize VN degree distribution or channel assignment, a parity-check matrix is constructed, and the associated decoding threshold is calculated for each element in a generation. In constructing a parity-check matrix for each channel assignment, we propose a constraint PEGlike code construction method. Protograph-EXIT is employed to calculate the decoding threshold for each parity-check matrix. We apply the proposed method to construct irregular binary LDPC codes for both 16-QAM DBICM and BICM schemes. Simulation results demonstrate that the optimized LDPC codes are within 1 dB from the associated capacity limit at a bit error rate (BER) of 10–6. Besides, the LDPC coded DBICM achieves an SNR gain of 0.5 dB to 0.1 dB over BICM counterparts at a code rate ranges from 0.25 to 0.5.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114114425","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
On Enhancing the Fixed Block-Length Coding Scheme for Joint source-channel communication 联合信源信道通信中固定块长度编码方案的改进
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989401
Arun Padakandla
{"title":"On Enhancing the Fixed Block-Length Coding Scheme for Joint source-channel communication","authors":"Arun Padakandla","doi":"10.1109/ITW44776.2019.8989401","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989401","url":null,"abstract":"We enhance the fixed block-length coding scheme for joint source channel coding over MAC and IC. We prove that this enhancement yields strictly weaker sufficient conditions for both problems.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133034497","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
Capacity Results for Erasure Broadcast Channels with Intermittent Feedback 具有间歇反馈的Erasure广播信道容量结果
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989343
Alireza Vahid, I-Hsiang Wang, Shih-Chun Lin
{"title":"Capacity Results for Erasure Broadcast Channels with Intermittent Feedback","authors":"Alireza Vahid, I-Hsiang Wang, Shih-Chun Lin","doi":"10.1109/ITW44776.2019.8989343","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989343","url":null,"abstract":"Recently, we showed that, rather surprisingly, the capacity region of the two-user erasure broadcast channel with global delayed channel state information (CSI) can be achieved with single-user delayed CSI only. More precisely, we assumed one receiver does not provide its channel state to the other two nodes (the other receiver and the transmitter), while the other receiver reveals its state globally with unit delay. In this work, we consider a more general setting in which feedback links are intermittent. To be precise, at any time instant, each receiver broadcasts its CSI, and this information either becomes available to the other two nodes or gets erased. For this setting, we develop a new set of outer bounds to capture the intermittent nature of the feedback links. These outer bounds depend on the probability that both feedback links are erased rather than the individual erasure probability of each feedback link. This result matches our earlier findings for the single-user delayed CSI scenario. We also provide a capacity-achieving recursive communication protocol for the scenario in which feedback links are fully correlated.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121817412","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
New Upper Bounds on the Capacity of Primitive Diamond Relay Channels 原始菱形中继信道容量的新上界
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989311
Xiugang Wu, Ayfer Özgür, M. Peleg, S. Shamai
{"title":"New Upper Bounds on the Capacity of Primitive Diamond Relay Channels","authors":"Xiugang Wu, Ayfer Özgür, M. Peleg, S. Shamai","doi":"10.1109/ITW44776.2019.8989311","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989311","url":null,"abstract":"Consider a primitive diamond relay channel, where a source X wants to send information to a destination with the help of two relays Y1 and Y2, and the two relays can communicate to the destination via error-free digital links of capacities C1 and C2 respectively, while Y1 and Y2 are conditionally independent given X. In this paper, we develop new upper bounds on the capacity of such primitive diamond relay channels that are tighter than the cut-set bound. Our results include both the Gaussian and the discrete memoryless case and build on the information inequalities recently developed in [6]–[8] that characterize the tension between information measures in a certain Markov chain.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122170841","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
Context Aware Laplacian Mechanism for Local Information Privacy 上下文感知本地信息隐私的拉普拉斯机制
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989402
Mohamed Seif, R. Tandon, Ming Li
{"title":"Context Aware Laplacian Mechanism for Local Information Privacy","authors":"Mohamed Seif, R. Tandon, Ming Li","doi":"10.1109/ITW44776.2019.8989402","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989402","url":null,"abstract":"In this paper, we consider the problem of designing additive noise mechanisms for data release subject to a local information privacy constraint. While there has been significant prior work on devising additive noise mechanisms for differential privacy (such as Laplacian and Gaussian mechanisms), for the notion of information privacy, which accounts for prior-knowledge about the data, there are no such general purpose additive noise mechanisms. To this end, we devise a prior-aware Laplacian noise mechanism, which satisfies local information privacy. We show that adding context awareness (i.e., via the knowledge of prior of the data) improves the tradeoff between utility and privacy when compared to context-unaware mechanisms.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124971856","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
New Bounds for GLD Lattices and Codes GLD格和码的新边界
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989412
M. F. Bollauf, J. Boutros, N. Mir
{"title":"New Bounds for GLD Lattices and Codes","authors":"M. F. Bollauf, J. Boutros, N. Mir","doi":"10.1109/ITW44776.2019.8989412","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989412","url":null,"abstract":"We prove that the ensemble of random Generalized Low-Density (GLD) lattices can attain the Poltyrev limit for an alphabet size increasing polylogarithmically with the lattice dimension. Our main theorem imposes no constraints on the normalized minimum distance of the code associated to the lattice ensemble, any asymptotically good code is suitable. This is a great improvement with respect to the first theorem on Poltyrev goodness of GLD lattices (2015). Our new bound is based on a new method referred to as the buckets approach where we employ the asymptotics of the restricted compositions of the Hamming weight. The new bound has applications in many coding areas beyond the specific lattice ensemble considered in this paper.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125667912","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
Coset Probability Based Majority-logic Decoding for Non-binary LDPC Codes 基于协集概率的非二进制LDPC码多数逻辑译码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989103
V. B. Wijekoon, Shuiyin Liu, E. Viterbo, Y. Hong, R. Micheloni, A. Marelli
{"title":"Coset Probability Based Majority-logic Decoding for Non-binary LDPC Codes","authors":"V. B. Wijekoon, Shuiyin Liu, E. Viterbo, Y. Hong, R. Micheloni, A. Marelli","doi":"10.1109/ITW44776.2019.8989103","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989103","url":null,"abstract":"This paper presents a majority-logic decoding (MLgD) algorithm for non-binary LDPC codes based on a novel expansion of the Tanner graph. The expansion introduced converts the Q-ary graph into a binary one, which makes the new MLgD algorithm more attractive for hardware implementations. Proposed algorithm performs significantly better than the existing MLgD algorithms in the waterfall region, and it shows a much lower error-floor as well. Algorithm only requires integer additions, comparisons, finite field operations and some binary operations. Thus, it offers an effective trade-off between performance and complexity in decoding non-binary LDPC codes.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130382751","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学术官方微信