2006 IEEE Information Theory Workshop - ITW '06 Punta del Este最新文献_第3页

On optimal weight assignmnents for multivariate interpolation list-decoding 多元插值列表解码的最优权值分配

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633777

R. Koetter

引用次数: 7

Using Many Machines to Handle an Enormous Error-Correcting Code 使用多台机器处理大量纠错代码

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633806

J. Feldman

引用次数: 5

Network Coding in Minimal Multicast Networks 最小组播网络中的网络编码

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633835

S. Rouayheb, C. Georghiades, A. Sprintson

{"title":"Network Coding in Minimal Multicast Networks","authors":"S. Rouayheb, C. Georghiades, A. Sprintson","doi":"10.1109/ITW.2006.1633835","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633835","url":null,"abstract":"We investigate the network coding problem in a certain class of minimal multicast networks. In a multicast coding network, a source S needs to deliver h symbols, or packets, to a set of destinations T over an underlying communication network modeled by a graph G. A coding network is said to be h-minimal if it can deliver h symbols from S to the destination nodes, while any proper subnetwork of G can deliver at most h — 1 symbols to the set of destination nodes. This problem is motivated by the requirement to minimize the amount of network resources allocated for a multicast connections. We show that surprisingly, minimal multicast networks have unique properties that distinguish them from the general case of multicast networks. In particular, we show that it is possible to determine whether a 2-minimal network has a routing solution (i.e., a solution without encoding nodes) in polynomial time, while this problem is NP-hard in general. In addition, we show that if a 2-minimal network is planar, then the minimum size of the required field for linear network codes is at most 3. Also, we investigate several structural properties of 2-minimal networks and generalize our results for h > 2.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133403640","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}

引用次数: 11

Another diametric theorem in Hamming spaces: optimal group anticodes 汉明空间的另一个直径定理:最优群反码

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633814

R. Ahlswede

引用次数: 3

Novel Unitary Space-Time Signal Design 新颖的统一时空信号设计

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633839

David B. Smith, L. Hanlen

引用次数: 2

On opportunistic codes and broadcast codes with degraded message sets 基于降级消息集的机会码和广播码

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633817

S. Diggavi, David Tse

引用次数: 32

Entropy Estimation: Simulation, Theory and a Case Study 熵估计:模拟、理论与个案研究

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633823

Ioannis Kontoyiannis

{"title":"Entropy Estimation: Simulation, Theory and a Case Study","authors":"Ioannis Kontoyiannis","doi":"10.1109/ITW.2006.1633823","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633823","url":null,"abstract":"We consider the statistical problem of estimating the entropy of finite-alphabet data generated from an unknown stationary process. We examine a series of estimators, including: (1) The standard maximum-likelihood or \"plug-in\" estimator; (2) Four different estimators based on the family of Lempel-Ziv compression algorithms; (3) A different plug-in estimator especially tailored to renewal processes; and (4) The natural estimator derived from the Context-Tree Weighting method (CTW). Some of these estimators are well-known, and some are new. We first summarize numerous theoretical properties of these estimators: Conditions for consistency, estimates of their bias and variance, methods for approximating the estimation error and for obtaining confidence intervals. Several new theoretical results are developed. We show how the theory offers preliminary indications results offer guidelines for tuning the parameters involved in the estimation process. Then we present an extensive simulation study on various types of synthetic data and under various conditions. We compare their performance and comment on the strengths and weaknesses of the various methods. For each estimator, we develop a precise method for calculating the estimation error based on any specific data set. Finally we report the performance of these entropy estimators on the (binary) spike trains of 28 neurons recorded simultaneously for a one-hour period from the primary motor and dorsal premotor cortices of a quietly seated monkey not engaged in a task behavior. Based on joint work with Yun Gao and Elie Bienenstock.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"26 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129214267","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}

引用次数: 1

Reliable Communication over an Optical Fading Channel 光衰落信道上的可靠通信

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633770

Kaushik Chakraborty, P. Narayan

引用次数: 3

Theoretical and Experimental Results on Modeling Low Probabilities 低概率建模的理论和实验结果

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633820

A. Orlitsky, N. Santhanam, K. Viswanathan, Junan Zhang

引用次数: 1

A Promenade through the New Cryptography of Bilinear Pairings 双线性对新密码学研究进展

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633773

Xavier Boyen

引用次数: 13