2007 Information Theory and Applications Workshop最新文献_第4页

Finding the best mismatched detector for channel coding and hypothesis testing 寻找最适合信道编码和假设检验的不匹配检测器

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357593

E. Abbe, M. Médard, Sean P. Meyn, Lizhong Zheng

引用次数: 10

Applications of the Golden Code 黄金法则的应用

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357609

E. Viterbo, Y. Hong

引用次数: 8

Universal Noiseless Compression for Noisy Data 噪声数据的通用无噪声压缩

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357603

G. I. Shamir, T. Tjalkens, Frans M. J. Willems

{"title":"Universal Noiseless Compression for Noisy Data","authors":"G. I. Shamir, T. Tjalkens, Frans M. J. Willems","doi":"10.1109/ITA.2007.4357603","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357603","url":null,"abstract":"We study universal compression for discrete data sequences that were corrupted by noise. We show that while, as expected, there exist many cases in which the entropy of these sequences increases from that of the original data, somewhat surprisingly and counter-intuitively, universal coding redundancy of such sequences cannot increase compared to the original data. We derive conditions that guarantee that this redundancy does not decrease asymptotically (in first order) from the original sequence redundancy in the stationary memoryless case. We then provide bounds on the redundancy for coding finite length (large) noisy blocks generated by stationary memoryless sources and corrupted by some specific memoryless channels. Finally, we propose a sequential probability estimation method that can be used to compress binary data corrupted by some noisy channel. While there is much benefit in using this method in compressing short blocks of noise corrupted data, the new method is more general and allows sequential compression of binary sequences for which the probability of a bit is known to be limited within any given interval (not necessarily between 0 and 1). Additionally, this method has many different applications, including, prediction, sequential channel estimation, and others.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129796518","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}

引用次数: 3

The Challenges of Intrusion Detection Compression Technology

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357581

K. Han, J. Kieffer

{"title":"The Challenges of Intrusion Detection Compression Technology","authors":"K. Han, J. Kieffer","doi":"10.1109/ITA.2007.4357581","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357581","url":null,"abstract":"Database management system (DBMS) controls and manages data to eliminate data redundancy and to ensure integrity, consistency and availability of the data, among other features. Even though DBMS vendors continue to offer greater automation and simplicity in managing databases, the need for specialized intrusion detection database compression technology has not yet been addressed. Our research focuses on developing such technology. The focus is not only on compression but also on database management through planning and best practice adoption to improve operational efficiency, and provide lower costs, privacy and security. The focus in this summary is on the compression part of the DMBS system for intrusion detection. We present a methodology employing grammar-based and large alphabet compression techniques which involves the generation of multiple dictionaries for compressing clustered subfiles of a very large data file. One of the dictionaries is a common dictionary which models features common to the subfiles. In addition, non-common features of each subfile are modeled via an auxiliary dictionary. Each clustered subfile is compressed using the augmented dictionary consisting of the common dictionary together with the auxiliary dictionary for that subfile.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129927496","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}

引用次数: 2

Robust Network Coding for Bidirected Networks 双向网络的鲁棒网络编码

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357606

A. Sprintson, S. Rouayheb, C. Georghiades

引用次数: 8

How Much Bandwidth Can Attack Bots Commandeer? 攻击机器人可以占用多少带宽?

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357579

M. Greenwald, S. Khanna, S. Venkatesh

引用次数: 0

On Pricing of Spectrum in Secondary Markets 二级市场频谱定价研究

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357554

A. Al Daoud, M. Alanyali, D. Starobinski

引用次数: 3

An Efficient Method for Large-Scale l1-Regularized Convex Loss Minimization 一种有效的大规模1.1正则化凸损失最小化方法

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357584

Kwangmoo Koh, Seung-Jean Kim, Stephen Boyd

引用次数: 7

Density Evolution for GF(q) LDPC Codes Via Simplified Message-passing Sets 基于简化消息传递集的GF(q) LDPC码的密度演化

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357586

B. Kurkoski, K. Yamaguchi, K. Kobayashi

引用次数: 8

Generalized Stopping Sets and Stopping Redundancy 广义停止集与停止冗余

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357610

K. Abdel-Ghaffar, J. Weber

{"title":"Generalized Stopping Sets and Stopping Redundancy","authors":"K. Abdel-Ghaffar, J. Weber","doi":"10.1109/ITA.2007.4357610","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357610","url":null,"abstract":"Iterative decoding for linear block codes over erasure channels may be much simpler than optimal decoding but its performance is usually not as good. Here, we present a general iterative decoding technique that gives a more refined trade-off between complexity and performance. In each iteration, a system of equations is solved. In case the maximum number of equations to be solved is just one, the general iterative decoder reduces to the well-known iterative decoder. On the other hand, if the maximum number is set to the redundancy of the codes, the general iterative decoder gives the same performance as the optimal decoder. Varying the maximum number of equations to be solved in each iteration between these two extremes allows for a better match, in terms of performance and complexity, to the system specifications. Stopping sets and stopping redundancy are important concepts in the analysis of the performance and complexity of iterative decoders on the erasure channel. In consequence of the new generalized decoding procedure, the notions of stopping sets and stopping redundancy are generalized as well. Basic properties and examples of both generalized stopping sets and generalized stopping redundancy are presented in this paper.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115492089","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}

引用次数: 3