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

2008 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Linear complexity of prime n-square sequences 素数n平方序列的线性复杂度
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595422
Young-Joon Kim, Hong‐Yeop Song
{"title":"Linear complexity of prime n-square sequences","authors":"Young-Joon Kim, Hong‐Yeop Song","doi":"10.1109/ISIT.2008.4595422","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595422","url":null,"abstract":"We review prime n-square sequences of length pn which is originally defined by Ding and Helleseth in 1998, where p is an odd prime and n is a positive integer. In this paper, we determine the linear complexity and the minimal polynomial of these sequences for any n. It turned out that these sequences have linear complexity that is of the order of the period pn.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124464735","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
Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction 用于重复累加累加(RAA)代码构造的显式交织器
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595333
V. Guruswami, Widad Machmouchi
{"title":"Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction","authors":"V. Guruswami, Widad Machmouchi","doi":"10.1109/ISIT.2008.4595333","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595333","url":null,"abstract":"Repeat accumulate accumulate (RAA) codes are turbo-like codes where the message is first repeated k ges 2 times, passed through a first permutation (called interleaver), then an accumulator, then a second permutation, and finally a second accumulator. Bazzi, Mahdian, and Spielman (2003) prove that RAA codes are asymptotically good with high probability when the two permutations are chosen at random. RAA codes admit linear-time encoding algorithms, and are perhaps the simplest known family of linear-time encodable asymptotically good codes. An explicit construction of an asymptotically good RAA code is thus a very interesting goal. We focus on the case when k = 2 and we consider a variation of RAA codes where the inner repeat accumulate code is systematic. We give an explicit construction of the first permutation for which we show that the resulting code is asymptotically good with high probability when the second permutation is chosen at random. The explicit construction uses a cubic Hamiltonian graph with logarithmic girth.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125761773","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
Transmitter optimization and power allocation in double-scattering MIMO multiple access channels 双散射MIMO多址信道中发射机优化与功率分配
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595121
Xiao Li, Shi Jin, Xiqi Gao, M. Mckay
{"title":"Transmitter optimization and power allocation in double-scattering MIMO multiple access channels","authors":"Xiao Li, Shi Jin, Xiqi Gao, M. Mckay","doi":"10.1109/ISIT.2008.4595121","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595121","url":null,"abstract":"We investigate the sum capacity of a fading multiple-input multiple-output (MIMO) multiple access channel (MAC) under a general class of fading, known as double-scattering. We assume the receiver has perfect channel state information (CSI), while the transmitters only have access to statistical CSI. We show that the optimum transmit directions for each user coincide with the eigenvectors of the userpsilas own transmit spatial correlation matrix. We also derive new closed-form upper bounds on the sum capacity of the MIMO-MAC under double-scattering, which we employ to obtain suboptimal power allocation policies. These policies are easy to compute, and require each user to know only their own channel statistics.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126137505","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 capacity regions of some classes of deterministic relay channels 一类确定性中继信道的容量区域
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595005
Hon-Fah Chong, M. Motani
{"title":"The capacity regions of some classes of deterministic relay channels","authors":"Hon-Fah Chong, M. Motani","doi":"10.1109/ISIT.2008.4595005","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595005","url":null,"abstract":"The capacity regions of two new classes of deterministic relay channels are established. In the first class of deterministic relay channels, the family of conditional probability distributions describing the relay channel can be written as p(y<sub>2</sub>, y<sub>3</sub>|x<sub>1</sub>, x<sub>2</sub>)=p(y<sub>3</sub>|x<sub>1</sub>, x<sub>2</sub>)p(y<sub>2</sub>|s, x<sub>2</sub>, y<sub>3</sub>) where s is a deterministic function of x<sub>1</sub>, i.e., s=f<sub>1</sub>(x<sub>1</sub>). In addition, we require that Srarr(X<sub>2</sub>, Y<sub>2</sub>)rarrY<sub>3</sub> form a Markov chain for all input probability distributions p(x<sub>1</sub>, x<sub>2</sub>). In the second class of deterministic relay channels, there is causal noiseless feedback from relay to sender and the relay output is a deterministic function of x<sub>1</sub>, x<sub>2</sub>, and y<sub>3</sub>, i.e., y<sub>2</sub>=f<sub>3</sub>(x<sub>2</sub>, x<sub>2</sub>, y<sub>3</sub>). We consider two alternative schemes to achieve the capacity. The first is based on a generalized strategy of Gabbai and Bross. The second strategy is based on a ldquohash-and-forwardrdquo scheme by Cover and Kim.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124772870","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
Further results on relative redundancy 关于相对冗余的进一步结果
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595327
Hirakendu Das, A. Orlitsky, N. Santhanam, Junan Zhang
{"title":"Further results on relative redundancy","authors":"Hirakendu Das, A. Orlitsky, N. Santhanam, Junan Zhang","doi":"10.1109/ISIT.2008.4595327","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595327","url":null,"abstract":"Standard redundancy measures the excess number of bits needed to compress a sequence as a function of the sequencepsilas length. Since long sequences can have arbitrarily low minimum description length (MDL), even low standard redundancy can be arbitarily high compared to the sequencepsilas MDL. By contrast, relative redundancy evaluates the excess number of bits as a function of the sequencepsilas MDL. Hence unlike standard redundancy, low relative redundancy implies that the number of bits needed to compress any sequence is essentially the lowest possible. Results in [1] show that for iid distributions over binary alphabets, block relative redundancy essentially equals block standard redundancy while sequential relative redundancy is about twice its standard counterpart. We show that unlike binary alphabets, for larger alphabets both block and sequential relative redundancy essentially equal their standard counterparts. We also define and determine expected relative redundancy and show that it is almost same as worst-case relative redundancy.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"142 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129315143","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
Stability analysis of random linear coding across multicast sessions 随机线性编码跨组播会话的稳定性分析
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4594942
R. Cogill, B. Shrader, A. Ephremides
{"title":"Stability analysis of random linear coding across multicast sessions","authors":"R. Cogill, B. Shrader, A. Ephremides","doi":"10.1109/ISIT.2008.4594942","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4594942","url":null,"abstract":"We consider a problem of managing separate multicast sessions from a single transmitter. Each of K sessions has an associated packet stream, and a single transmitter must transmit these packet streams to a group of receivers. The multicast sessions are separate in the sense that each receiver only wants packets from one of the K streams. We will compare the maximum stable arrival rates that can be supported with and without using random linear coding across the K sessions. Intuitively, it seems that coding across sessions is not beneficial. Coding across sessions appears to introduce unnecessary additional delay since each receiver does not receive its next packet until it can decode the head-of-line packets from all K streams. However, we show that in many cases the maximum stable arrival rate that can be supported when coding across sessions is significantly greater than maximum stable arrival rate that can be supported when not coding across sessions. We provide a sufficient condition that indicates when coding across sessions is preferable. This condition is expressed in terms of the number of sessions, the number of receivers per session, and the reliability of the channels connecting the transmitter to the receivers.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129351244","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}
引用次数: 15
Basic limits on protocol information in slotted communication networks 槽式通信网络中协议信息的基本限制
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595401
Brian P. Dunn, J. N. Laneman
{"title":"Basic limits on protocol information in slotted communication networks","authors":"Brian P. Dunn, J. N. Laneman","doi":"10.1109/ISIT.2008.4595401","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595401","url":null,"abstract":"We investigate the amount of protocol information required for a communication network to meet an average delay constraint for the delivery of messages that arrive according to a Bernoulli random process. We obtain a lower bound on this overhead as a function of the arrival rate and average delay. Our model is a discretetime analog of the Poisson arrival process considered by Gallager, and we show that in the limit as slot duration goes to zero, Gallagerpsilas bound is recovered.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127450904","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}
引用次数: 9
Cryptographic primitives based on discrete-input AWGN channels 基于离散输入AWGN信道的密码原语
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595084
M. Isaka, Yuki Shimizu
{"title":"Cryptographic primitives based on discrete-input AWGN channels","authors":"M. Isaka, Yuki Shimizu","doi":"10.1109/ISIT.2008.4595084","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595084","url":null,"abstract":"Two cryptographic primitives, commitment and oblivious transfer, are devised based on the additive white Gaussian noise channel and discrete input alphabet. We present protocols and analyze the security and information theoretic efficiencies.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127459532","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
Transporting information and energy simultaneously 同时传递信息和能量
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595260
L. Varshney
{"title":"Transporting information and energy simultaneously","authors":"L. Varshney","doi":"10.1109/ISIT.2008.4595260","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595260","url":null,"abstract":"The fundamental tradeoff between the rates at which energy and reliable information can be transmitted over a single noisy line is studied. Engineering inspiration for this problem is provided by powerline communication, RFID systems, and covert packet timing systems as well as communication systems that scavenge received energy. A capacity-energy function is defined and a coding theorem is given. The capacity-energy function is a non-increasing concave cap function. Capacity-energy functions for several channels are computed.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127471653","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}
引用次数: 1683
DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks 多跳合作网络的DMT——第一部分:k -并行路径网络
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595355
K. Sreeram, B. Sasidharan, P. V. Kumar
{"title":"DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks","authors":"K. Sreeram, B. Sasidharan, P. V. Kumar","doi":"10.1109/ISIT.2008.4595355","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595355","url":null,"abstract":"We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single- antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: if-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K ges 4, and KPP(I) networks with K ges 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127492504","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术官方微信