International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications最新文献_第7页

Shortening Array Codes and the Perfect 1-Factorization Conjecture 缩短数组码与完善的1-因数分解猜想

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261572

V. Bohossian, Jehoshua Bruck

引用次数: 5

New Sets of Optimal p-ary Low Correlation Zone Sequences 新一组最优p元低相关带序列

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261605

Jiwoong Jang, Jung-Soo Chung, Jong-Seon No, Habong Chung

引用次数: 16

Which Codes Have 4-Cycle-Free Tanner Graphs? 哪些代码有无4循环的坦纳图?

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261717

T. Halford, K. Chugg, A. Grant

引用次数: 3

Beyond genomics: Detecting codes and signals in the cellular transcriptome [Plenary speakers] 超越基因组学:检测细胞转录组中的代码和信号[全体会议发言]

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261583

B. Frey

{"title":"Beyond genomics: Detecting codes and signals in the cellular transcriptome [Plenary speakers]","authors":"B. Frey","doi":"10.1109/ISIT.2006.261583","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261583","url":null,"abstract":"Summary form only given, as follows. Construction of the discrete genome sequence was the fi rst step in developing a comprehensive understanding of how cellular processes are controlled by bio-molecules and their interactions. That step is now mostly complete and the next step is to determine how DNA subsequences encode instructions for producing RNA transcripts and how continuous abundances of transcripts in cells combine to control activities. This is a much more challenging task than genome assembly, because the encoding of genetic instructions turns out to be far richer than was previously thought, and the detection and analysis of continuous cellular signals is more diffi cult than discrete symbol detection. Only preliminary progress has been made in assembling and analyzing the 'transcriptome' and the fi rst genome-wide data sets enabling the study of transcripts and their interactions have only recently been published. In this talk, I'll describe several open research problems in this area and discuss how they can be approached using representations and algorithms familiar to researchers in the information theory community.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":"16 1","pages":"x"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73776697","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

Achieving the Gaussian Rate-Distortion Function by Prediction 通过预测实现高斯率失真函数

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261724

R. Zamir, Y. Kochman, U. Erez

引用次数: 77

Low Density Lattice Codes 低密度点阵码

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261680

N. Sommer, M. Feder, O. Shalvi

引用次数: 187

Cross-layer Optimization for LDPC-coded Multi-rate Multiuser Systems with QoS Constraints 具有QoS约束的ldpc编码多速率多用户系统的跨层优化

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261665

Kai Li, Xiaodong Wang

引用次数: 0

Guessing Facets: Polytope Structure and Improved LP Decoding 猜测面:多面体结构和改进的LP解码

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.262070

A. Dimakis, A. Gohari, M. Wainwright

{"title":"Guessing Facets: Polytope Structure and Improved LP Decoding","authors":"A. Dimakis, A. Gohari, M. Wainwright","doi":"10.1109/ISIT.2006.262070","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262070","url":null,"abstract":"A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investigate the structure of the polytope used in the LP relaxation decoding. We begin by showing that for expander codes, every fractional pseudocodeword always has at least a constant fraction of non-integral bits. We then prove that for expander codes, the active set of any fractional pseudocodeword is smaller by a constant fraction than the active set of any codeword. We exploit this fact to devise a decoding algorithm that provably outperforms the LP decoder for finite blocklengths. It proceeds by guessing facets of the polytope, and resolving the linear program on these facets. While the LP decoder succeeds only if the ML codeword has the highest likelihood over all pseudocodewords, we prove that for expander codes the proposed algorithm succeeds even with a constant number of pseudocodewords of higher likelihood. Moreover, the complexity of the proposed algorithm is only a constant factor larger than that of the LP decoder.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":"36 1","pages":"1369-1373"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75176361","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}

引用次数: 45

The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels 二维行程长度受限通道的正容量区

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.262111

K. Censor-Hillel, T. Etzion

{"title":"The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels","authors":"K. Censor-Hillel, T. Etzion","doi":"10.1109/ISIT.2006.262111","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262111","url":null,"abstract":"A binary sequence satisfies a one-dimensional (d, k) constraint if every run of zeroes has length at least d and at most k. A binary two-dimensional array satisfies a (d, k) constraint if every run of zeroes, in each one of the array directions, has length at least d and at most k. Few models have been proposed in the literature to handle two dimensional data: the diamond model, the square model, the hexagonal model, and the triangular model. The constraints in the different directions might be asymmetric and hence many kind of constraints are defined depending on the number of directions in the model. For example, a two-dimensional array in the diamond model satisfies a (d1, k1, d2, k2) constraint if it satisfies the one-dimensional (d1, k1) constraint horizontally and the one-dimensional (d2, k2) constraint vertically. In this paper we examine the region in which the capacity of the constraints is zero or positive in the various models. We consider asymmetric constraints in the diamond model and symmetric constraints in the other models. In particular we provide an almost complete solution for asymmetric constraints in the diamond model.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":"60 1","pages":"1467-1471"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83293390","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}

引用次数: 4

The Capacity of the Single Source Multiple Relay Single Destination Mesh Network 单源多中继单目的网状网络的容量

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2006-05-21 DOI: 10.1109/ISIT.2006.261639

L. Ong, M. Motani

引用次数: 24