2012 IEEE Information Theory Workshop最新文献_第8页

On transmission of multiple Gaussian sources over a Gaussian MAC using a VQLC mapping 用VQLC映射在高斯MAC上传输多个高斯源

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404726

Pål Anders Floor, A. N. Kim, T. Ramstad, I. Balasingham

引用次数: 8

A DC-free multi-mode run-length limited coding scheme 一种无直流多模运行长度限制编码方案

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404670

C. H. Heymann, H. C. Ferreira, J. Weber

引用次数: 1

On multicasting nested message sets over combination networks 在组合网络上多播嵌套消息集

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404696

S. S. Bidokhti, V. Prabhakaran, S. Diggavi

引用次数: 3

On feedback, cribbing, and causal state-information on the multiple-access channel 多址信道上的反馈、抓取和因果状态信息

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404642

A. Bracher, A. Lapidoth, Y. Steinberg

引用次数: 11

On Witsenhausen's counterexample: The asymptotic vector case 关于Witsenhausen反例:渐近向量情况

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404649

Chiranjib Choudhuri, U. Mitra

引用次数: 21

Common randomness amplification: A constructive view 共同随机性放大:建设性观点

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404693

Grégory Demay, U. Maurer

引用次数: 1

Molecular communication between two populations of bacteria 两个细菌种群之间的分子通讯

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404710

Arash Einolghozati, Mohsen Sardari, F. Fekri

{"title":"Molecular communication between two populations of bacteria","authors":"Arash Einolghozati, Mohsen Sardari, F. Fekri","doi":"10.1109/ITW.2012.6404710","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404710","url":null,"abstract":"Molecular communication is an expanding body of research. Recent advances in biology have encouraged using genetically engineered bacteria as the main component in the molecular communication. This has stimulated a new line of research that attempts to study molecular communication among bacteria from an information-theoretic point of view. Due to high randomness in the individual behavior of the bacterium, reliable communication between two bacteria is almost impossible. Therefore, we recently proposed that a population of bacteria in a cluster is considered as a node capable of molecular transmission and reception. This proposition enables us to form a reliable node out of many unreliable bacteria. The bacteria inside a node sense the environment and respond accordingly. In this paper, we study the communication between two nodes, one acting as the transmitter and the other as the receiver. We consider the case in which the information is encoded in the concentration of molecules by the transmitter. The molecules produced by the bacteria in the transmitter node propagate in the environment via the diffusion process. Then, their concentration sensed by the bacteria in the receiver node would decode the information. The randomness in the communication is caused by both the error in the molecular production at the transmitter and the reception of molecules at the receiver. We study the theoretical limits of the information transfer rate in such a setup versus the number of bacteria per node. Finally, we consider M-ary modulation schemes and study the achievable rates and their error probabilities.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"182 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":"116607150","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

On common information and the encoding of sources that are not successively refinable 关于公共信息和不能连续细化的源的编码

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404641

Kumar Viswanatha, E. Akyol, Tejaswi Nanjundaswamy, K. Rose

{"title":"On common information and the encoding of sources that are not successively refinable","authors":"Kumar Viswanatha, E. Akyol, Tejaswi Nanjundaswamy, K. Rose","doi":"10.1109/ITW.2012.6404641","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404641","url":null,"abstract":"This paper focuses on a new framework for scalable coding of information based on principles derived from common information of two dependent random variables. In the conventional successive refinement setting, the encoder generates two layers of information called the base layer and the enhancement layer. The first decoder, which receives only the base layer, produces a coarse reconstruction of the source, whereas the second decoder, which receives both the layers, uses the enhancement layer to refine the information further leading to a finer reconstruction. It is popularly known that asymptotic rate-distortion optimality at both the decoders is possible if and only if the source-distortion pair is successively refinable. However when the source is not successively refinable under the given distortion metric, it is impossible to achieve rate-distortion optimality at both the layers simultaneously. For this reason, most practical system designers resort to storing two individual representations of the source leading to significant overhead in transmission/storage costs. Inspired by the breadth of applications, in this paper, we propose a new framework for scalable coding wherein a subset of the bits sent to the first decoder is not sent to the second decoder. That is, the encoder generates one common bit stream which is routed to both the decoders, but unlike the conventional successive refinement setting, both the decoders receive an additional individual bitstream. By relating the proposed framework with the problem of common information of two dependent random variables, we derive a single letter characterization for the minimum sum rate achievable for the proposed setting when the two decoders are constrained to receive information at their respective rate-distortion functions. We show using a simple example that the proposed framework provides a strictly better asymptotic sum rate as opposed to the conventional scalable coding setup when the source-distortion pair is not successively refinable.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"14 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":"128391862","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

Construction of irregular histograms by penalized maximum likelihood: A comparative study 用惩罚极大似然法构造不规则直方图的比较研究

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404679

Panu Luosto, C. Giurcăneanu, P. Kontkanen

引用次数: 4

From channel codes to computation codes 从信道码到计算码

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404688

François Simon

引用次数: 1