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

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

筛选
英文 中文
A simple one sweep algorithm for optimal APP symbol decoding of linear block codes 线性分组码的最优APP符号解码的简单一扫算法
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-11-01 DOI: 10.1109/ISIT.1998.708835
T. Johansson, K. Zigangirov
{"title":"A simple one sweep algorithm for optimal APP symbol decoding of linear block codes","authors":"T. Johansson, K. Zigangirov","doi":"10.1109/ISIT.1998.708835","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708835","url":null,"abstract":"We propose a simple optimal a posteriori probability (APP) symbol decoding algorithm for linear block codes, which requires one forward recursion in a trellis.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114925278","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}
引用次数: 34
A comparison of known codes, random codes, and the best codes 已知代码、随机代码和最佳代码的比较
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-11-01 DOI: 10.1109/ISIT.1998.708819
S. MacMullan, O. Collins
{"title":"A comparison of known codes, random codes, and the best codes","authors":"S. MacMullan, O. Collins","doi":"10.1109/ISIT.1998.708819","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708819","url":null,"abstract":"This paper calculates new bounds on the size of the performance gap between random codes and the best possible codes on the binary symmetric channel (BSC), binary erasure channel (BEC), and the additive white Gaussian noise (AWGN) channel. The paper also presents substantial numerical evaluation of the performance of random codes and existing standard lower bounds for the BEC, BSC, and the AWGN channel. These results provide a useful standard against which to measure many popular codes including turbo codes, e.g., there exist turbo codes that perform within 0.6 dB of the bounds over a wide range of block lengths.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126076029","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}
引用次数: 47
A new class of error-correcting codes 一类新的纠错码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708871
I. Cleju, A. Sirbu
{"title":"A new class of error-correcting codes","authors":"I. Cleju, A. Sirbu","doi":"10.1109/ISIT.1998.708871","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708871","url":null,"abstract":"In this paper we present a new method for code construction that implies the choice of the codewords one by one, by means of a special computer implementable selection algorithm. Applying this method, we have obtained binary and nonbinary, individual and burst error-correcting block codes.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"23 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":"115118948","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
Turbo code performance as a function of code block size Turbo代码性能是代码块大小的函数
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708612
S. Dolinar, D. Divsalar, F. Pollara
{"title":"Turbo code performance as a function of code block size","authors":"S. Dolinar, D. Divsalar, F. Pollara","doi":"10.1109/ISIT.1998.708612","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708612","url":null,"abstract":"We show that a single family of turbo codes is \"nearly perfect\" with respect to Shannon's (1959) sphere-packing bound, over a wide range of code rates and block sizes. We also assess the \"imperfectness\" of various non-turbo codes for comparison,.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"20 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":"123127532","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}
引用次数: 35
The solution of a problem of Ulam on searching with lies 乌兰用谎言搜索的一个问题的解决
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708849
R. Hill, Jehangir P. Karim, E. Berlekamp
{"title":"The solution of a problem of Ulam on searching with lies","authors":"R. Hill, Jehangir P. Karim, E. Berlekamp","doi":"10.1109/ISIT.1998.708849","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708849","url":null,"abstract":"We consider Ulam's problem of determining the minimum number of yes-no queries to find an unknown integer between 1 and 2/sup 20/ if at most some given number e of the answers may be lies. Previously published papers have solved the problem for cases e=1,2,3 and 4. In this paper we solve the problem for all values of e.","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":"116650903","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}
引用次数: 17
Capacity for a power controlled CDMA system with linear receivers 具有线性接收器的功率控制CDMA系统的容量
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708710
P. Viswanath, V. Anantharam, David Tse
{"title":"Capacity for a power controlled CDMA system with linear receivers","authors":"P. Viswanath, V. Anantharam, David Tse","doi":"10.1109/ISIT.1998.708710","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708710","url":null,"abstract":"Capacity of networks with multiuser linear receivers together with efficient usage of the resources is analyzed in the uplink scenario of a single cell synchronous code division multiple access (CDMA) system. The capacity of the system is the maximum number of users per unit processing gain admissible in the system such that each user has its quality-of-service (QoS) requirement (expressed in terms of its desired signal-to-interference ratio) met. We characterize the capacity of a single cell for both the optimal linear receiver (MMSE receiver) and the matched filter receiver structures. This characterization of capacity has a simple \"effective bandwidth\" interpretation.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"92 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":"117107596","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
On source coding with side information for general distortion measures 一般失真测量中带侧信息的信源编码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708653
T. Linder, R. Zamir, K. Zeger
{"title":"On source coding with side information for general distortion measures","authors":"T. Linder, R. Zamir, K. Zeger","doi":"10.1109/ISIT.1998.708653","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708653","url":null,"abstract":"High resolution bounds in lossy coding of a real memoryless source are derived when side information is present. We consider locally quadratic distortion measures which may be functions of the side information and give asymptotically tight bounds on the conditional rate-distortion function R/sub X|Y/(D) (the side information is available at both the encoder and the decoder) and on the Wyner-Ziv rate-distortion function R/sup WZ/(D) (the side information is only available at the decoder). The rate loss R/sup WZ/(D)-R/sub X|Y/(D) is also investigated.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"36 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":"117187890","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 the solutions of an elliptic curve over a field of characteristic two 特征二域上椭圆曲线的解
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708679
I. Blake, G. Seroussi, R. Roth
{"title":"On the solutions of an elliptic curve over a field of characteristic two","authors":"I. Blake, G. Seroussi, R. Roth","doi":"10.1109/ISIT.1998.708679","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708679","url":null,"abstract":"Elliptic curves lie at the intersection of coding and cryptography. A key problem for both subjects is the determination of the number of points on the curve. For coding theory, the number of points one obtains is approximately the length of the code. For cryptography it is important that the group of points contain as large a subgroup of prime order as possible. In both cases the exact number of points is required. Using character theory and results on Kloosterman sums, information is obtained on the structure of solutions of a nonsingular elliptic curve over a finite field of characteristic two. A related enumeration problem of certain irreducible polynomials is also considered.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"4 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":"127263648","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
The trellis evolution algorithm for nonlinear block codes 非线性分组码的网格进化算法
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708859
W. Lin, R. McEliece, A. Kiely
{"title":"The trellis evolution algorithm for nonlinear block codes","authors":"W. Lin, R. McEliece, A. Kiely","doi":"10.1109/ISIT.1998.708859","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708859","url":null,"abstract":"An algorithm is proposed to search the desired trellis structure for block codes. It consists of a sequence of vertex mergings (evolutions) on a code graph. Any sequence of evolutions will result in the BCJR trellis (McEliece 1996) for linear codes. By searching all possible evolution paths, the desired trellis structure for nonlinear codes can be obtained. Vertex mergeability is examined to reduce the number of searches to a minimum, and lead to the progressive vertex set partition algorithm.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"51 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":"127545075","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
Surviving in a fast, nomadic world [mobile computing and communication] 在快速流动的世界中生存[移动计算和通信]
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708581
L. Kleinrock
{"title":"Surviving in a fast, nomadic world [mobile computing and communication]","authors":"L. Kleinrock","doi":"10.1109/ISIT.1998.708581","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708581","url":null,"abstract":"Summary form only given, as follows. Most of us are nomads in that we travel from place to place with a wild array of laptops, PDA's, cellular telephones, pagers, etc. We desire to have the same computing environment, services and system support in those locations as we have in our corporate offices. Indeed we desire \"anywhere, anytime\" connectivity. Unfortunately, as soon as we leave the comfort of our corporate environment and head out on the road, we lose all the basic capabilities we enjoy in that environment. Indeed, we often encounter the frustration of weak (or no) connectivity, tiny keyboards, lack of interoperability, loss of backup, foreign environments, and inadequate support in general. We discuss how our computing and communications technology has brought us to this point, some of the open issues that must be addressed as we seek to develop the system support necessary to provide a rich set of capabilities and services to these nomads in a transparent and convenient form, and where we see this is likely to evolve in the future. We also discuss some of the emerging solutions to the problems raised by this revolution in the use of information technology.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"25 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":"125015823","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学术文献互助群
群 号：481959085
Book学术官方微信