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

2015 IEEE Information Theory Workshop - Fall (ITW)最新文献

筛选
英文 中文
Lattice code design criterion for MIMO wiretap channels MIMO窃听信道的点阵码设计准则
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360779
Hamed Mirghasemi, J. Belfiore
{"title":"Lattice code design criterion for MIMO wiretap channels","authors":"Hamed Mirghasemi, J. Belfiore","doi":"10.1109/ITWF.2015.7360779","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360779","url":null,"abstract":"We consider the MIMO wiretap channel, where a legitimate transmitter (Alice) wishes to communicate a confidential message to the legitimate receiver (Bob) over a MIMO channel, while its messages are being eavesdropped by Eve through another MIMO channel. Supposing that Alice uses the nested lattice code proposed in [8], we characterize the expected value of amount of information leakage to Eve, and from minimizing this expected value, we derive a code design criterion for MIMO lattice wiretap codes. The special cases of block and fast fading channels are also studied. We also illustrate our lattice code design criterion using the Alamouti Code as the simplest MIMO code available in the literature.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132133306","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}
引用次数: 13
Duality between finite numbers of discrete multiple access and broadcast channels 有限数量的离散多址和广播信道之间的对偶性
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360755
Yanlin Geng, Fan Cheng
{"title":"Duality between finite numbers of discrete multiple access and broadcast channels","authors":"Yanlin Geng, Fan Cheng","doi":"10.1109/ITWF.2015.7360755","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360755","url":null,"abstract":"The duality between the capacity regions of Gaussian broadcast channels and Gaussian multiple access channels has been well established. However, there have been limited results for the discrete case. In this work, we show that we can express the capacity regions of a class of broadcast channels using the rate regions of a finite number of multiple access channels.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"104 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120872569","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
Coding theorems via linear codes: Joint decoding rate regions 线性码的编码定理:联合译码率区域
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360738
S. Lim, M. Gastpar
{"title":"Coding theorems via linear codes: Joint decoding rate regions","authors":"S. Lim, M. Gastpar","doi":"10.1109/ITWF.2015.7360738","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360738","url":null,"abstract":"In several problems in network information theory, it is important to jointly decode the codewords transmitted by several encoders. For ensembles of i.i.d. random codes, such joint decoding can be analyzed directly with standard methods. In this paper, we develop a general framework to analyze joint decoding for ensembles of random linear codes and ensembles of nested linear codes. The technical difficulty stems from the fact that codewords are not generally independent. As an initial test case, we first present a joint decoding region for the standard multiple access problem using nested linear codes. Based on this result, we further establish a joint decoding rate region for compute-forward over the DM-MAC.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115219625","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
Two dimensional error-correcting codes using finite field Fourier transform 利用有限域傅里叶变换的二维纠错码
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360746
Shounak Roy, S. G. Srinivasa
{"title":"Two dimensional error-correcting codes using finite field Fourier transform","authors":"Shounak Roy, S. G. Srinivasa","doi":"10.1109/ITWF.2015.7360746","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360746","url":null,"abstract":"We construct 2D codewords by using 2D finite field Fourier transform. The components of the codeword in the transformed domain are from an extension field GF(2m) and are linked by a conjugacy constraint. We provide encoding and decoding schemes in the transformed domain.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132762902","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
Alphabet-size dependent bounds for exact repair in distributed storage 在分布式存储中精确修复的依赖于字母大小的边界
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360722
V. Cadambe, A. Mazumdar
{"title":"Alphabet-size dependent bounds for exact repair in distributed storage","authors":"V. Cadambe, A. Mazumdar","doi":"10.1109/ITWF.2015.7360722","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360722","url":null,"abstract":"We use some simple techniques to derive a universal alphabet-size dependent bound on the parameters of erasure-correcting regenerating codes. It can be shown that the well-known previous bounds are special cases of our more general bound. In certain cases our bound leads to improvement over prior results.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129854269","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
Window decoding of Braided Convolutional Codes 编织卷积码的窗口解码
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360751
Min Zhu, David G. M. Mitchell, M. Lentmaier, D. Costello, B. Bai
{"title":"Window decoding of Braided Convolutional Codes","authors":"Min Zhu, David G. M. Mitchell, M. Lentmaier, D. Costello, B. Bai","doi":"10.1109/ITWF.2015.7360751","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360751","url":null,"abstract":"We consider a window decoding scheme for Braided Convolutional Codes (BCCs) based on the BCJR algorithm. We describe the principle of this decoding scheme and show that BCCs with window decoding exhibit excellent performance. The tradeoff between performance and decoding latency is examined and, to reduce decoding complexity, both uniform and nonuniform message passing schedules within the decoding window are considered. Finally, puncturing is employed to obtain rate-compatible code rates of 1/2 and 2/3 starting from a rate 1/3 example mother code. Simulation results show that, with nonuniform message passing and puncturing, near capacity performance can be maintained throughout the rate range considered with reasonable decoding complexity and no visible error floors.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131788644","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
Privacy on hypothesis testing in smart grids 智能电网假设检验中的隐私问题
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360791
Zuxing Li, T. Oechtering
{"title":"Privacy on hypothesis testing in smart grids","authors":"Zuxing Li, T. Oechtering","doi":"10.1109/ITWF.2015.7360791","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360791","url":null,"abstract":"In this paper, we study the problem of privacy information leakage in a smart grid. The privacy risk is assumed to be caused by an unauthorized binary hypothesis testing of the consumer's behaviour based on the smart meter readings of energy supplies from the energy provider. Another energy supplies are produced by an alternative energy source. A controller equipped with an energy storage device manages the energy inflows to satisfy the energy demand of the consumer. We study the optimal energy control strategy which minimizes the asymptotic exponential decay rate of the minimum Type II error probability in the unauthorized hypothesis testing to suppress the privacy risk. Our study shows that the cardinality of the energy supplies from the energy provider for the optimal control strategy is no more than two. This result implies a simple objective of the optimal energy control strategy. When additional side information is available for the adversary, the optimal control strategy and privacy risk are compared with the case of leaking smart meter readings to the adversary only.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"26 7-8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120892525","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}
引用次数: 22
On the exact volume of metric balls in complex Grassmann manifolds 关于复格拉斯曼流形中公制球的精确体积
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360783
Renaud-Alexandre Pitaval, Lu Wei, O. Tirkkonen, J. Corander
{"title":"On the exact volume of metric balls in complex Grassmann manifolds","authors":"Renaud-Alexandre Pitaval, Lu Wei, O. Tirkkonen, J. Corander","doi":"10.1109/ITWF.2015.7360783","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360783","url":null,"abstract":"We evaluate the volume of metric balls in complex Grassmann manifolds. The ball is defined as a set of hyperplanes of a fixed dimension with reference to a center of not necessarily the same dimension. The normalized volume of balls corresponds to the cumulative distribution of quantization error for uniformly-distributed sources, a problem notably related to rate-distortion analysis, and to packing bounds. A generalized chordal distance for unequal dimensional subspaces is used. First, a symmetry property between complementary balls is presented, extending previous small ball results to larger radius. Then, the volume is shown to be reducible to a one-dimensional integral representation, valid for any radius. Accordingly, the overall problem boils down to evaluating a determinant of a matrix of same size than the subspace dimensionality. Examples of explicit polynomial expressions emanating from the integral formulation are given.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126557632","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
Toward limits of constructing reliable memories from unreliable components 用不可靠的组件构建可靠的存储器的极限
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-17 DOI: 10.1109/ITWF.2015.7360745
L. Varshney
{"title":"Toward limits of constructing reliable memories from unreliable components","authors":"L. Varshney","doi":"10.1109/ITWF.2015.7360745","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360745","url":null,"abstract":"There has been long-standing interest in constructing reliable memory systems from unreliable components like noisy bit-cells and noisy logic gates, under circuit complexity constraints. Prior work has focused exclusively on constructive achievability results, but here we develop converse theorems for this problem for the first time. The basic technique relies on entropy production/dissipation arguments and balances the need to dissipate entropy with the redundancy of the code employed. A bound from the entropy dissipation capability of noisy logic gates is used via a sphere-packing argument. Although a large gap remains between refined achievability results stated herein and the converse, some suggestions for ways to move forward beyond this first step are provided.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123007331","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}
引用次数: 8
On the capacity achieving probability measures for molecular receivers 分子受体的容量实现概率测度
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-11-07 DOI: 10.1109/ITWF.2015.7360744
Mehrdad Tahmasbi, F. Fekri
{"title":"On the capacity achieving probability measures for molecular receivers","authors":"Mehrdad Tahmasbi, F. Fekri","doi":"10.1109/ITWF.2015.7360744","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360744","url":null,"abstract":"In this paper, diffusion-based molecular communication with ligand receptor receivers is studied. Information messages are assumed to be encoded via variations of the concentration of molecules. The randomness in the ligand reception process induces uncertainty in the communication; limiting the rate of information decoding. We model the ligand receptor receiver by a set of finite-state Markov channels and study the general capacity of such a receiver. Furthermore, the i.i.d. capacity of the receiver is characterized as a lower bound for the general capacity. It is also proved that a finite support probability measure can achieve the i.i.d. capacity of the receiver. Moreover, a bound on the number of points in the support of the probability measure is obtained.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132482836","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
首页 上一页 下一页 尾页
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学术官方微信