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

2012 IEEE Information Theory Workshop最新文献

筛选
英文 中文
Design of binary polar codes with arbitrary kernel 任意核二进制极码的设计
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404639
Vera Miloslavskaya, P. Trifonov
{"title":"Design of binary polar codes with arbitrary kernel","authors":"Vera Miloslavskaya, P. Trifonov","doi":"10.1109/ITW.2012.6404639","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404639","url":null,"abstract":"The problem of construction of binary polar codes with high-dimensional kernels is considered. A novel method for computing the erasure probability in the bit subchannels induced by the polarization kernel is proposed. The codes obtained using the proposed method outperform those based on the Arikan kernel.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114121065","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
Simultaneously generating multiple keys and multi-commodity flow in networks 同时在网络中产生多密钥和多商品流
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404753
L. Lai, Siu-Wai Ho
{"title":"Simultaneously generating multiple keys and multi-commodity flow in networks","authors":"L. Lai, Siu-Wai Ho","doi":"10.1109/ITW.2012.6404753","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404753","url":null,"abstract":"The problem of simultaneously generating multiple independent keys for multiple pairs of users is considered. This problem is motivated by the fact that typically in wireless networks, multiple pairs of users need to establish secret keys for secure communications between these pairs. We propose a secure routing based key distribution approach to establish keys for the terminals. This approach connects the problem at the hand to that of multi-commodity flow problem studied in graph theory. Using the Max Bi-Flow Min Cut Theorem in the graph theory and developing a matching outer-bound, we show that the proposed approach achieves the key capacity region for the case of establishing two keys. For the general case of establishing more than two keys, an upper bound on the achievable sum rate is derived based on the concept of multicut and our proposed approach can achieve a sum rate equals to the upper bound divided by a constant factor.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"307 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116116674","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}
引用次数: 20
Characterizing the rate region of the coded side-information problem 描述了编码侧信息问题的速率区域
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404685
I. Land, C. Weidmann, B. Vellambi
{"title":"Characterizing the rate region of the coded side-information problem","authors":"I. Land, C. Weidmann, B. Vellambi","doi":"10.1109/ITW.2012.6404685","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404685","url":null,"abstract":"This paper revisits earlier work on the achievable rate-region for the coded side-information problem. For specific source distributions we provide computable extreme rate points. As opposed to previous works, we present short and concise proofs and additional rate points below the time-sharing line of previously known rate points. Our results are based on a formulation as an optimization problem.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122499735","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
Optimizing Quantize-Map-and-Forward relaying for Gaussian diamond networks 高斯菱形网络的量化映射-前向中继优化
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404698
Ayan Sengupta, I-Hsiang Wang, C. Fragouli
{"title":"Optimizing Quantize-Map-and-Forward relaying for Gaussian diamond networks","authors":"Ayan Sengupta, I-Hsiang Wang, C. Fragouli","doi":"10.1109/ITW.2012.6404698","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404698","url":null,"abstract":"We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset upper bound these schemes can achieve in the context of diamond networks, and how much benefit is obtained by optimizing the quantizer distortions at the relays. First, with noise-level quantization, we point out that the worst-case gap from the cutset upper bound is (N + log2 N) bits/s/Hz. A better universal quantization level found without using channel state information (CSI) leads to a sharpened gap of log2 N + log2(1 + N) + N log2(1 + 1/N) bits/s/Hz. On the other hand, it turns out that finding the optimal distortion levels depending on the channel gains is a non-trivial problem in the general N-relay setup. We manage to solve the two-relay problem and the symmetric N-relay problem analytically, and show the improvement via numerical evaluations both in static as well as slow-fading channels.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133036076","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
Integer low-density lattices based on construction A 基于构造A的整数低密度格
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404707
N. Pietro, J. Boutros, G. Zémor, L. Brunel
{"title":"Integer low-density lattices based on construction A","authors":"N. Pietro, J. Boutros, G. Zémor, L. Brunel","doi":"10.1109/ITW.2012.6404707","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404707","url":null,"abstract":"We describe a new family of integer lattices built from construction A and non-binary LDPC codes. An iterative message-passing algorithm suitable for decoding in high dimensions is proposed. This family of lattices, referred to as LDA lattices, follows the recent transition of Euclidean codes from their classical theory to their modern approach as announced by the pioneering work of Loeliger (1997), Erez, Litsyn, and Zamir (2004-2005). Besides their excellent performance near the capacity limit, LDA lattice construction is conceptually simpler than previously proposed lattices based on multiple nested binary codes and LDA decoding is less complex than real-valued message passing.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130931655","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}
引用次数: 56
Efficient termination of spatially-coupled codes 空间耦合码的有效终止
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404682
Koji Tazoe, K. Kasai, K. Sakaniwa
{"title":"Efficient termination of spatially-coupled codes","authors":"Koji Tazoe, K. Kasai, K. Sakaniwa","doi":"10.1109/ITW.2012.6404682","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404682","url":null,"abstract":"Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and a memory-efficient sliding-window decoding algorithm. On the other hand, the encoder needs to solve large linear equations to terminate the encoding process. In this paper, we propose modified spatially-coupled codes. The modified (dl, dr, L) codes have less rate-loss, i.e., higher coding rate, and have the same threshold as (dl, dr, L) codes and are efficiently terminable by using an accumulator.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133994273","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}
引用次数: 14
Derandomized sampling algorithm for lattice decoding 格解码的非随机抽样算法
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404663
Z. Wang, Cong Ling
{"title":"Derandomized sampling algorithm for lattice decoding","authors":"Z. Wang, Cong Ling","doi":"10.1109/ITW.2012.6404663","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404663","url":null,"abstract":"The sampling decoding algorithm randomly samples lattice points and selects the closest one from the candidate list. Although it achieves a remarkable performance gain with polynomial complexity, there are two inherent issues due to random sampling, namely, repetition and missing of certain lattice points. To address these issues, a derandomized algorithm of sampling decoding is proposed with further performance improvement and complexity reduction. Given the sample size K, candidates are deterministically sampled if their probabilities P satisfy the threshold PK ≥ 1/2. By varying K, the decoder with low complexity enjoys a flexible performance between successive interference cancelation (SIC) and maximum-likelihood (ML) decoding.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116236667","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
Analysis of lattice codes for the many-to-one interference channel 多对一干涉信道的点阵码分析
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404706
M. Estela, Laura Luzzi, Cong Ling, J. Belfiore
{"title":"Analysis of lattice codes for the many-to-one interference channel","authors":"M. Estela, Laura Luzzi, Cong Ling, J. Belfiore","doi":"10.1109/ITW.2012.6404706","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404706","url":null,"abstract":"In this paper we consider the error performance analysis of lattice alignment for the many-to-one interference channel. An upper bound on the error probability for the first receiver when lattice codes are used is derived. More precisely, we consider the case of joint maximum-likelihood (ML) decoding of the desired signal and the sum of interfering signals, derive the union bound for the error probability in terms of the theta series of these lattices, and show that it is related to the flatness factor.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121023610","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
Strong secrecy in arbitrarily varying wiretap channels 在任意变化的窃听通道中具有很强的保密性
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404751
I. Bjelakovic, H. Boche, J. Sommerfeld
{"title":"Strong secrecy in arbitrarily varying wiretap channels","authors":"I. Bjelakovic, H. Boche, J. Sommerfeld","doi":"10.1109/ITW.2012.6404751","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404751","url":null,"abstract":"In this work the arbitrarily varying wiretap channel AVWC under the average error criterion and the strong secrecy criterion is studied. We show that in the case of a non-symmetrisable channel to the legitimate receiver the deterministic code secrecy capacity equals the random code secrecy capacity and thus we establish a result for the AVWC similar to that of Ahlswede's dichotomy for ordinary AVCs. We derive a lower bound on the random code secrecy capacity in the case of a best channel to the eavesdropper. We further prove upper bounds on the deterministic code secrecy capacity, which in special cases results in explicit expressions of the secrecy capacity.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115965729","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}
引用次数: 11
Robust distributed compression for cloud radio access networks 云无线接入网络的鲁棒分布式压缩
2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404667
Seok-Hwan Park, O. Simeone, O. Sahin, S. Shamai
{"title":"Robust distributed compression for cloud radio access networks","authors":"Seok-Hwan Park, O. Simeone, O. Sahin, S. Shamai","doi":"10.1109/ITW.2012.6404667","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404667","url":null,"abstract":"This work studies distributed compression for the uplink of a cloud radio access network, where multiple multi-antenna base stations (BSs) communicate with a central unit, also referred to as cloud decoder, via capacity-constrained back-haul links. Distributed source coding strategies are potentially beneficial since the signals received at different BSs are correlated. However, they require each BS to have information about the joint statistics of the received signals across the BSs, and are generally sensitive to uncertainties regarding such information. Motivated by this observation, a robust compression method is proposed to cope with uncertainties on the correlation of the received signals. The problem is formulated using a deterministic worst-case approach, and an algorithm is proposed that achieves a stationary point for the problem. From numerical results, it is observed that the proposed robust compression scheme compensates for a large fraction of the performance loss induced by the imperfect statistical information.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130391890","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}
引用次数: 55
首页 上一页
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学术官方微信