{"title":"Universal Polar Coding for Asymmetric Channels","authors":"Karthik Nagarjuna, P. Siegel","doi":"10.1109/ITW.2018.8613458","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613458","url":null,"abstract":"We present a universal coding scheme, based on polar codes, that can achieve the compound capacity of any finite set of binary-input asymmetric channels. The scheme is a hybrid combination of Honda and Yamamoto’s polar coding scheme for asymmetric channels and a universal polar coding scheme for symmetric channels proposed by Hassani and Urbanke. In the proposed universal construction for the asymmetric setting, we exploit the staircase structure in the universal scheme for symmetric channels to define a coding strategy that requires neither storage-intensive shared boolean functions nor a side-channel between encoder and decoder in order to transmit bits corresponding to bit-channels that are not completely polarized.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"12 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":"126176593","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}
{"title":"A New Kind of Nonbinary Uniquely Decodable Codes with Arbitrary Code Length for Multiple-Access Adder Channel","authors":"Shan Lu, Wei Hou, Jun Cheng, H. Kamabe","doi":"10.1109/ITW.2018.8613495","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613495","url":null,"abstract":"A kind of multiuser k-ary codes for the multiple-access adder channel is proposed. Given any $T^{f}$-user and $T^{g}$-user k-ary uniquely decodable (UD) codes with code lengths f and g, respectively, a $(T^{f},+T^{g},+1)$-user k-ary UD code with code length $f+g$ is obtained. The proposed scheme has no restriction on the code structure, e.g., affine, and can be constructed from any arbitrary two UD codes. Moreover, a recursive construction of a kind of k-ary UD codes with arbitrary code length is given. The proposed codes have the higher code rate and the shorter code length than those of the previous codes for a fixed number of users.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"1051 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":"123276908","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}
{"title":"Capacity-achieving sparse regression codes via spatial coupling","authors":"Cynthia Rush, Kuan Hsieh, R. Venkataramanan","doi":"10.1109/ITW.2018.8613392","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613392","url":null,"abstract":"Sparse regression codes (SPARCs) are a recent coding technique for the AWGN channel where the codewords are linear combinations of columns of a design matrix. In a spatially coupled sparse regression code (SC-SPARC), the design matrix has a block-wise band-diagonal structure. SC-SPARCs can be decoded using an efficient Approximate Message Passing (AMP) decoder, whose performance can be predicted using a recursion known as state evolution. In this work, we obtain non-asymptotic bounds for the state evolution parameters. These bounds are used to describe the decoding progression in terms of the code parameters and the gap from capacity.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"150 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":"126649232","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}
{"title":"Coding Theorem for Systematic LDGM Codes Under List Decoding","authors":"Wenchao Lin, Suihua Cai, Baodian Wei, Xiao Ma","doi":"10.1109/ITW.2018.8613510","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613510","url":null,"abstract":"This paper is concerned with three ensembles of systematic low density generator matrix (LDGM) codes, all of which were provably capacity-achieving in terms of bit error rate (BER). This, however, does not necessarily imply that they achieve the capacity in terms of frame error rate (FER), as seen from a counterexample constructed in this paper. We then show that the first and second ensembles are capacity-achieving under list decoding over binary-input output symmetric (BIOS) memoryless channels. We point out that, in principle, the equivocation due to list decoding can be removed with negligible rate loss by the use of the concatenated codes. Simulation results show that the considered convolutional (spatially-coupled) LDGM code is capacity-approaching with an iterative belief propagation decoding algorithm.","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":"114746567","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}
{"title":"RT-Polar: An HARQ Scheme with Universally Competitive Rates","authors":"S. Banerjee, Himanshu Tyagi","doi":"10.1109/ITW.2018.8613460","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613460","url":null,"abstract":"We present a construction for a universal channel code with feedback using Polar Codes. Our construction includes an error detection mechanism that is used to compute the ACK/NACK feedback directly from the received vector, without a higher layer CRC. Our scheme, termed the Repeat-Top Polar Code (RT-Polar), builds on a rate-compatible Polar Code and retransmits the t message bits sent over the most reliable polarized good channels over the least reliable good channels. At the decoder, these two t-bit strings are decoded and compared to detect an error. Through simulations, we illustrate the universal performance of our scheme for a binary symmetric channel with an unknown flipover probability. Our scheme performs comparably with a genie-aided scheme, where the detection mechanism is assumed to be error-free, for practically relevant message lengths of roughly 512 bits; this is the first instance of such a universal performance reported in literature. The proposed scheme is suitable for use as a HARQ in low-latency communication where including a higher-layer CRC will induce computational delays.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"67 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":"133178609","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}
{"title":"A New One-Coincidence Frequency-Hopping Sequence Set of Length p2 - p","authors":"Tae-Hwan Lee, Hee-Heon Jung, Jin-Ho Chung","doi":"10.1109/ITW.2018.8613534","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613534","url":null,"abstract":"Frequency-hopping sequences (FHSs) are widely use in recent applications such as Bluetoorh, Wi-Fi, and so on. A one-coincidence frequency-hopping sequence (OC-FHS) set consists of FHSs with maximum Hamming autocorrelation 0 and maximum Hamming cross-correlation 1. In this paper, we present a new OC-FHS set of length $p^{2}-p$ over $mathbb {Z}_{p^{2}}$, where p is an odd prime. The new OC-FHS set is constructed by using a primitive element of $mathbb {Z}_{p}.$","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"79 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":"115743593","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}
{"title":"The ϵ-error Capacity of Symmetric PIR with Byzantine Adversaries","authors":"Qiwen Wang, Hua Sun, M. Skoglund","doi":"10.1109/ITW.2018.8613332","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613332","url":null,"abstract":"capacity of symmetric private information retrieval with K messages, N servers (out of which any T may collude), and an omniscient Byzantine adversary (who can corrupt any B answers) is shown to be $1- frac{T+2B}{N} [1]$, under the requirement of zero probability of error. In this work, we show that by weakening the adversary slightly (either providing secret low rate channels between the servers and the user, or limiting the observation of the adversary), and allowing vanishing probability of error, the capacity increases to $1- frac{T+B}{N}$.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"11 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":"124296709","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}
Alankrita Bhatt, Jiun-Ting Huang, Young-Han Kim, J. Ryu, P. Sen
{"title":"Variations on a Theme by Liu, Cuff, and Verdú: The Power of Posterior Sampling","authors":"Alankrita Bhatt, Jiun-Ting Huang, Young-Han Kim, J. Ryu, P. Sen","doi":"10.1109/ITW.2018.8613436","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613436","url":null,"abstract":"The Liu-Cuff-Verdú lemma states that in estimating a source $X$ from an observation $Y$, making a random guess $X'$ from the posterior $p(x|y)$ can go wrong at most twice as often as the optimal answer. Several variations of this fundamental, yet rather arcane, result are explored for detection, decoding, and estimation problems.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"26 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":"117090547","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}
Y. M. Chee, Ryan Gabrys, A. Vardy, Van Khu Vu, Eitan Yaakobi
{"title":"Reconstruction from Deletions in Racetrack Memories","authors":"Y. M. Chee, Ryan Gabrys, A. Vardy, Van Khu Vu, Eitan Yaakobi","doi":"10.1109/ITW.2018.8613352","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613352","url":null,"abstract":"In this work, we study a special case of the reconstruction problem in order to combat position errors in racetrack memories. In these memories, the information is stored in magnetic cells that can be sensed by shifting them under read heads. However, since this shifting operation is not error free, recent work has been dedicated towards correcting these so-called position errors, which manifest themselves as deletions and sticky insertions. A deletion is the event where the cells are over-shifted, and a sticky insertion occurs when the cells are not shifted.We first present a code construction that uses two heads to correct two deletions with at most $log_{2}(log_{2}n) +4$ redundant bits. This result improves upon a recent one that requires roughly $log_{2}n$ redundant bits. We then extend this construction to correct d deletions using d heads with at most $log_{2}$(log2 n) $+c$ redundant bits. Lastly, we extend our results and derive codes for the classical reconstruction problem by Levenshtein over the insertion/deletion channel.","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":"128671328","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}
{"title":"Coding for Private and Secure Multiparty Computing","authors":"Qian Yu, Netanel Raviv, A. Avestimehr","doi":"10.1109/ITW.2018.8613443","DOIUrl":"https://doi.org/10.1109/ITW.2018.8613443","url":null,"abstract":"We consider the problem of secure and private multiparty computation (MPC), in which the goal is to compute a general polynomial function distributedly over several workers, while keeping them oblivious to the content of the dataset, and preventing them from maliciously affecting the computation result. We demonstrate the role of Lagrange Coded Computing (LCC), a recently proposed coded computing technique that can be applied to general polynomial computations, on enabling secure and private MPC. We show that LCC offers both private and secure computation simultaneously, and is universal in the sense that all polynomials up to a certain degree can be computed on the same encoding. We also demonstrate that LCC achieves an optimal tradeoff between privacy and security, and requires a minimal amount of added randomness for privacy. Compared to prevalent algorithms in MPC (in particular the celebrated BGW scheme), we show that LCC significantly improves the storage, communication, and secret-sharing overhead needed for MPC.","PeriodicalId":288696,"journal":{"name":"2018 IEEE Information Theory Workshop (ITW)","volume":"17 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":"130032649","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}