2019 IEEE Information Theory Workshop (ITW)最新文献_第8页

Trellis-based Decoding Techniques for Polar Codes with Large Kernels 基于栅格的大核极码解码技术

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989386

P. Trifonov

引用次数: 9

Properties of the Conditional Mean Estimator in Poisson Noise 泊松噪声中条件均值估计量的性质

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989246

Alex Dytso, H. Poor

引用次数: 2

On Characterization of Entropic Vectors at the Boundary of Almost Entropic Cones 概熵锥边界上熵向量的刻画

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989116

Hitika Tiwari, Satyajit Thakor

引用次数: 3

On The Stability Region of the Layered Packet Erasure Broadcast Channel with Output Feedback 带输出反馈的分层包擦除广播信道的稳定域研究

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989326

Siyao Li, H. Seferoglu, Daniela Tuninetti, N. Devroye

引用次数: 2

Capacity of Wideband Multipath Fading Networks with Physically Degraded Broadcast 带物理退化广播的宽带多径衰落网络容量研究

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989322

D. C. González, Salman Salamatian, M. Médard, M. Yacoub

引用次数: 0

Mismatched Guesswork and One-to-One Codes 不匹配的猜测和一对一的代码

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989381

Salman Salamatian, Litian Liu, Ahmad Beirami, M. Médard

{"title":"Mismatched Guesswork and One-to-One Codes","authors":"Salman Salamatian, Litian Liu, Ahmad Beirami, M. Médard","doi":"10.1109/ITW44776.2019.8989381","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989381","url":null,"abstract":"We study the problem of mismatched guesswork, where we evaluate the number of symbols $y in mathcal{Y}$ which have higher likelihood than $X sim mu$ according to a mismatched distribution μ. We discuss the role of the tilted/exponential families of the source distribution μ and of the mismatched distribution ν. We show that the value of guesswork can be characterized using the tilted family of the mismatched distribution v, while the probability of guessing is characterized by an exponential family which passes through μ. Using this characterization, we demonstrate that the mismatched guesswork follows a large deviation principle (LDP), where the rate function is described implicitly using information theoretic quantities. We apply these results to one-to-one source coding (without prefix free constraint) to obtain the cost of mismatch in terms of average codeword length. We show that the cost of mismatch in one-to-one codes is no larger than that of the prefix-free codes, i.e., $D(muVertnu)$. Further, the cost of mismatch vanishes if and only if ν lies on the tilted family of the true distribution μ, which is in stark contrast to the prefix-free codes. These results imply that one-to-one codes are inherently more robust to mismatch.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"8 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126128874","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

Optimizing Polar Codes Compatible with Off-the-Shelf LDPC Decoders 优化极性码兼容现成的LDPC解码器

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989269

Moustafa Ebada, Ahmed Elkelesh, S. Brink

引用次数: 1

Codebooks of Complex Lines Based on Binary Subspace Chirps 基于二进制子空间啁啾的复线码本

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989259

O. Tirkkonen, A. Calderbank

{"title":"Codebooks of Complex Lines Based on Binary Subspace Chirps","authors":"O. Tirkkonen, A. Calderbank","doi":"10.1109/ITW44776.2019.8989259","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989259","url":null,"abstract":"Motivated by problems in machine-type wireless communications, we consider codebooks of complex Grassmannian lines in $N = 2^{m}$ dimensions. Binary Chirp (BC) codebooks of prior art are expanded to codebooks of Binary Subspace Chirps (BSSCs), where there is a binary chirp in a subset of the dimensions, while in the remaining dimensions there is a zero. BSSC codebooks have the same minimum distance as BC codebooks, while the cardinality is asymptotically 2.38 times larger. We discuss how BC codebooks can be understood in terms of a subset of the binary symplectic group $mathrm{S}mathrm{p}(2m, 2)$ in 2m dimensions; $mathrm{S}mathrm{p}(2m, 2)$ is isomorphic to a quotient group of the Clifford group acting on the codewords in N dimensions. The Bruhat decomposition of $mathrm{S}mathrm{p}(2m, 2)$ can be described in terms of binary subspaces in m dimensions, with ranks ranging from $r=0$ to $r=m$. We provide a unique parameterization of the decomposition. The BCs arise directly from the full-rank part of the decomposition, while BSSCs are a group code arising from the action of the full group with generic r. The rank of the binary subspace is directly related to the number of zeros (sparsity) in the BSSC. We develop a reconstruction algorithm that finds the correct codeword with $O(Nlog^{2}N)$ complexity, and present performance results in an additive white Gaussian noise scenario.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123173283","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

Degree Tables for Secure Distributed Matrix Multiplication 安全分布式矩阵乘法的度数表

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989092

Rafael G. L. D'Oliveira, S. Rouayheb, Daniel Heinlein, David A. Karpuk

引用次数: 28

Multi-access coded caching: gains beyond cache-redundancy 多访问编码缓存:超越缓存冗余的收益

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989128

Berksan Serbetci, Emanuele Parrinello, P. Elia

引用次数: 40