{"title":"The expected write deficiency of index-less flash codes and their improvement","authors":"Y. Kaji","doi":"10.1109/ITW.2011.6089479","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089479","url":null,"abstract":"The expected write deficiency of the index-less indexed flash codes (ILIFC) is studied, and a technique is developed to improve the write deficiency of ILIFC. ILIFC is a coding scheme for flash memory, and consists of two stages with different coding techniques. This study first clarify the average write deficiency of the first stage of ILIFC, and shows that omitting the second stage of ILIFC can be a practical option for realizing flash codes with good average performance. The study also investigates an improvement of the index-less coding which is used in the first stage of ILIFC. The improvement reduces the write deficiency of ILIFC, and relaxes the constraints on the rate of the code.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207868","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":"Quantum turbo codes with unbounded minimum distance and excellent error-reducing performance","authors":"Mamdouh Abbara, J. Tillich","doi":"10.1109/ITW.2011.6089430","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089430","url":null,"abstract":"We construct here a new family of quantum codes related to serial turbo-codes which are excellent error-reducing codes under iterative decoding for very large channel noise values. Moreover we also show that this family of codes has unbounded minimum distance.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122521355","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}
D. G. Silva, R. Attux, Everton Z. Nadalin, L. Duarte, R. Suyama
{"title":"An immune-inspired information-theoretic approach to the problem of ICA over a Galois field","authors":"D. G. Silva, R. Attux, Everton Z. Nadalin, L. Duarte, R. Suyama","doi":"10.1109/ITW.2011.6089571","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089571","url":null,"abstract":"The problem of independent component analysis (ICA) was firstly formulated and studied in the context of real-valued signals and mixing models, but, recently, an extension of this original formulation was proposed to deal with the problem within the framework of finite fields. In this work, we propose a strategy to deal with ICA over these fields that presents two novel features: (i) it is based on the use of a cost function built directly from an estimate of the mutual information and (ii) it employs an artificial immune system to perform the search for efficient separating matrices, in contrast with the existing techniques, which are based on search schemes of an exhaustive character. The new proposal is subject to a comparative analysis based on different simulation scenarios and the work is concluded by an analysis of perspectives of practical application to digital and genomic data mining.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127036151","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":"Quantum search algorithms on hierarchical networks","authors":"F. Marquezino, R. Portugal, S. Boettcher","doi":"10.1109/ITW.2011.6089429","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089429","url":null,"abstract":"The “abstract search algorithm” is a well known quantum method to find a marked vertex in a graph. It has been applied with success to searching algorithms for the hypercube and the two-dimensional grid. In this work we provide an example for which that method fails to provide the best algorithm in terms of time complexity. We analyze search algorithms in degree-3 hierarchical networks using quantum walks driven by non-groverian coins. Our conclusions are based on numerical simulations, but the hierarchical structures of the graphs seems to allow analytical results.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130636802","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":"Iterative soft decoding of binary linear codes using a generalized Tanner graph","authors":"E. Rosnes","doi":"10.1109/ITW.2011.6089431","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089431","url":null,"abstract":"In this work, we consider iterative soft-decision decoding of binary linear codes using a generalized Tanner graph. A generalized Tanner graph is constructed from the code's Tanner graph representation under the objective of mitigating the effect of small cycles. Then, iterative decoding is applied to the generalized Tanner graph using trellis-based soft-input soft-output decoding in the generalized check nodes. When combined with the stochastic shifting algorithm of Jiang and Narayanan (IEEE Commun. Letters, 2004), the proposed decoding method provides both improved error rate performance and reduced average decoding complexity, without increasing the worst-case decoding complexity.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123815977","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":"XOR's, lower bounds and MDS codes for storage","authors":"J. Plank","doi":"10.1109/ITW.2011.6089512","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089512","url":null,"abstract":"MDS erasure codes are ubiquitous in storage systems that must tolerate failures. While classic Reed-Solomon codes can provide a general-purpose MDS code for any situation, systems that require high performance rely on special-purpose codes that employ the bitwise exclusive-or (XOR) operation, and may be expressed in terms of a binary generator matrix. There are known lower bounds on the density of the generator matrix; however the number of XOR operations required to encode the generator matrix, while related to the density of the matrix, has not been explored. This paper presents a stunning and counter-intuitive result — that the encoding of k message symbols in an MDS code may require fewer than k-1 XOR operations per coding symbol. The result brings into question the lower bounds on the performance of encoding and decoding MDS erasure codes.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"5 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120828057","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}
R. Subramanian, I. Land, B. Vellambi, L. Rasmussen
{"title":"Error propagation and the achievable throughput-delay trade-off in wireless networks","authors":"R. Subramanian, I. Land, B. Vellambi, L. Rasmussen","doi":"10.1109/ITW.2011.6089523","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089523","url":null,"abstract":"New results on the achievable trade-off between the per-node throughput T(n) and the average delay D(n) in a static wireless network of n nodes are presented for physical link models. For links modeled by channels with additive white Gaussian noise with power-law attenuation, a trade-off of only D(n) = ⊖ (n (log n) T(n)) is guaranteed for T(n) = ⊖(n−½). This follows from showing that there is significant information loss in the network due to error propagation, unless the length of the channel code employed is sufficiently high. Constraining the block length to be bounded yields worse trade-offs: only ⊖(n (log n)2 T(n)) is guaranteed for optimal throughput, provided there is rich fading diversity.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125468386","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":"Embedding information flows into renewal traffic","authors":"S. Maranò, V. Matta, T. He, L. Tong","doi":"10.1109/ITW.2011.6089514","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089514","url":null,"abstract":"The secure networking problem of embedding information flows into cover traffic is addressed. When relayed packets must obey a causal delay constraint, this naturally remaps to a matching problem between point processes (here taken as arbitrary renewal processes). The best hiding policy is thus characterized in terms of the maximum fraction of matched points, which is accordingly referred to as embedding capacity. For a broad range of renewal models encountered in practice, we provide a simple analytical formula for the capacity, which depends only on the renewal function of the underlying processes, and further find conditions for capacity-ordering of different types of cover traffic. The results are also tested on real network traces, and a very good match is observed, especially for tight delay constraints.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125729807","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":"MacWilliams-type identity in poset-block spaces","authors":"Jerry Anderson Pinheiro, Marcelo Firer","doi":"10.1109/ITW.2011.6089509","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089509","url":null,"abstract":"In this work we prove that a poset-block space admits a MacWilliams-type identity if and only if the poset is hierarchical and at any level of the poset, all the blocks have the same dimension.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115941725","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":"Continuous-time directed information and its role in communication","authors":"H. Permuter, Young-Han Kim, T. Weissman","doi":"10.1109/ITW.2011.6089374","DOIUrl":"https://doi.org/10.1109/ITW.2011.6089374","url":null,"abstract":"The notion of directed information was recently introduced for stochastic processes in continuous time. The key idea of the definition is to consider all possible time partitions of a given interval. Unlike the definition of mutual information of discrete-time random variables with continuous alphabets where the supremum over all possible partitions of the alphabets plays an important role, here the infimum over all possible time-partition plays an important role. We show that the fundamental limit on reliable communication for a wide class of continuous-time channels with feedback are characterized using the notion of continuous-time directed information.","PeriodicalId":167217,"journal":{"name":"2011 IEEE Information Theory Workshop","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132122295","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}