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

Block Source Coding with Sequential Encoding 块源编码与顺序编码

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

Hamid Ghourchian, Photios A. Stavrou, T. Oechtering, M. Skoglund

引用次数: 1

Relaxed Wyner’s Common Information 放松怀纳的共同信息

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

Erixhen Sula, M. Gastpar

引用次数: 11

Coordination Coding with Causal Decoder for Vector-valued Witsenhausen Counterexample Setups 矢量值Witsenhausen反例设置的因果解码器协调编码

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

T. Oechtering, M. L. Treust

引用次数: 3

Endurance-Limited Memories with Informed Decoder 耐力有限的记忆与知情解码器

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

Y. M. Chee, M. Horovitz, A. Vardy, Van Khu Vu, Eitan Yaakobi

{"title":"Endurance-Limited Memories with Informed Decoder","authors":"Y. M. Chee, M. Horovitz, A. Vardy, Van Khu Vu, Eitan Yaakobi","doi":"10.1109/ITW44776.2019.8989084","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989084","url":null,"abstract":"Non-volatile resistive memories, such as phase change memories and resistive random access memories, have attracted significant attention recently due to their scalability, speed, and rewritability. However, in order to use these memories in large-scale memory and storage systems, the limited endurance deficiency of these memories must be addressed. In a recent paper, we proposed a new coding scheme, called endurance-limited memories (ELM) codes, which increases the endurance of these memories by limiting the number of cell programming operations. Namely, an l-change t-write ELM code is a coding scheme that allows to write t messages into some n binary cells while guaranteeing that the number of times each cell is programmed is at most l. There are several models of these codes which depend upon the information that is available to the encoder and the decoder before each write. This information can be one of the following three options: 1. the number of times each cell has been programmed, 2. only the memory state before programming, or 3. no information is available on the cells’ state or previous writes. In this paper, we study the models in which the decoder knows on each write the number of times each cell has been programmed before the last write, while for the encoder we consider the aforementioned three possibilities.","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":"128624896","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

Channel Resolvability with a Full-Duplex Decode-and-Forward Relay 全双工译码转发中继的信道可分辨性

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

Noha Helal, M. Bloch, Aria Nosratinia

引用次数: 2

From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation 从邻接矩阵的谱到有向边矩阵的谱:用一个简单方程计算二部图的圈数

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

Ali Dehghan, A. Banihashemi

{"title":"From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation","authors":"Ali Dehghan, A. Banihashemi","doi":"10.1109/ITW44776.2019.8989394","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989394","url":null,"abstract":"Counting short cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. There are two computational approaches to count short cycles (with length smaller than 2g, where g is the girth of the graph) in bipartite graphs. The first approach is applicable to a general (irregular) bipartite graph, and uses the spectrum ${eta_{i}}$ of the directed edge matrix of the graph to compute the multiplicity Nk of k-cycles with $k lt 2g$ through the simple equation $N_{k} =sum_{i}eta_{i}^{k}/(2k)$. This approach has a computational complexity $O(|E|^{3})$, where $|E|$ is number of edges in the graph. The second approach is only applicable to bi-regular bipartite graphs, and uses the spectrum ${lambda_{i}}$ of the adjacency matrix (graph spectrum) and the degree sequences of the graph to compute Nk. The complexity of this approach is $O(|V|^{3})$, where $|V|$ is number of nodes in the graph. This complexity is less than that of the first approach, but the equations involved in the computations of the second approach are very tedious, particularly for $k geq g+6$. In this paper, we establish an analytical relationship between the two spectra ${eta_{i}}$ and ${lambda_{i}}$ for bi-regular bipartite graphs. Through this relationship, the former spectrum can be derived from the latter through simple equations. This allows the computation of Nk using $N_{k} =sum_{i}eta_{i}^{k}/(2k)$ but with a complexity of $O(|V|^{3})$ rather than $O(|E|^{3})$.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"48 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":"121459085","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

A Submodularity-based Clustering Algorithm for the Information Bottleneck and Privacy Funnel 基于子模块的信息瓶颈和隐私漏斗聚类算法

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

Ni Ding, P. Sadeghi

{"title":"A Submodularity-based Clustering Algorithm for the Information Bottleneck and Privacy Funnel","authors":"Ni Ding, P. Sadeghi","doi":"10.1109/ITW44776.2019.8989355","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989355","url":null,"abstract":"For the relevant data $S$ that nests in the observation $X$, the information bottleneck (IB) aims to encode $X$ into $hat {X}$ in order to maximize the extracted useful information $I(S;hat {X})$ with the minimum coding rate $I(X;hat {X})$. For the dual privacy tunnel (PF) problem where $S$ denotes the sensitive$/mathrm {p}mathrm {r}mathrm {i}mathrm {v}mathrm {a}mathrm {t}mathrm {e}wedge $ data, the goal is to minimize the privacy leakage $I(S;X)$ while maintain a certain level of utility $I(X;hat {X})$. For both problems, we propose an efficient iterative agglomerative clustering algorithm based on the minimization of the difference of submodular functions (IAC-MDSF). It starts with the original alphabet $hat {mathcal {X}}:= mathcal {X}$ and iteratively merges the elements in the current alphabet $ hat {mathcal {X}}$ that optimizes the Lagrangian function $I(S;hat {X})-lambda I(X;X)$. We prove that the best merge in each iteration of IAC-MDSF can be searched efficiently over all subsets of $hat {mathcal {X}}$ by the existing MDSF algorithms. By varying the value of the Lagrangian multiplier $lambda $, we obtain the experimental results on a heart disease data set in terms of the Pareto frontier: $I(S;hat {X}) mathrm {v}mathrm {s}. -I(X;hat {X})$. We show that our IAC-MDSF algorithm outperforms the existing iterative pairwise merge approaches for both PF and IB and is computationally much less complex.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"11 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":"115451719","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

Multiple Access Channels with Byzantine Users 具有拜占庭用户的多址通道

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

Neha Sangwan, Mayank Bakshi, B. Dey, V. Prabhakaran

引用次数: 7

Source coding with side information for binary memoryless sources 带有二进制无内存源侧信息的源编码

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

I. Bocharova, B. Kudryashov

{"title":"Source coding with side information for binary memoryless sources","authors":"I. Bocharova, B. Kudryashov","doi":"10.1109/ITW44776.2019.8989169","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989169","url":null,"abstract":"In this paper, we study a classical problem of source coding with side information available at the decoder. This problem is known as the Wyner-Ahlswede-Korner (WAK) problem. Nowadays, the interest in this problem is related to the concept of distributed source coding which implies coding of correlated sources under restriction that their encoders cannot cooperate. Most of the practical coding schemes consider a specific case of the binary symmetric source with uniform distribution and side information assumed to be perfectly known to the decoder. In this paper, we concentrate on a more complicated model of the binary source. Moreover, we consider a case when side information is lossy encoded. First we generalize the approach by Gu et al. [1] in order to obtain a lower bound on the achievable rates for a general binary source. Then, a new practical “multi-class” coding scheme for this binary source with uncoded binary side information is suggested. Simulation results for LDPC-based coding for both binary symmetric and general binary sources are presented for scenarios with trellis-coded and uncoded side information, respectively. Comparisons with the previously known numerical results are presented.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"70 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":"129087967","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

Sequential Classification with Empirically Observed Statistics 顺序分类与经验观察统计

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

Mahdi Haghifam, V. Tan, A. Khisti

引用次数: 11