{"title":"CROMqs: an infinitesimal successive refinement lossy compressor for the quality scores.","authors":"I Ochoa, A No, M Hernaez, T Weissman","doi":"10.1109/ITW.2016.7606808","DOIUrl":"https://doi.org/10.1109/ITW.2016.7606808","url":null,"abstract":"<p><p>Massive amounts of sequencing data are being generated thanks to advances in sequencing technology and a dramatic drop in the sequencing cost. Much of the data are comprised of nucleotides and the corresponding quality scores that indicate their reliability. The latter are more difficult to compress and are themselves noisy. As a result, lossy compression of the quality scores has recently been proposed to alleviate the storage costs. Further, it has been shown that lossy compression, at some specific rates, can achieve a performance on variant calling similar to that achieved with the lossless compressed data. We propose CROMqs, a new lossy compressor for the quality scores with the property of \"infinitesimal successive refinability\". This property allows the decoder to decompress the data iteratively without the need of agreeing with the encoder on a specific rate prior to compression. This characteristic is particularly amenable in practice, as in most cases the appropriate rate at which the lossy compressor should operate can not be established prior to compression. Further, this property can be of interest in scenarios involving streaming of genomic data. CROMqs is the first infinitesimal successive refinement lossy compressor for the quality scores in the literature, and we show that it obtains a comparable rate-distortion performance to previously proposed algorithms. Moreover, we also show that CROMqs achieves a comparable performance on variant calling to that of the lossless compressed data.</p>","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"2016 ","pages":"121-125"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ITW.2016.7606808","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36135815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of Contention-based relay selection mechanisms in autonomous multi-hop networks","authors":"C. Lima, G. Abreu","doi":"10.1109/ITWNIT.2009.5158568","DOIUrl":"https://doi.org/10.1109/ITWNIT.2009.5158568","url":null,"abstract":"A fundamental question of interest in multi-hop networks is whether routing should be done in a smaller number of longer hops, or larger number of shorter hops. However, underneath these aspects of the routing problem itself is the number of contending nodes involved in the relay selection taking place at each hop so as to realize whichever routing strategy adopted. A larger number of nodes increases the likelihood of finding an adequate relay, whereas increasing the selection overhead, and vice-versa. In this article we investigate both the expected cost (in time consumed) incurred by the relay selection strategy, and the effectiveness of the forwarding strategy (in spatial advancements) as a function of the number of the contending nodes, when using Contention-based Geographic Forwarding (CGF) strategies to relay packets in multi-hop scenarios. In particular, Probability Generating Functions (PGFs) are utilized to compute the distribution of Contention Resolution Intervals (CRIs) and quantify overhead, while stochastic geometry is utilized to model topological aspects of the network and quantify expected progress. Both a totally random and an auction-based Relay Selection Algorithms (RSAs) are studied and compared, with the advantages of the auction-based approach established analytically. From an overhead point of view, the selection of the furthest and the nearest relays are equivalent, but our results indicate that the long-hop routing approach is less sensitive to the number of contending nodes than the short-hop alternative.","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"191 10 1","pages":"186-190"},"PeriodicalIF":0.0,"publicationDate":"2009-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79773399","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}
Laura Luzzi, G. R. Othman, J. Belfiore, E. Viterbo
{"title":"Golden space-time block coded modulation","authors":"Laura Luzzi, G. R. Othman, J. Belfiore, E. Viterbo","doi":"10.1109/ITW.2008.4578627","DOIUrl":"https://doi.org/10.1109/ITW.2008.4578627","url":null,"abstract":"We consider a block coded modulation scheme for a 2 times 2 MIMO system over slow fading channels, where the inner code is the Golden Code. The scheme is based on a set partitioning of the Golden Code using two-sided ideals. A lower bound for the minimum determinant is given by the minimum Hamming distance. Performance simulations show that our GCRS schemes achieve a significant gain over the uncoded Golden Code.","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"76 1","pages":"86-90"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88010599","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":"Optimal state estimation for discrete-time Markovian Jump Linear Systems, in the presence of delayed output observations","authors":"I. Matei, N. C. Martins, J. Baras","doi":"10.1109/ITW.2008.4578658","DOIUrl":"https://doi.org/10.1109/ITW.2008.4578658","url":null,"abstract":"In this paper, we investigate the design of optimal state estimators for Markovian jump linear systems. We consider that the state has two components: the first component is finite valued and is denoted as mode, while the second (continuous) component is in a finite dimensional Euclidean space. The continuous state is driven by a zero mean, white and Gaussian process noise. The observation output has two components: the first is the mode and the second is a linear combination of the continuous state observed and zero mean, white Gaussian noise. Both output components are affected by delays, not necessarily equal. Our paradigm is to design optimal estimators for the current state, given the current output observation. We provide a solution to this paradigm by giving a recursive estimator for the continuous state, in the minimum mean square sense, and a finitely parameterized recursive scheme for computing the probability mass function of the current mode conditioned on the observed output. We show that when the mode is observed with a greater delay then the continuous output component, the optimal estimator nonlinear in the observed outputs.","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"39 1","pages":"237-242"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74093993","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":"Random series in Lp(X, Σ , μ ) using Unconditional Basic Sequences: A result on almost sure almost everywhere convergence","authors":"J. M. Medina, B. Cernuschi-Frías","doi":"10.1109/ITW.2006.1633842","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633842","url":null,"abstract":"This paper studies the almost sure almost every where convergence of random series of the form Sigmai=1 infin aifi Lebesgue spaces LP(X, Sigma, mu), where the ai's are centered random variables, and the fi's constitute an unconditional basic sequence.","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"42 4 1","pages":"342-344"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80091001","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 Channels with Rate-Limited Side Information at the Decoder","authors":"Y. Steinberg","doi":"10.1109/ITW.2006.1633771","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633771","url":null,"abstract":"In this work coding for channel with partial state information at the decoder is studied. Specifically, the model under consideration assumes that the encoder is provided with full channel state information in a non causal manner, and the decoder is provided with partial state knowledge, quantified by a rate-limit. Coding of side information intended for the channel decoder is a Wyner-Ziv like problem, since the channel output depends statistically on the state, thus serving as side information in retrieving the encoded state. Therefore, coding for such a channel involves the simultaneous solution of a Wyner-Ziv problem and a related Gel'fand-Pinsker problem. A single letter characterization of the capacity of this channel is developed, that involves two rate constraints, in the form of Wyner-Ziv and Gel'fand-Pinsker formulas. Applications to watermarking problems are suggested.","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"35 1","pages":"11-13"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80529747","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":"On the Behavior of the Distance Spectrum of Convolutional Codes under a Minimal Trellis Complexity Measure","authors":"B. Filho, R. Souza, C. Pimentel","doi":"10.1109/ITW.2006.1633830","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633830","url":null,"abstract":"In this paper, we investigate the behavior of the distance spectrum of convolutional codes when the decoding complexity is measured by the total number of edge symbols per information bit in the minimal trellis module representing the code. We conduct a code search restricted to the recently introduced class of generalized punctured convolutional codes, which is broad enough to contain good codes and yet has structural properties that facilitate the code search. New good convolutional codes are tabulated. For the same decoding complexity and the same code rate, the new codes have slightly better distance spectrum than the best known punctured convolutional codes. When compared to the best known unit-memory convolutional codes of the same rate, the new codes typically have improved free distance for a given decoding complexity, or about the same distance spectrum is achieved with much lower decoding complexity. Under this decoding complexity measure, the behaviour that higher decoding complexity implies better distance spectrum remains valid.","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"2 1","pages":"283-287"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87952659","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":"Information and Complexity in Statistical Modeling","authors":"J. Rissanen","doi":"10.1109/ITW.2006.1633845","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633845","url":null,"abstract":"Summary form only. Inspired by Kolmogorov's structure function for finite sets as models of data in the algorithmic theory of information we adapt the construct to families of probability models to avoid the noncomputability problem. The picture of modeling looks then as follows: The models in the family have a double index, where the first specifies a structure, ranging over a finite or a countable set, and the second consists of parameter values, ranging over a continuum. An optimal structure index can be determined by the MDL (Minimum Description Length) principle in a two-part code, where the sum of the code lengths for the structure and the data is minimized. The latter is obtained from the universal NML (Normalized Maximum Likelihood) model for the subfamily of models having a specified structure. The determination of the optimal model in the optimized structure is more difficult. It requires a partition of the parameter space into equivalence classes, each associated with a model, in such a way that the Kullback-Leibler distance between any two adjacent models is equal and that the models are optimally distinguishable from the given amount of data. This notion of distinguishability is a modification of a related idea of Balasubramanian. The particular model, specified by the observed data, is the simplest one that incorporates all the properties in the data that can be extracted with the model class considered.","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"37 1","pages":"351"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81449495","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":"On Context - Tree Prediction of Individual Sequences","authors":"J. Ziv, N. Merhav","doi":"10.1109/ITW.2006.1633818","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633818","url":null,"abstract":"Motivated by the evident success of context-tree based methods in lossless data compression, we explore, in this paper, methods of the same spirit in universal prediction of individual sequences. By context-tree prediction, we refer to a family of prediction schemes, where at each time instant t, after having observed all outcomes of the data sequence x1,...,xt-1, but not yet xt, the prediction is based on a \"context\" (or a state) that consists of the k most recent past outcomes xt-k,...,xt-1, where the choice of k may depend on the contents of a possibly longer, though limited, portion of the observed past, xt-k(max),...,xt-1. This is different from the study reported in Feder et al. (1992), where general finite-state predictors as well as \"Markov\" (finite-memory) predictors of fixed order, where studied in the regime of individual sequences. Another important difference between this study and Feder et al. is the asymptotic regime. While in Feder et al., the resources of the predictor (i.e., the number of states or the memory size) were kept fixed regardless of the length N of the data sequence, here we investigate situations where the number of contexts, or states, is allowed to grow concurrently with N. We are primarily interested in the following fundamental question: What is the critical growth rate of the number of contexts, below which the performance of the best context-tree predictor is still universally achievable, but above which it is not? We show that this critical growth rate is linear in N. In particular, we propose a universal context-tree algorithm that essentially achieves optimum performance as long as the growth rate is sublinear, and show that, on the other hand, this is impossible in the linear case.","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"9 8","pages":"232-236"},"PeriodicalIF":0.0,"publicationDate":"2005-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ITW.2006.1633818","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72471082","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":"Bounds on signature coding for fast frequency hopping with asynchronous access","authors":"Sándor Györi","doi":"10.1109/ITW.2005.1531857","DOIUrl":"https://doi.org/10.1109/ITW.2005.1531857","url":null,"abstract":"","PeriodicalId":92433,"journal":{"name":"Proceedings. Information Theory Workshop","volume":"8 1","pages":"63-67"},"PeriodicalIF":0.0,"publicationDate":"2005-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75176003","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}