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

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)最新文献

筛选
英文 中文
A reduced complexity detector/decoder for multiuser communications with FEC 一种用于FEC多用户通信的低复杂度检测器/解码器
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708889
Y. Shama, B. Vojcic
{"title":"A reduced complexity detector/decoder for multiuser communications with FEC","authors":"Y. Shama, B. Vojcic","doi":"10.1109/ISIT.1998.708889","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708889","url":null,"abstract":"We consider a reduced complexity detection scheme for coded asynchronous multiuser signals, where the forward error correction code structure is used as part of the multiuser detection for only a subset of users, and the code is ignored for the rest of the users and they are decoded separately.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121224234","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 the performance of the order-truncate-average-ratio spectral filter 阶截断平均比光谱滤波器的性能研究
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709078
J. Shapiro, T. J. Green
{"title":"On the performance of the order-truncate-average-ratio spectral filter","authors":"J. Shapiro, T. J. Green","doi":"10.1109/ISIT.1998.709078","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709078","url":null,"abstract":"We describe a nonlinear processor, called the order-truncate-average-ratio spectral filter, that is designed to simultaneously whiten broadband background, preserve intermediate bandwidth features and suppress narrowband interference.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121329082","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
Construction of binary sequences with ideal autocorrelation by the polynomial z/sup d/+(z+1)/sup d/ 用多项式z/sup d/+(z+1)/sup d/构造理想自相关二值序列
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709074
Jong-Seon No, Habong Chung, Minyoung Yun
{"title":"Construction of binary sequences with ideal autocorrelation by the polynomial z/sup d/+(z+1)/sup d/","authors":"Jong-Seon No, Habong Chung, Minyoung Yun","doi":"10.1109/ISIT.1998.709074","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709074","url":null,"abstract":"In this paper, we present a construction for binary pseudorandom sequences of period 2/sup m/-1 with ideal autocorrelation property using the polynomial z/sup d/+(z+1)/sup d/.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121418555","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
Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders 由等效分量卷积编码器得到的非等效级联卷积码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708943
S. Höst, Rolf Johannesson, V. Zyablov
{"title":"Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders","authors":"S. Höst, Rolf Johannesson, V. Zyablov","doi":"10.1109/ISIT.1998.708943","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708943","url":null,"abstract":"Cascaded convolutional codes with conventional convolutional codes as constituent codes are powerful and attractive to use in communication systems where very low error probabilities are needed. This paper clearly demonstrates the dramatic effect the replacement of the inner convolutional encoder by an equivalent one could have on the cascaded convolutional code.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121480352","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
Constructing optimal ternary constant-weight codes by placing pieces on chessboards 通过在棋盘上放置棋子构造最优的三元等权码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708649
M. Svanstrom
{"title":"Constructing optimal ternary constant-weight codes by placing pieces on chessboards","authors":"M. Svanstrom","doi":"10.1109/ISIT.1998.708649","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708649","url":null,"abstract":"We study the problem of constructing optimal ternary constant-weight codes with Hamming weight w and minimum distance d=2w-1. We reformulate the problem as a problem of placing pieces on an M/spl times/M chessboard so that three simple conditions are satisfied. Using this, we construct codes with minimal length for a given number of codewords.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121536215","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
Bounds on the efficiency of two-stage group testing 两阶段群检验效率的界限
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708694
T. Berger, J. Mandell
{"title":"Bounds on the efficiency of two-stage group testing","authors":"T. Berger, J. Mandell","doi":"10.1109/ISIT.1998.708694","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708694","url":null,"abstract":"In biotechnology screening applications for peptide and cDNA libraries and for monoclonal antibody generation, there are severe limitations on the number of stages of group testing that can be performed. The authors provide exact formulas for the screening efficiency of several such assaying strategies, including the popular rows-and-columns technique. Also, they upper bound the maximum efficiency of any two-stage strategy and use random test selection to show that there exist two-stage group tests that perform close to the authors' upper bounds.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126414213","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
Aspects on linear parallel interference cancellation in CDMA CDMA中线性并行干扰消除的若干问题
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708617
L. Rasmussen, Dongning Guo, Teng Joon Lim, Yao Ma
{"title":"Aspects on linear parallel interference cancellation in CDMA","authors":"L. Rasmussen, Dongning Guo, Teng Joon Lim, Yao Ma","doi":"10.1109/ISIT.1998.708617","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708617","url":null,"abstract":"In this paper we devise a matrix-algebraic approach to analysing linear parallel interference cancellation. We show that linear parallel interference cancellation schemes correspond to linear matrix filtering.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126538354","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
New classes of algebraic interleavers for turbo-codes 涡轮码代数交织器的新类别
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709024
O.Y. Takeshita, Daniel J Costello
{"title":"New classes of algebraic interleavers for turbo-codes","authors":"O.Y. Takeshita, Daniel J Costello","doi":"10.1109/ISIT.1998.709024","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709024","url":null,"abstract":"In this paper we present classes of algebraic interleavers that permute a sequence of bits with nearly the same statistical distribution as a randomly chosen interleaver. When these interleavers are used in turbo-coding, they perform equal to or better than the average of a set of randomly chosen interleavers. They are based on a property of quadratic congruences over the ring of integers modulo powers of 2.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128044544","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}
引用次数: 70
The turbo decoding algorithm has fixed points turbo译码算法有不动点
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708882
Long Duan, B. Rimoldi
{"title":"The turbo decoding algorithm has fixed points","authors":"Long Duan, B. Rimoldi","doi":"10.1109/ISIT.1998.708882","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708882","url":null,"abstract":"It is shown that the iterative decoding algorithm proposed for decoding \"turbo codes\" has fixed points regardless of the specific constituent codes and regardless of the variance of the additive white Gaussian noise.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128160131","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}
引用次数: 7
The hypothesis of fixed-key equivalence for one-round of encryption 一轮加密的固定密钥等价假设
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708664
Z. Kukorelly
{"title":"The hypothesis of fixed-key equivalence for one-round of encryption","authors":"Z. Kukorelly","doi":"10.1109/ISIT.1998.708664","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708664","url":null,"abstract":"Matsui's (1993) linear cryptanalysis has been generalised by Harpes, Kramer and Massey (see Advances in Cryptology-Eurocrypt'95, LNCS 921, p.24-38, 1995) who make use of balanced functions (which take on each value an equal number of times) instead of linear expressions. In their attack, the \"measure of effectiveness\" is the average-key imbalance. This article shows that the hypothesis holds for almost all combinations of ciphers and balanced functions. Perhaps more importantly, the results give a reference for the effectiveness of (linear or more general) expressions.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131350838","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学术官方微信