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

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

筛选
英文 中文
New Point Compression Algorithms for Binary Curves 二值曲线新的点压缩算法
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633795
J. C. López-Hernández, R. Dahab
{"title":"New Point Compression Algorithms for Binary Curves","authors":"J. C. López-Hernández, R. Dahab","doi":"10.1109/ITW.2006.1633795","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633795","url":null,"abstract":"This paper presents two new algorithms for point compression for elliptic curves defined over F2m, m odd. The first algorithm works for curves with Tr(a) = 1 and offers computational advantages over previous methods. The second algorithm is based on the λ representation of an elliptic point. The proposed algorithms require m bits to compress an elliptic point and can be used for all random binary curves recommended by NIST.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"12 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":"127693987","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
Dependence Balance and the Gaussian Multiaccess Channel with Feedback 依赖平衡与反馈高斯多址信道
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633810
G. Kramer, M. Gastpar
{"title":"Dependence Balance and the Gaussian Multiaccess Channel with Feedback","authors":"G. Kramer, M. Gastpar","doi":"10.1109/ITW.2006.1633810","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633810","url":null,"abstract":"Dependence balance bounds of Hekstra and Willems are generalized and refined. The new bounds are applied to the K-user multiaccess channel (MAC) with output feedback, and they are shown to establish the feedback sum-rate capacity for the Gaussian MAC when all users have the same per-symbol power constraints. The sum-rate capacity is achieved by Fourier modulated estimate correction. The feedback sum-rate capacity is shown to improve the no-feedback capacity by only log log K nats per use for large K. The new bounds also improve on cut-set bounds for asymmetric powers and rates.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"8 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":"126395934","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}
引用次数: 26
Compound Sequential Decisions Against the Well-Informed Antagonist 复合顺序决策对抗消息灵通的对手
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633785
T. Weissman
{"title":"Compound Sequential Decisions Against the Well-Informed Antagonist","authors":"T. Weissman","doi":"10.1109/ITW.2006.1633785","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633785","url":null,"abstract":"We consider causally estimating (filtering) the components of a noise-corrupted sequence relative to a reference class of filters. The noiseless sequence to be filtered is designed by a \"well-informed antagonist\", meaning it may evolve according to an arbitrary law, unknown to the filter, based, among other things, on past noisy sequence components. We show that this formulation is more challenging than that of an individual noiseless sequence (aka the \"semi-stochastic\" setting) in the sense that any deterministic filter, even one guaranteed to do well on every noiseless individual sequence, fails under some well-informed antagonist. On the other hand, we constructively establish the existence of a randomized filter which successfully competes with an arbitrary given finite reference class of filters, under every antagonist. Our noise model allows for channels whose noisy output depends on the l past channel outputs (in addition to the noiseless input symbol). Memoryless channels are obtained as a special case of our model by taking l = 0. In this case, our scheme coincides with one that was recently shown to compete with an arbitrary reference class in the semi-stochastic setting. Hence, our results show that the latter scheme is universal also under the well-informed antagonist.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"25 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":"121960187","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
Perfect Codes in the Johnson Schemes 约翰逊方案中的完美码
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633779
T. Etzion
{"title":"Perfect Codes in the Johnson Schemes","authors":"T. Etzion","doi":"10.1109/ITW.2006.1633779","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633779","url":null,"abstract":"In his pioneering work, from 1973, on algebraic approach to codes in association schemes, Dlesarte has conjectured that there are no nontrivial perfect codes in the Johnson schemes. Many attempts were made during the last 30 years to solve this conjecture. These attempts used Lloyd polynomials, anticodes in the Johnson schemes, designs, and number theory. We will survey all the known results and outline directions for solving the problem.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"26 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":"126146841","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
Online Learning with Universal Model and Predictor Classes 在线学习与通用模型和预测类
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633819
J. Poland
{"title":"Online Learning with Universal Model and Predictor Classes","authors":"J. Poland","doi":"10.1109/ITW.2006.1633819","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633819","url":null,"abstract":"We review and relate some classical and recent results from the theory of online learning based on discrete classes of models or predictors. Among these frameworks, Bayesian methods, MDL, and prediction (or action) with expert advice are studied. We will discuss ways to work with universal base classes corresponding to sets of all programs on some fixed universal Turing machine, resulting in universal induction schemes.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"7 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":"129729844","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
Approximating the number of differences between remote sets 接近远程集之间的差异数量
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633815
S. Agarwal, A. Trachtenberg
{"title":"Approximating the number of differences between remote sets","authors":"S. Agarwal, A. Trachtenberg","doi":"10.1109/ITW.2006.1633815","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633815","url":null,"abstract":"We consider the problem of approximating the number of differences between sets held on remote hosts using minimum communication. Efficient solutions to this problem are important for streamlining a variety of communication sensitive network applications, including data synchronization in mobile networks, gossip protocols and content delivery networks. Using tools from the field of interactive communication, we show that this problem requires about as much communication as the problem of exactly determining such differences. As a result, we propose a heuristic solution based on the counting Bloom filter. We provide analytic bounds on the expected performance of our protocol and also experimental evidence that they can outperform existing difference approximation techniques.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"9 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":"130778313","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}
引用次数: 16
A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras 一个新工具:从中心简单代数的极大阶构造stbc
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633838
C. Hollanti, J. Lahtonen
{"title":"A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras","authors":"C. Hollanti, J. Lahtonen","doi":"10.1109/ITW.2006.1633838","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633838","url":null,"abstract":"A means to construct dense, full-diversity STBCs from maximal orders in central simple algebras is introduced for the first time. As an example we construct an efficient ST lattice code with non-vanishing determinant for 4 transmit antenna MISO application. Also a general algorithm for testing the maximality of a given order is presented. By using a maximal order instead of just the ring of algebraic integers, the size of the code increases without losses in the minimum determinant. The usage of a proper ideal of a maximal order further improves the code, as the minimum determinant increases. Simulations in a quasi-static Rayleigh fading channel show that our lattice outperforms the DAST-lattice due to the properties described above.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"55 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":"125466374","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}
引用次数: 21
LDPC-based Gaussian key reconciliation 基于ldpc的高斯键调和
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633793
M. Bloch, A. Thangaraj, S. McLaughlin, J. Merolla
{"title":"LDPC-based Gaussian key reconciliation","authors":"M. Bloch, A. Thangaraj, S. McLaughlin, J. Merolla","doi":"10.1109/ITW.2006.1633793","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633793","url":null,"abstract":"We propose a new information reconciliation method which allows two parties sharing continuous random variables to agree on a common bit string. We show that existing coded modulation techniques can be adapted for reconciliation and give an explicit code construction based on LDPC codes in the case of Gaussian variables. Simulations show that our method achieves higher efficiency than previously reported results.","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":"121679301","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}
引用次数: 64
Linear Multiuser Detection for Asynchronous CDMA Systems: Chip Pulse Design and Time Delay Distribution 异步CDMA系统的线性多用户检测:芯片脉冲设计和时延分布
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633832
L. Cottatellucci, M. Debbah, R. Müller
{"title":"Linear Multiuser Detection for Asynchronous CDMA Systems: Chip Pulse Design and Time Delay Distribution","authors":"L. Cottatellucci, M. Debbah, R. Müller","doi":"10.1109/ITW.2006.1633832","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633832","url":null,"abstract":"The large system performance analysis of linear multiuser detectors (e.g. MMSE, MSWF, multistage detectors) for asynchronous CDMA systems is provided. While the performance of synchronous systems with square-root waveforms is independent of the chip bandwidth, the performance of asynchronous systems depends on the pulse shape and the bandwidth. It increases as the bandwidth increases beyond half on the chip rate and, in such a case, asynchronous systems outperform the synchronous ones.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"3 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":"128032828","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
Some graph products and their expansion properties 若干图积及其展开性质
2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI: 10.1109/ITW.2006.1633804
Andrew Brown, A. Shokrollahi
{"title":"Some graph products and their expansion properties","authors":"Andrew Brown, A. Shokrollahi","doi":"10.1109/ITW.2006.1633804","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633804","url":null,"abstract":"We introduce \"derandomized\" versions of the tensor product and the zig-zag product, extending the ideas in the derandomized squaring operation of Rozenman and Vadhan. These enable us to obtain graphs with smaller degrees than those obtained using their non-derandomized counterparts, though at the cost of slightly worse expansion. In this paper we give bounds on these expansions (measured by their second eigenvalues), and also obtain an improved bound on the expansion of the derandomized square.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"62 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":"131433881","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
下一页 尾页
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学术官方微信