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

筛选
英文 中文
Type-II Quasi-Cyclic LDPC Codes with Girth Eight from Sidon Sequence Sidon序列中周长为8的ii型拟循环LDPC码
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613426
Guohua Zhang, Yulin Hu, Qinwei He, Juhua Wang
{"title":"Type-II Quasi-Cyclic LDPC Codes with Girth Eight from Sidon Sequence","authors":"Guohua Zhang, Yulin Hu, Qinwei He, Juhua Wang","doi":"10.1109/ITW.2018.8613426","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613426","url":null,"abstract":"In this work, we consider type-II quasi-cyclic LDPC codes with girth eight from a Sidon sequence. We first derive the necessary and sufficient conditions guaranteeing girth-eight type-II QC-LDPC codes. By combining these conditions and the concept of a Sidon sequence, two classes of type-II codes are subsequently proposed with girth up to eight. We discuss the distance upper bounds of the two classes of codes and show that the second class provides a larger distance upper bound. In particular, to the best of our knowledge, the second class we proposed yields the first algebraic construction for girth-eight type-II codes with rates larger than a half and distance upper bounds exceeding twelve. Via simulations, we show that the girth-eight type-II codes from the second class significantly outperform the existing CDF-based girth-eight type-II codes, and that they perform better than or almost identically to the randomly generated girth-eight quadr. congr. codes.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128912757","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
ITW 2018 Welcome ITW 2018欢迎
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/itw.2018.8613514
{"title":"ITW 2018 Welcome","authors":"","doi":"10.1109/itw.2018.8613514","DOIUrl":"https://doi.org/10.1109/itw.2018.8613514","url":null,"abstract":"","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132371444","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
Fronthaul Data Reduction in Massive MIMO Aided C-RAN via Two-timescale Hybrid Compression 基于双时间尺度混合压缩的大规模MIMO辅助C-RAN前传数据缩减
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613466
An Liu, Xihan Chen, Wei Yu, V. Lau, Min-Jian Zhao
{"title":"Fronthaul Data Reduction in Massive MIMO Aided C-RAN via Two-timescale Hybrid Compression","authors":"An Liu, Xihan Chen, Wei Yu, V. Lau, Min-Jian Zhao","doi":"10.1109/ITW.2018.8613466","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613466","url":null,"abstract":"In massive MIMO aided cloud radio access network (C-RAN), plenty of remote radio heads (RRHs), each equipped with a massive MIMO array, are distributed within a specific geographical area and are connected to a centralized baseband unit (BBU) pool through fronthaul links. One major performance bottleneck in the uplink of massive MIMO aided C-RAN is that, the RRHs need to transport a huge amount of data to the BBU for baseband processings. Existing fronthaul compression methods that rely on fully-digital processing are not suitable for the massive MIMO regime due to their high implementation cost. To overcome this challenge, we propose a two-timescale hybrid analog-and-digital spatial compression scheme at RRHs to reduce the fronthaul data, where the analog filter is updated at a slow timescale according to the channel statistics to achieve massive MIMO array gain, and the digital filter is updated at a fast timescale according to the instantaneous effective channel state information (CSI) to achieve spatial multiplexing gain. Such a design can alleviate the performance bottleneck of limited fronthaul with reduced hardware cost and power consumption, and is more robust to the CSI delay. We propose an online algorithm for the two-timescale non-convex optimization of analog and digital filters. Simulations verify the advantages of the proposed scheme over state-of-the-art baseline schemes.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132453768","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
Optimal Cyclic (r, ẟ) Locally Repairable Codes with Unbounded Length 长度无界的最优循环(r, ẟ)局部可修码
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613345
Weijun Fang, Fang-Wei Fu
{"title":"Optimal Cyclic (r, ẟ) Locally Repairable Codes with Unbounded Length","authors":"Weijun Fang, Fang-Wei Fu","doi":"10.1109/ITW.2018.8613345","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613345","url":null,"abstract":"Prakash et al. [2] introduced the concept of $(r, delta)$ locally repairable codes $((r, delta)$-LRCs for short) for tolerating multiple failed nodes. An $(r, delta)$-LRC is called optimal if it achieves the Singleton-type bound. In this paper, inspired by the work of [3], we firstly construct two classes of optimal cyclic $(r, delta)$-LRCs with unbounded lengths (i.e., lengths of these codes are independent of the alphabet size) and minimum distances $delta+1$ or $delta+2$, which generalize the results about the $delta=2$ case given in [3]. Secondly, with a slightly stronger condition, we present a construction of optimal cyclic $(r, delta)$-LRCs with unbounded length and larger minimum distance $ 2delta$. Furthermore, when $delta = 3$, we provide another class of optimal cyclic $(r, 3)$-LRCs with unbounded length and larger minimum distance 6.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132091479","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}
引用次数: 29
Locally Repairable Codes with Heterogeneous Locality Constraints 具有异质局域约束的局部可修码
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613318
Qi Chen, Chunming Tang, Zhiqiang Lin
{"title":"Locally Repairable Codes with Heterogeneous Locality Constraints","authors":"Qi Chen, Chunming Tang, Zhiqiang Lin","doi":"10.1109/ITW.2018.8613318","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613318","url":null,"abstract":"A code over a finite alphabet is called locally repairable codes (LRCs) if every symbol in the encoding is a function of a small number of other symbols of the codeword. In this paper, we study LRCs with heterogeneous locality constraints. We introduce $(n, k, r_{i}, delta_{i}, i in [m])$ LRCs which generalize the LRCs with equal $(r, delta)$-locality, and establish the Singleton-like bound for such codes. Then, we study how to construct optimal LRCs, namely, its minimum distance attains the proposed bound. In precisely, we redefine the notation of LRCs with maximal recoverability (MR-LRCs) based on the proposed LRCs and show that MR-LRCs are optimal LRCs. Finally, we construct a family of MR-LRCs which extend the construction of LRCs with equal locality presented by Rawat et al.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127865694","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
Error Correction and Detection for Computing Memories Using System Side Information 基于系统侧信息的计算存储器纠错与检测
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613473
Clayton Schoeny, Irina Alam, Mark Gottscho, Puneet Gupta, L. Dolecek
{"title":"Error Correction and Detection for Computing Memories Using System Side Information","authors":"Clayton Schoeny, Irina Alam, Mark Gottscho, Puneet Gupta, L. Dolecek","doi":"10.1109/ITW.2018.8613473","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613473","url":null,"abstract":"Error correction and detection are the core components of all modern memory systems. Current computing memory systems use simple coding schemes to simultaneously meet the resiliency and latency requirements. In this paper, we review our recent results on context-aware coding for computing memories, an approach that explicitly takes into account various intrinsic side information for improved robustness to faults. We discuss both error correction and detection, codes’ theoretical properties, and provide examples of how these solutions can be implemented in practice. We explicitly describe the special case of the error localization codes. We also discuss promising future directions and connections with classical information theoretic concepts.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121549316","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
Decoding Topological Subsystem Color Codes and Generalized Subsystem Surface Codes 解码拓扑子系统颜色码和广义子系统表面码
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613474
Vinuta V. Gayatri, P. Sarvepalli
{"title":"Decoding Topological Subsystem Color Codes and Generalized Subsystem Surface Codes","authors":"Vinuta V. Gayatri, P. Sarvepalli","doi":"10.1109/ITW.2018.8613474","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613474","url":null,"abstract":"Topological subsystem codes can combine the advantages of both topological codes and subsystem codes. In this paper we study two classes of topological subsystem codes with an emphasis on decoding them. First, we generalize the two step decoding algorithm of Suchara et al. to all topological subsystem color codes. Then, we propose a construction of subsystem surface codes and develop decoders for them generalizing the results of Bravyi et al. Our simulations for the topological subsystem color code derived from the square octagon lattice resulted in a noise threshold of 1.75%. This is comparable to the previous result of 1.95% by Bombin et al., who used a different algorithm.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115817944","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
Symmetric Multilevel Imperfect Secret Sharing 对称多级不完全秘密共享
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613450
Tao Guo, Xuan Guang, K. Shum
{"title":"Symmetric Multilevel Imperfect Secret Sharing","authors":"Tao Guo, Xuan Guang, K. Shum","doi":"10.1109/ITW.2018.8613450","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613450","url":null,"abstract":"We generalize secret sharing to a symmetric multilevel imperfect secret sharing (SMISS) problem. To measure the secrecy of the system, we introduce a security level for each set of encoded messages, which is measured by the equivocation of the source message given the encoded messages in this set. The security levels of all the subsets with the same cardinality are assumed to be identical. This problem in its general case is complicated. In this paper, we explicitly characterize the rate regions of the general two-level and three-level SMISS problems.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121751188","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
Encoding of Non-binary Quasi-cyclic Codes by Lin-Chung-Han Transform 用Lin-Chung-Han变换编码非二进制拟循环码
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613313
Runzhou Li, Qin Huang, Zulin Wang
{"title":"Encoding of Non-binary Quasi-cyclic Codes by Lin-Chung-Han Transform","authors":"Runzhou Li, Qin Huang, Zulin Wang","doi":"10.1109/ITW.2018.8613313","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613313","url":null,"abstract":"Recently, Lin, Chung, and Han presented an efficient additive fast Fourier transform based on a novel polynomial basis. This paper explains clearly and proves the convolution theorem of Lin-Chung-Han (LCH) transform. It demonstrates that the corresponding convolutions of LCH transform can be equivalent to cyclic convolutions by preprocessed modulo and polynomial bases conversion. As a result, this paper proposes a fast algorithm for the multiplication of a vector and a circulant matrix. It shows that the algorithm performs very efficient for the encoding of nonbinary quasi-cyclic codes. For an (ne, ke) quasi-cyclic code with circulant size of e, the encoding algorithm needs approximately $frac {1}{4}n(e+1)log _{2}^{2}(e+1)+k(n-k)(e+1)$ multiplications and additions, which is much less than the number $(n-k)ke^{2}$ of traditional encoding algorithm.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133840436","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
New Results on the Wire-tap Channel with Noiseless Feedback 无噪声反馈窃听信道的新结果
2018 IEEE Information Theory Workshop (ITW) Pub Date : 2018-11-01 DOI: 10.1109/ITW.2018.8613479
Bin Dai, Linman Yu, Yuan Luo
{"title":"New Results on the Wire-tap Channel with Noiseless Feedback","authors":"Bin Dai, Linman Yu, Yuan Luo","doi":"10.1109/ITW.2018.8613479","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613479","url":null,"abstract":"The model of wiretap channel (WTC) is important as it constitutes the essence of physical layer security (PLS). Wiretap channel with noiseless feedback $(WTC-NFx)$ is especially interesting as it shows what can be done when a private feedback is available. The already existing secret key based feedback coding scheme focuses on generating key from the feedback and using this key to protect part of the transmitted message. It has been shown that this secret key based feedback coding scheme is only optimal for the degraded WTC-NF, and finding an optimal feedback scheme for the general WTC-NF motivates us to exploit other uses of the feedback. In this paper, a new feedback coding scheme for the general WTC-NF is proposed, where the feedback is not only used to generate key, but also used to generate help information which helps the legitimate parties to improve the communication between them. We show that the proposed new feedback scheme performs better than the already existing one, and a binary example is given to further explain the results of this paper.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116314655","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学术官方微信
小红书