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

2010 IEEE Information Theory Workshop最新文献

筛选
英文 中文
Coding for the Z channel with a digital relay link 用数字中继链路对Z频道进行编码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592716
Hieu T. Do, T. Oechtering, M. Skoglund
{"title":"Coding for the Z channel with a digital relay link","authors":"Hieu T. Do, T. Oechtering, M. Skoglund","doi":"10.1109/CIG.2010.5592716","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592716","url":null,"abstract":"This paper considers a discrete memoryless four-node network where two nodes want to send three independent messages to the other two nodes. The two receiving nodes are allowed to cooperate by means of a unidirectional noiseless link with finite capacity. A coding scheme is proposed which combines rate splitting, block Markov multi-level superposition coding with binning and joint decoding. The general achievable rates are then specialized to degraded channel and Gaussian channel, where it is shown that the sum capacity for the Gaussian channel is achieved under certain conditions. Results in this paper recover and unify previously known results for the discrete memoryless Z channel without cooperation, and results for the Gaussian Z-interference channel with a digital relay link.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121199267","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
Additive codes over Z2 × Z4 Z2 × Z4上的加性代码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592827
J. Borges, C. Fernández-Córdoba, S. Dougherty
{"title":"Additive codes over Z2 × Z4","authors":"J. Borges, C. Fernández-Córdoba, S. Dougherty","doi":"10.1109/CIG.2010.5592827","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592827","url":null,"abstract":"We describe recent results for codes over Z<inf>2</inf> ×Z<inf>4</inf> giving their connection to binary codes via a natural Gray map. We study Z<inf>2</inf>Z<inf>4</inf> self-dual codes and we state the major results concerning these codes. We state several open questions and discuss possible avenues of research.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131516421","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
Universal source polarization and sparse recovery 通用源极化和稀疏恢复
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592875
E. Abbe
{"title":"Universal source polarization and sparse recovery","authors":"E. Abbe","doi":"10.1109/CIG.2010.5592875","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592875","url":null,"abstract":"Polar codes allow to perform lossless compression of i.i.d. sources at the lowest rate with low encoding and decoding complexity. In this paper, it is shown that for binary sources, there exist “universal polar codes” which can compress any source of low enough entropy, without requiring knowledge of the source distribution. While this result does not extend to q-ary sources, it is shown how it extends to q-ary sources which belong to a restricted family. An analogy between this family and BECs in channel polarization is discussed. Finally, an application of the universal source polarization results to sparse data recovery is proposed.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126578537","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}
引用次数: 12
Information-theoretical analysis of private content identification 隐私内容识别的信息理论分析
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592809
S. Voloshynovskiy, O. Koval, F. Beekhof, F. Farhadzadeh, T. Holotyak
{"title":"Information-theoretical analysis of private content identification","authors":"S. Voloshynovskiy, O. Koval, F. Beekhof, F. Farhadzadeh, T. Holotyak","doi":"10.1109/CIG.2010.5592809","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592809","url":null,"abstract":"In recent years, content identification based on digital fingerprinting attracts a lot of attention in different emerging applications. At the same time, the theoretical analysis of digital fingerprinting systems for finite length case remains an open issue. Additionally, privacy leaks caused by fingerprint storage, distribution and sharing in a public domain via third party outsourced services cause certain concerns in the cryptographic community. In this paper, we perform an information-theoretic analysis of finite length digital fingerprinting systems in a private content identification setup and reveal certain connections between fingerprint based content identification and Forney's erasure/list decoding [1]. Along this analysis, we also consider complexity issues of fast content identification in large databases on remote untrusted servers.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114837559","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}
引用次数: 44
Robust parent-identifying codes 鲁棒的父母识别代码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592920
A. Barg, G. Blakley, G. Kabatiansky, C. Tavernier
{"title":"Robust parent-identifying codes","authors":"A. Barg, G. Blakley, G. Kabatiansky, C. Tavernier","doi":"10.1109/CIG.2010.5592920","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592920","url":null,"abstract":"Codes with the identifiable parent property (IPP codes) are used in traitor tracing schemes that protect data broadcast by the publisher from unauthorized access or distribution. An n-word y over a finite alphabet is called a descendant of a set of t words x<sup>1</sup>, …, x<sup>t</sup> if y<inf>i</inf> ∊ {x<sup>1</sup><inf>i</inf>, …, x<sup>t</sup><inf>i</inf>} for all i = 1, … n. A code C = {x<sup>1</sup>, …, x<sup>M</sup>} is said to have the i-IPP property if for any n-word y that is a descendant of at most t parents belonging to the code it is possible to identify at least one of them. The existence of good i-IPP codes is known from earlier works. We introduce a robust version of IPP codes which allows unconditional identification of parents even if some of the coordinates in y can break away from the descent rule, i.e., can take arbitrary values from the alphabet, or become completely unreadable. By linking this problem to perfect hash functions and, more generally, to hash distances of a code, we prove initial results on the proportion of such coordinates that can be tolerated under the unconditional recovery requirement.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128888495","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
Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound? 奇行列式和二进制帧证明码超越概率界的Hecke算子?
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592905
Hugues Randriam
{"title":"Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?","authors":"Hugues Randriam","doi":"10.1109/CIG.2010.5592905","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592905","url":null,"abstract":"We give a slight improvement on Xing's lower bound for frameproof codes constructed from algebraic curves. Combined with some additional number-theoretic assumptions (still conjectural) and a concatenation process, this should lead to the existence of a family of binary 2-frameproof codes of asymptotic rate going beyond the up to now best known (non-constructive) lower bound.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130284332","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
Irregular repeat-accumulate-like codes with improved error floor performance 不规则重复累加代码，改进了错误层性能
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592734
David F. Hayes, Sarah J. Johnson, S. Weller
{"title":"Irregular repeat-accumulate-like codes with improved error floor performance","authors":"David F. Hayes, Sarah J. Johnson, S. Weller","doi":"10.1109/CIG.2010.5592734","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592734","url":null,"abstract":"In this paper, we present a new class of iteratively decoded error correction codes. These codes, which are a modification of irregular repeat-accumulate (IRA) codes, are termed generalized IRA (GIRA) codes, and are designed for improved error floor performance. GIRA codes are systematic, easily encodable, and are decoded with the sum-product algorithm. In this paper we present a density evolution algorithm to compute the threshold of GIRA codes, and find GIRA degree distributions which produce codes with good thresholds. We then propose inner code designs and show using simulation results that they improve upon the error floor performance of IRA codes.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"328 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120941986","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
Fireworks: A random linear coding scheme for distributed storage in wireless sensor networks 用于无线传感器网络分布式存储的随机线性编码方案
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592800
D. Vukobratović, Č. Stefanović, V. Stanković
{"title":"Fireworks: A random linear coding scheme for distributed storage in wireless sensor networks","authors":"D. Vukobratović, Č. Stefanović, V. Stanković","doi":"10.1109/CIG.2010.5592800","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592800","url":null,"abstract":"In this paper, we investigate the design of decentralized encoding procedure for distributed random linear coding (RLC) in resource-constrained wireless networks. We propose a novel distributed RLC scheme called “Fireworks”, analyze its performance and support it by simulation results. The presented results demonstrate design flexibility of the proposed scheme, where the design choices influence the trade-off between the coding efficiency and encoding communication costs.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"38 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126602587","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
Codes from graphs related to the categorical product of triangular graphs and Kn 与三角图和Kn的范畴积有关的图的代码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592662
K. Kumwenda, E. Mwambene
{"title":"Codes from graphs related to the categorical product of triangular graphs and Kn","authors":"K. Kumwenda, E. Mwambene","doi":"10.1109/CIG.2010.5592662","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592662","url":null,"abstract":"For any prime p and n ⋛ 3, we examine p-ary linear codes generated by incidence matrices of two classes of graphs, H<inf>n</inf> and Γ<inf>n</inf> where H<inf>n−1</inf> is an induced subgraph of Γ<inf>n</inf>. Γ<inf>n</inf> is a subgraph of the union of the categorical product of triangular graphs T<inf>n</inf> and complete graphs K<inf>n</inf>, and complements of triangular graphs T<inf>n</inf> and K<inf>n</inf>, where the union of graphs is as defined in [4]. For the codes of H<inf>n</inf>, we exhibit permutation decoding sets of order n for full error correction. Their size is only twice the lower bound due to Gordon [7]. We also consider partial permutation decoding for the binary codes from Γ<inf>n</inf>.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126615927","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
Local computation in codes 代码中的局部计算
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592932
T. Kaufman
{"title":"Local computation in codes","authors":"T. Kaufman","doi":"10.1109/CIG.2010.5592932","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592932","url":null,"abstract":"A locally testable code allows one to store vast amounts of data, where estimating the fraction of errors in the data takes roughly as much time as takes to read one bit of the data! If the fraction of errors is below a certain threshold, a locally decodeable code would allow one to recover every bit of the original message, again, in time which is roughly the time to read one bit of the data. Are such locally testable/decodeable codes of constant rate possible? So far we don't know, but surprisingly-good codes are known. Following, we survey some of the literature and discuss a connection between these notions to symmetric LDPC codes.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122299356","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信