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

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

筛选
英文 中文
Asymptotics of the /spl epsiv/-entropy for a certain class of ellipsoids in a Hamming space 汉明空间中一类椭球的/spl -熵的渐近性
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023736
V. V. Prelov, E. van der Meulen
{"title":"Asymptotics of the /spl epsiv/-entropy for a certain class of ellipsoids in a Hamming space","authors":"V. V. Prelov, E. van der Meulen","doi":"10.1109/ISIT.2002.1023736","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023736","url":null,"abstract":"The asymptotic behavior of the /spl epsiv/-entropy of ellipsoids in an n-dimensional Hamming space whose coefficients take only two different values is investigated as n /spl rarr/ /spl infin/. Explicit expressions for the main terms of the asymptotic representation for the /spl epsiv/-entropy of such ellipsoids are obtained under different relations between /spl epsiv/ and parameters defining these ellipsoids.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"15 1","pages":"464-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87883369","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
Cyclic and pseudo-cyclic byte error-correcting codes 循环和伪循环字节纠错码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023392
I. Cleju, A. Sirbu
{"title":"Cyclic and pseudo-cyclic byte error-correcting codes","authors":"I. Cleju, A. Sirbu","doi":"10.1109/ISIT.2002.1023392","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023392","url":null,"abstract":"The correction properties of a cyclic code depend on the generator polynomial, g(X). The authors have constructed and implemented in C++ an algorithm to identify such properties by analyzing all the remainders modulo g(X). In this paper we apply the algorithm to determine a binary generator polynomial for error correcting codes over GF(2/sup s/).","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"10 1","pages":"120-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88346474","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
Single-bit error correcting and burst error locating codes 单比特纠错和突发错误定位码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023389
T. Kaise, M. Kitakami
{"title":"Single-bit error correcting and burst error locating codes","authors":"T. Kaise, M. Kitakami","doi":"10.1109/ISIT.2002.1023389","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023389","url":null,"abstract":"The error location function of codes was first proposed by Wolf and Elspas in 1963 lying midway between error correction and error detection. In 1982, Dass proposed burst error locating codes. These codes, however, have a problem that they cannot locate burst errors which occur at the boundary of the two adjacent subblocks. From this point, the authors proposed a new class of burst error locating codes indicating an erroneous frame, called single bit error correcting and l-bit burst error locating codes, or SEC-B/sub l/EL codes. Here, the frame is a set of continuous symbols in a codeword and adjacent frames are partially overlapped in order to make any burst errors not exceeding the maximum size of the frame be included in at least one frame. The proposed codes, however, have more check-bits than burst error correcting fire codes for longer information-bit length. This paper proposes a new code design method of the SEC-B/sub l/EL codes having less check-bits than the burst error correcting fire codes.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"42 1","pages":"117-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86555487","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
Self-dual group codes 自对偶群码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023732
W. Willems
{"title":"Self-dual group codes","authors":"W. Willems","doi":"10.1109/ISIT.2002.1023732","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023732","url":null,"abstract":"A group code is an ideal in a suitable group algebra. Cyclic codes, Reed-Muller codes, the binary extended Golay code and many other remarkable codes are group codes. In this paper we answer the following question: Under what conditions do exist self-dual group codes over Galois rings?.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"30 1","pages":"460-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83867301","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 joint estimation decision algorithm for pollutant source characterization 一种污染源表征的联合估计决策算法
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023429
G. Delmaire
{"title":"A joint estimation decision algorithm for pollutant source characterization","authors":"G. Delmaire","doi":"10.1109/ISIT.2002.1023429","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023429","url":null,"abstract":"A joint decision estimation algorithm is proposed in order to locate the pollutant source and estimate its input flow. The purpose of this work is to present a unified probabilistic framework to the joint estimation problem in the case of simple probability densities using a specific input source model based on a cycle of life.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"71 1","pages":"157-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83920392","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
Two dimensional PN functions 二维PN函数
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023312
K. Horadam
{"title":"Two dimensional PN functions","authors":"K. Horadam","doi":"10.1109/ISIT.2002.1023312","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023312","url":null,"abstract":"There is a differential operator /spl part/ mapping 1D functions /spl phi/:G/spl rarr/C to 2D functions /spl part//spl phi/: G/spl times/G/spl rarr/C which are coboundaries, the simplest form of cocycle. Perfect nonlinear (PN) 1D functions determine coboundaries with balanced partial derivatives. We use this property to define 2D PN and differentially k-uniform functions. We list the known PN permutations of GF(p/sup a/) as specific 2D PN coboundaries and show /spl part/ has an inverse for these PN functions. There are many more families of 2D PN cocycles on GF(p/sup a/) than those arising as coboundaries, even when p=2 (no 1D PN functions for p=2 exist; APN is the best possible). These ideas can be extended to include APN and differentially k-uniform 2D cocycles.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"48 1","pages":"40-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82652987","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
Bounds for deletion/insertion correcting codes 删除/插入纠错码的边界
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023642
V. Levenshtein
{"title":"Bounds for deletion/insertion correcting codes","authors":"V. Levenshtein","doi":"10.1109/ISIT.2002.1023642","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023642","url":null,"abstract":"Bounds for codes capable of correcting deletions and insertions are presented.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"45 1","pages":"370-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82618194","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}
引用次数: 52
Decoding Xing-Ling codes 解码星灵代码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023360
Nielsen, Rasmus Refslund
{"title":"Decoding Xing-Ling codes","authors":"Nielsen, Rasmus Refslund","doi":"10.1109/ISIT.2002.1023360","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023360","url":null,"abstract":"This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"1 1","pages":"88-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90172004","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
New nonbinary sequences with ideal two-level autocorrelation function 具有理想二能级自相关函数的新非二值序列
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023454
T. Helleseth, G. Gong
{"title":"New nonbinary sequences with ideal two-level autocorrelation function","authors":"T. Helleseth, G. Gong","doi":"10.1109/ISIT.2002.1023454","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023454","url":null,"abstract":"New families of nonbinary sequences of period p/sup n/-1 with symbols from a finite field F/sub p/ for any p/spl ges/3 are constructed with two-level ideal autocorrelation functions. Difference sets with parameters (p/sup n/-1/p-1, p/sup n-1/-1/p-1, p/sup n-2/-1/p-1) can also be derived from these sequences in a natural way.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"6 1","pages":"182-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83773001","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}
引用次数: 27
On the capacity of regular wireless networks with transceiver multipacket communication 基于收发器多分组通信的常规无线网络容量研究
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023622
G. Mergen, L. Tong
{"title":"On the capacity of regular wireless networks with transceiver multipacket communication","authors":"G. Mergen, L. Tong","doi":"10.1109/ISIT.2002.1023622","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023622","url":null,"abstract":"In a wireless network with a sophisticated physical layer, the nodes may be capable of simultaneous multiple packet receptions (MPR) and multiple packet transmissions (MPT). Having multiple reception/transmission codes in a CDMA network, or employing directed antenna arrays are some ways of obtaining MPR/T capability. Although, MPR/T is widely considered in the context of communication with a base station in cellular wireless networks, its effect on the performance of peer-to-peer ad hoe networks is unknown. By developing upper and lower bounds, we analyze the effect of physical layer MPR/T capability on the capacity of regular wireless networks. The obtained bounds give the exact capacity value if the nodes do not have MPT but have MPR.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"27 1","pages":"350-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83338259","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
首页 上一页 下一页 尾页
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学术官方微信
小红书