发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
A Partial Solution for Lossless Source Coding with Coded Side Information 带编码边信息的无损源编码的部分解决方案
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633821
D. Marco, M. Effros
{"title":"A Partial Solution for Lossless Source Coding with Coded Side Information","authors":"D. Marco, M. Effros","doi":"10.1109/ITW.2006.1633821","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633821","url":null,"abstract":"This paper considers the problem, first introduced by Ahlswede and Körner in 1975, of lossless source coding with coded side information. Specifically, let X and Y be two random variables such that X is desired losslessly at the decoder while Y serves as side information. The random variables are encoded independently, and both descriptions are used by the decoder to reconstruct X. Ahlswede and Körner describe the achievable rate region in terms of an auxiliary random variable. This paper gives a partial solution for the optimal auxiliary random variable, thereby describing part of the rate region explicitly in terms of the distribution of X and Y.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"10 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":"121124244","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}
引用次数: 6
Fast arithmetic for polynomials over F2in hardware 快速算法的多项式在F2in硬件
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633791
J. Gathen, J. Shokrollahi
{"title":"Fast arithmetic for polynomials over F2in hardware","authors":"J. Gathen, J. Shokrollahi","doi":"10.1109/ITW.2006.1633791","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633791","url":null,"abstract":"We study different possibilities of implementing Karatsuba multipliers for polynomials over F2on Field Programmable Gate Arrays (FPGAs). This is a core task for implementing finite fields of characteristic 2. Algorithmic and platform dependent optimizations yield efficient hardware designs. The resulting structure is hybrid in two different aspects. On the one hand, a combination of various methods decreases the number of bit operations. On the other hand, a mixture of sequential and combinational circuit design techniques including pipelining is used to design a circuit which can be adapted flexibly to time-area constraints. The approach—both theory and implementation—can be viewed as a further step towards taming the machinery of fast algorithmics for hardware applications.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"144 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":"124602400","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}
引用次数: 17
Statistics for dynamical sources 动态源统计
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633790
B. Vallée
{"title":"Statistics for dynamical sources","authors":"B. Vallée","doi":"10.1109/ITW.2006.1633790","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633790","url":null,"abstract":"A quite general model of source that comes from dynamical systems theory is introduced. Within this model, basic problems of algorithmic information theory contexts are analysed. The main tool is a new object, a (generalized) transfer operator, which can be viewed as a \"generating\" operator for \"fundamental\" probabilities. Its dominant spectral objects are related to important parameters of the source, such as the entropy, and play a central role in all the results.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"91 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":"124657848","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
A Simple Derivation of Burnashev's Reliability Function Burnashev可靠性函数的简单推导
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633811
P. Berlin, Barış Nakiboğlu, B. Rimoldi, E. Telatar
{"title":"A Simple Derivation of Burnashev's Reliability Function","authors":"P. Berlin, Barış Nakiboğlu, B. Rimoldi, E. Telatar","doi":"10.1109/ITW.2006.1633811","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633811","url":null,"abstract":"Feedback coupled with variable-length codes can substantially increase the reliability of a discrete memoryless channel (DMC). Burnashev, in a remarkable paper published in 1976, derived an asymptotically achievable lower bound to the average blocklength needed for a system that communicates at a specified rate and achieves a given error probability. We offer an alternative proof of the lower bound. Our proof is simpler than the original, and clarifies the roles of the quantites that appear in the bound by relating one to uncertainty reduction and the other to binary hypothesis testing. In addition, our derivation of the lower bound closely parallels a derivation of an upper bound by Yamamoto and Itoh.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"49 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":"125441434","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}
引用次数: 8
Calibration via Regression 回归校正
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633786
Dean Phillips Foster, S. Kakade
{"title":"Calibration via Regression","authors":"Dean Phillips Foster, S. Kakade","doi":"10.1109/ITW.2006.1633786","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633786","url":null,"abstract":"In the online prediction setting, the concept of calibration entails having the empirical (conditional) frequencies match the claimed predicted probabilities. This contrasts with more traditional online prediction goals of getting a low cumulative loss. The differences between these goals have typically made them hard to compare with each other. This paper shows how to get an approximate form of calibration out of a traditional online loss minimization algorithm, namely online regression. As a corollary, we show how to construct calibrated forecasts on a collection of subsequences.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"195 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":"121860774","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}
引用次数: 8
Inverting bijective polynomial maps over finite fields 有限域上的反双射多项式映射
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633775
A. Cafure, G. Matera, A. Waissbein
{"title":"Inverting bijective polynomial maps over finite fields","authors":"A. Cafure, G. Matera, A. Waissbein","doi":"10.1109/ITW.2006.1633775","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633775","url":null,"abstract":"We study the problem of inverting a bijective polynomial map F: F<inf>q</inf><sup>n</sup>→ F<inf>q</inf><sup>n</sup>over a finite field F<inf>q</inf>. Our interest mainly stems from the case where F encodes a permutation given by some cryptographic scheme. Given y<sup>(0)</sup>∈ F<inf>q</inf><sup>n</sup>, we are able to compute the value x<sup>(0)</sup>∈ F<inf>q</inf><sup>n</sup>for which F(x<sup>(0)</sup>) = y<sup>(0)</sup>holds in time O(Ln<sup>O(1)</sup>δ<sup>4</sup>) up to logarithmic terms. Here L is the cost of the evaluation of F and δ is a geometric invariant associated to the graph of the polynomial map F, called its degree.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"17 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":"126778399","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}
引用次数: 6
Delay-limited OFDM broadcast capacity region and impact of system parameters 延迟受限OFDM广播容量区域及系统参数的影响
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633772
G. Wunder, T. Michel
{"title":"Delay-limited OFDM broadcast capacity region and impact of system parameters","authors":"G. Wunder, T. Michel","doi":"10.1109/ITW.2006.1633772","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633772","url":null,"abstract":"In this work, we calculate the delay-limited capacity (DLC) region of an OFDM (orthogonal frequency division multiplexing) broadcast channel. Furthermore, we analyze the impact of system parameters. The main results are that under weak assumptions, the single user DLC is almost independent of the distribution of the path attenuations in the low SNR region but depends strongly on the delay spread. In the high SNR region the roles are exchanged. Here, the impact of delay spread is negligible and the impact of the distribution is dominant. Finally, we provide a result for the multiuser case.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"1 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":"130478073","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
On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound 二值Grey-Rankin界的一个新的q元组合模拟及满足该界的码
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633829
L. Bassalygo, S. Dodunekov, T. Helleseth, V. Zinoviev
{"title":"On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound","authors":"L. Bassalygo, S. Dodunekov, T. Helleseth, V. Zinoviev","doi":"10.1109/ITW.2006.1633829","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633829","url":null,"abstract":"For any integer q we present a new bound which is a q-ary combinatorial analog of the binary Grey-Rankin bound. For any prime power q we present two infinite classes of q-ary codes which meet this bound with integral equality. Moreover, we show how codes meeting this bound with equality are connected to several important classical combinatorial configurations, such as difference matrices and generalized Hadamard matrices.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"150 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":"117307189","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}
引用次数: 5
On the Capacity of Small-World Networks 论小世界网络的容量
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633834
R. Costa, J. Barros
{"title":"On the Capacity of Small-World Networks","authors":"R. Costa, J. Barros","doi":"10.1109/ITW.2006.1633834","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633834","url":null,"abstract":"Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. Breaking with the traditional approach to these so called small worlds that relies mainly on graph parameters directly related to connectivity, we investigate the capacity of these networks from the perspective of network information flow. Our contribution includes upper and lower bounds for the capacity of standard and navigable small-world models based on added shortcuts, and the somewhat surprising result, that, with high probability, random rewiring does not alter the capacity of a small-world network.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"84 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":"129491742","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}
引用次数: 8
Code Synchronization, Cyclotomy, and Finite Geometry 代码同步，环切开术和有限几何
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633827
V. Tonchev
{"title":"Code Synchronization, Cyclotomy, and Finite Geometry","authors":"V. Tonchev","doi":"10.1109/ITW.2006.1633827","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633827","url":null,"abstract":"The paper surveys some recent combinatorial constructions of optimal comma-free codes being cosets of linear codes that explore cyclotomy and partitions of hyperplanes or complements of hyperplanes in a finite projective geometry.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"11 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":"124069060","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信