Farzad Farnoud, Chien-Yu Chen, O. Milenkovic, N. Kashyap
{"title":"A graphical model for computing the minimum cost transposition distance","authors":"Farzad Farnoud, Chien-Yu Chen, O. Milenkovic, N. Kashyap","doi":"10.1109/CIG.2010.5592890","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592890","url":null,"abstract":"We address the problem of finding the minimum decomposition of a permutation in terms of transpositions with non-uniform cost. For metric-path costs, we describe exact polynomial-time decomposition algorithms. For extended-metric-path cost functions, we describe polynomial-time constant-approximation decomposition algorithms. Our algorithms rely on graphical representations of permutations and graph-search techniques for minimizing the permutation decomposition cost. The presented algorithms have applications in information theory, bioinformatics, and algebra.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115764923","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 against myopic adversaries","authors":"A. Sarwate","doi":"10.1109/CIG.2010.5592896","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592896","url":null,"abstract":"A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126650953","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":"Gaussian diamond network with adversarial jammer","authors":"S. Mohajer, S. Diggavi","doi":"10.1109/CIG.2010.5592650","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592650","url":null,"abstract":"In this paper we consider communication from a source to a destination over a wireless network with the help of a set of authenticated relays. We focus on a special “diamond” network, where there is no direct link between the source and the destination; however the relay nodes help to establish such a communication. There is a single adversarial node which injects signals to disrupt this communication. Like the source, it can only influence the destination through the relays. We develop an approximate characterization of the reliable transmission rate in the presence of such an adversary. This is done by developing an outer bound, and demonstrating an achievable strategy that is within a constant number of bits of the outer bound, regardless of the channel values. A deterministic version of the same problem is solved exactly, yielding insights which are used in the approximate characterization.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128996290","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}
Eitan Yaakobi, S. Kayser, P. Siegel, A. Vardy, J. Wolf
{"title":"Efficient two-write WOM-codes","authors":"Eitan Yaakobi, S. Kayser, P. Siegel, A. Vardy, J. Wolf","doi":"10.1109/CIG.2010.5592956","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592956","url":null,"abstract":"A Write Once Memory (WOM) is a storage medium with binary memory elements, called cells, that can change from the zero state to the one state only once. Examples of WOMs are punch cards, optical disks, and more recently flash memories. A t-write WOM-code is a coding scheme for storing t messages in n cells in such a way that each cell can change its value only from the zero state to the one state. The WOM-rate of a t-write WOM-code is the ratio of the total amount of information written to the WOM in t writes to the number of cells. In this paper we present a family of 2-write WOM-codes. It is shown how to construct from each linear code C a 2-write WOM-code. Then, we find 2-write WOM-codes that improve the best known WOM-rate with two writes. This scheme is proved to be capacity achieving when the parity check matrix of the linear code C is chosen uniformly at random. Finally, we show how to take advantage of 2-write WOM-codes in order to construct codes for the Blackwell channel.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129075642","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 speed of channel polarization","authors":"Toshiyuki TANAKA","doi":"10.1109/CIG.2010.5592869","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592869","url":null,"abstract":"We review some recent progresses in studies on speed of channel polarization. Firstly, results on a coderate-dependent upper bound of block error probability of polar codes with successive cancellation decoding are reviewed. Then an approach of constructing polar codes for non-binary input alphabet with asymptotic speed of polarization much faster than previous approaches is briefly described.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123502942","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":"Constrained codes for phase-change memories","authors":"Anxiao Jiang, Jehoshua Bruck, Hao Li","doi":"10.1109/CIG.2010.5592680","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592680","url":null,"abstract":"Phase-change memories (PCMs) are an important emerging non-volatile memory technology that uses amorphous and crystalline cell states to store data. The cell states are switched using high temperatures. As the semi-stable states of PCM cells are sensitive to temperatures, scaling down cell sizes can bring significant challenges. We consider two potential thermal-based interference problems as the cell density approaches its limit, and study new constrained codes for them.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144765","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 thresholds for robust goodness-of-fit tests","authors":"J. Unnikrishnan, Sean P. Meyn, V. Veeravalli","doi":"10.1109/CIG.2010.5592803","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592803","url":null,"abstract":"Goodness-of-fit tests are statistical procedures used to test the hypothesis H0 that a set of observations were drawn according to some given probability distribution. Decision thresholds used in goodness-of-fit tests are typically set for guaranteeing a target false-alarm probability. In many popular testing procedures results on the weak convergence of the test statistics are used for setting approximate thresholds when exact computation is infeasible. In this work, we study robust procedures for goodness-of-fit where accurate models are not available for the distribution of the observations under hypothesis H0. We develop procedures for setting thresholds in two specific examples — a robust version of the Kolmogorov-Smirnov test for continuous alphabets and a robust version of the Hoeffding test for finite alphabets.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127943236","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 confidence interval of entropy estimation through a noisy channel","authors":"Siu-Wai Ho, T. Chan, A. Grant","doi":"10.1109/CIG.2010.5592695","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592695","url":null,"abstract":"Suppose a stationary memoryless source is observed through a discrete memoryless channel. Determining analytical confidence intervals on the source entropy is known to be a difficult problem, even when the observation channel is noiseless. In this paper, we determine confidence intervals for estimation of source entropy over discrete memoryless channels with invertible transition matrices. A lower bound is given for the minimum number of samples required to guarantee a desired confidence interval. All these results do not require any prior knowledge of the source distribution, other than the alphabet size. When the alphabet size is countably infinite or unknown, we illustrate an inherent difficulty in estimating the source entropy.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130280171","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}
Willie K. Harrison, João Almeida, D. Klinc, S. McLaughlin, J. Barros
{"title":"Stopping sets for physical-layer security","authors":"Willie K. Harrison, João Almeida, D. Klinc, S. McLaughlin, J. Barros","doi":"10.1109/CIG.2010.5592686","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592686","url":null,"abstract":"Physical-layer security based on wiretap codes can be used to complement cryptographic applications at higher layers of the protocol stack. We assume a passive eavesdropper that has access to noise-corrupted codewords with erasures that are statistically independent to those of the legitimate communication partners. Our goal is to minimize the information leaked to the eavesdropper. In this paper we present a low-complexity coding scheme for channels with feedback, which employs extensive interleaving of carefully punctured LDPC codewords. The key idea is to ensure that every transmitted packet is crucial for successful decoding. This is achieved by ensuring that stopping-set bit combinations for coded blocks are distributed among different packets and by enforcing that retransmission requests be restricted to the friendly parties. A probabilistic analysis reveals that an eavesdropper who uses a message-passing decoding algorithm will experience catastrophic decoding failure with high probability. This encoder thus provides physical-layer secrecy which is both independent from, and complementary of, the cryptographic layer. The proposed scheme works even when an eavesdropper has a better channel than the legitimate receiver.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132284061","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 of a noisy function","authors":"François Simon","doi":"10.1109/CIG.2010.5592779","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592779","url":null,"abstract":"This paper presents an extension of the memoryless channel coding theorem to noisy functions, i.e. unreliable computing devices without internal states. It is shown that the concepts of equivocation and capacity can be defined for noisy computations in the simple case of memoryless noisy functions. Capacity is the upper bound of input rates allowing reliable computation, i.e. decodability of noisy outputs into expected outputs. The proposed concepts are generalizations of these known for channels: the capacity of a noisy implementation of a bijective function has the same expression as the capacity of a communication channel. A lemma similar to Feinstein's one is stated and demonstrated. A model of reliable computation of a function thanks to a noisy device is proposed. A coding theorem is stated and demonstrated.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123995342","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}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：