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

Proceedings. IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
New family of binary sequences with three- or five-valued crosscorrelation property 具有三值或五值互相关性质的新二值序列族
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023372
Sang-Hyo Kim, Jong-Seon No
{"title":"New family of binary sequences with three- or five-valued crosscorrelation property","authors":"Sang-Hyo Kim, Jong-Seon No","doi":"10.1109/ISIT.2002.1023372","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023372","url":null,"abstract":"In this paper, new families of binary sequences S and U with 3 or 5-valued out-of-phase crosscorrelation property of period 2/sup n/-1 are introduced.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"1 1","pages":"100-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81571052","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
Asymptotically optimal deterministic encoders for constrained systems 约束系统的渐近最优确定性编码器
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023601
P. Chaichanavong, B. Marcus
{"title":"Asymptotically optimal deterministic encoders for constrained systems","authors":"P. Chaichanavong, B. Marcus","doi":"10.1109/ISIT.2002.1023601","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023601","url":null,"abstract":"A constrained system or constraint S=S/sub G/ is the set of all finite sequences generated by a labeled graph G by reading the labels along walks on the graph. We say that G is a presentation of S. A graph G is deterministic if at each state, the outgoing edges are labeled distinctly. Some well-known constraints include runlength limited RLL(d,k) and maximum transition run MTR(j,k). A deterministic presentation of MTR(j,k) is shown.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"225 1","pages":"329-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76606274","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
STBC from field extensions of the rational field STBC从有理域的域扩展
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023546
B. Sethuraman, B. Rajan
{"title":"STBC from field extensions of the rational field","authors":"B. Sethuraman, B. Rajan","doi":"10.1109/ISIT.2002.1023546","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023546","url":null,"abstract":"The construction of space time block code (STBCS) over symmetric m-PSK (m-arbitrary) signal sets for a restricted set of number of antennas n is presented by Sethuraman and Sundar Rajan (see ICC 2002, New York, 2002), using cyclotomic field extensions of the field of rationals /spl Qopf/. We extend the method of Sethuraman et al. and achieve construction of minimal-delay, full-rank, rate-1 STBCs over (i) certain asymmetric m-PSK (m-arbitrary) signal sets, QAM and cross-constellations, (ii) certain rotationally invariant signal sets, for arbitrary number of antennas, using transcendental extensions of /spl Qopf/ and (iii) using non-cyclotomic field extensions of /spl Qopf/ for arbitrary number of antennas.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"19 1","pages":"274-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76884858","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}
引用次数: 10
A dual watermarking and fingerprinting system 双水印和指纹识别系统
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023739
D. Kirovski, Henrique S. Malvar, Y. Yacobi
{"title":"A dual watermarking and fingerprinting system","authors":"D. Kirovski, Henrique S. Malvar, Y. Yacobi","doi":"10.1109/ISIT.2002.1023739","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023739","url":null,"abstract":"We propose a public-key watermarking system, where as usual, all the copies of a protected object are identically marked, but where each user has a distinct secret detection key. All such detection keys are different from the secret embedding key. Even by gaining the knowledge of a relatively large number of detection keys, an adversary cannot remove the secret marks from the protected content. We show that an attacker who has access to one detection key can always fool the corresponding watermark (WM) detector, but not other WM detectors. Also, in that process, the attacker necessarily inserts a fingerprint (FP) in the modified content. Our WM/FP system significantly improves upon the best known asymptotic resistance to collusion attacks to O(N log N) from O(N/sup 1/4/).","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"5 1","pages":"467-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81017892","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
Cooperation diversity through coding 通过编码实现合作多样性
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023492
T. E. Hunter, Aria Nosratinia
{"title":"Cooperation diversity through coding","authors":"T. E. Hunter, Aria Nosratinia","doi":"10.1109/ISIT.2002.1023492","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023492","url":null,"abstract":"We propose a new user cooperation scheme for wireless communications in which we combine cooperation with existing channel coding methods. Simulation results show a significant improvement in the BER for both users, even when the channel between them is poor, or when they have significantly different channel qualities to the base station.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"26 1","pages":"220-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81081296","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}
引用次数: 592
On deletion codes 关于删除码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023643
A. Tavory, M. Feder
{"title":"On deletion codes","authors":"A. Tavory, M. Feder","doi":"10.1109/ISIT.2002.1023643","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023643","url":null,"abstract":"In a deletion channel, some symbols might be \"dropped off\" during transmission. The receiver knows that some symbols were omitted, but does not know either their values or their indices. We introduce a linear-time code correcting a fixed number of deletions, with a message-overhead linear in the number of deletions and less than log squared in the original message length. We also present some extensions of known bounds for deletion codes. In a UEP (unequal error protection) coding setting, each message part is assigned a priority value, determining its required resiliency to errors. Depending on this priority, and the numbers of errors actually taking place, this message part should be recoverable. Extending previous work that dealt with UEP in the context of erasures, we introduce codes and bounds for UEP in the context of deletions, which are relevant to lossy packet-networks.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"100 1","pages":"371-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85804541","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 method for reducing the number of unknown coefficients of generalized Hamming weight enumerators 一种减少广义汉明权枚举数未知系数数的方法
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023506
O. Milenkovic, K. Compton
{"title":"A method for reducing the number of unknown coefficients of generalized Hamming weight enumerators","authors":"O. Milenkovic, K. Compton","doi":"10.1109/ISIT.2002.1023506","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023506","url":null,"abstract":"We describe a combinatorial method for deriving linear equations, involving coefficients of generalized Hamming weight enumerators (GHWEs) of even isodual codes, that are linearly independent from the Klove (1992) identities. These equations can be combined with some other results derived by the first author to compute the complete set of GHWEs of many isodual codes. The approach presented is based on the \"gluing\" theory of Pless (1998) and also applies to formally self-dual codes, but is simplest to describe for self-dual codes.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"29 1","pages":"234-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85830447","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
Capacity for four classes of discrete memoryless networks 四类离散无存储器网络的容量
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023297
G. Kramer
{"title":"Capacity for four classes of discrete memoryless networks","authors":"G. Kramer","doi":"10.1109/ISIT.2002.1023297","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023297","url":null,"abstract":"Capacity expressions are given for four classes of discrete memoryless networks (DMNs). One of the capacity results is a consequence of a new outer bound for common output DMNs. Another result shows that the common practice of using time-sharing random variables does not include all time-sharing possibilities, namely time-sharing of channels.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"105 1","pages":"25-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85899287","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
On information dispersal algorithms 关于信息分散算法
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023682
A. De Santis, B. Masucci
{"title":"On information dispersal algorithms","authors":"A. De Santis, B. Masucci","doi":"10.1109/ISIT.2002.1023682","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023682","url":null,"abstract":"An information dispersal algorithm is a method to split a file f into n pieces in such a way that the file can be reconstructed from some predefined subsets of pieces. In this paper we analyze multiple information dispersal algorithms by using an information-theoretic framework.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"76 1","pages":"410-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84084104","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
Optical orthogonal codes and multi-target Costas and sonar arrays 光学正交码和多目标Costas和声纳阵列
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023513
O. Moreno, S. Golomb
{"title":"Optical orthogonal codes and multi-target Costas and sonar arrays","authors":"O. Moreno, S. Golomb","doi":"10.1109/ISIT.2002.1023513","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023513","url":null,"abstract":"We explore the interconnection between Costas and Sonar arrays for multiple targets and optical orthogonal codes. Also we obtain a family of multiple target double periodical arrays (more than one array) whose auto- and cross-correlation is one and a family with auto-correlation 2 and cross-correlation 1. Furthermore we give a method to obtain optical orthogonal codes from multiple target arrays.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"4 1","pages":"241-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84117502","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
首页 上一页 下一页 尾页
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学术官方微信
小红书