Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404726
Pål Anders Floor, A. N. Kim, T. Ramstad, I. Balasingham
In this paper we generalize an existing distributed zero-delay joint source-channel coding scheme for communication of a multivariate Gaussian on a Gaussian Multiple Access Channel named Distributed Quantization Linear Coder (DQLC) to arbitrary code length. Although the DQLC is well performing, it leaves a certain gap to the performance upper bound (or distortion lower bound) based on arbitrary code length. The purpose of this paper is to determine if the generalization of the DQLC to arbitrary code length, named Vector Quantization Linear Coder (VQLC), can close the gap to the bound when the code length is large. Our results show that the VQLC mapping has the potential to reach the upper bound for any number of Gaussian sources at high SNR when the sources are uncorrelated. We also approximately determine the VQLC performance as a function of code length for the special case of two sources.
{"title":"On transmission of multiple Gaussian sources over a Gaussian MAC using a VQLC mapping","authors":"Pål Anders Floor, A. N. Kim, T. Ramstad, I. Balasingham","doi":"10.1109/ITW.2012.6404726","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404726","url":null,"abstract":"In this paper we generalize an existing distributed zero-delay joint source-channel coding scheme for communication of a multivariate Gaussian on a Gaussian Multiple Access Channel named Distributed Quantization Linear Coder (DQLC) to arbitrary code length. Although the DQLC is well performing, it leaves a certain gap to the performance upper bound (or distortion lower bound) based on arbitrary code length. The purpose of this paper is to determine if the generalization of the DQLC to arbitrary code length, named Vector Quantization Linear Coder (VQLC), can close the gap to the bound when the code length is large. Our results show that the VQLC mapping has the potential to reach the upper bound for any number of Gaussian sources at high SNR when the sources are uncorrelated. We also approximately determine the VQLC performance as a function of code length for the special case of two sources.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"12 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":"127856376","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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404652
Shun Watanabe, Y. Oohama
In this paper, we consider a situation such that legitimate parties, Alice and Bob, share an identical source to generate a secret key, and an eavesdropper, Eve, can access a correlated data that is stored in a storage with bounded size. Then, Alice and Bob want to extract a secret as long as possible. We show a privacy amplification theorem for this problem, i.e., we clarify the rate of key generation for given rate of Eve's storage. The problem can be regarded as a dual randomness generation problem of the Wyner-Ahlswede-Körner type source coding system, and the techniques used in the proof are exchanged, i.e., the so-called Markov lemma is used in the converse part, and the so-called image size characterization is used in the direct part.
{"title":"Privacy amplification theorem for bounded storage eavesdropper","authors":"Shun Watanabe, Y. Oohama","doi":"10.1109/ITW.2012.6404652","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404652","url":null,"abstract":"In this paper, we consider a situation such that legitimate parties, Alice and Bob, share an identical source to generate a secret key, and an eavesdropper, Eve, can access a correlated data that is stored in a storage with bounded size. Then, Alice and Bob want to extract a secret as long as possible. We show a privacy amplification theorem for this problem, i.e., we clarify the rate of key generation for given rate of Eve's storage. The problem can be regarded as a dual randomness generation problem of the Wyner-Ahlswede-Körner type source coding system, and the techniques used in the proof are exchanged, i.e., the so-called Markov lemma is used in the converse part, and the so-called image size characterization is used in the direct part.","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":"128539920","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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404693
Grégory Demay, U. Maurer
Common randomness is an important resource in many areas such as game theory and cryptography. We discuss the general problem of common randomness amplification between two distrustful parties connected by a communication channel and sharing some initial randomness. In this setting, both parties wish to agree on a common value distributed according to a target distribution by using their initial amount of common randomness and exchanging messages. Our results show that no protocol which is secure in a composable sense can significantly amplify the entropy initially shared by the parties.
{"title":"Common randomness amplification: A constructive view","authors":"Grégory Demay, U. Maurer","doi":"10.1109/ITW.2012.6404693","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404693","url":null,"abstract":"Common randomness is an important resource in many areas such as game theory and cryptography. We discuss the general problem of common randomness amplification between two distrustful parties connected by a communication channel and sharing some initial randomness. In this setting, both parties wish to agree on a common value distributed according to a target distribution by using their initial amount of common randomness and exchanging messages. Our results show that no protocol which is secure in a composable sense can significantly amplify the entropy initially shared by the parties.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"26 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":"116563824","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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404641
Kumar Viswanatha, E. Akyol, Tejaswi Nanjundaswamy, K. Rose
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.
{"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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404688
François Simon
In this paper, it is shown that a computation code exists for a stationary and ̅d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient channel code.
{"title":"From channel codes to computation codes","authors":"François Simon","doi":"10.1109/ITW.2012.6404688","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404688","url":null,"abstract":"In this paper, it is shown that a computation code exists for a stationary and ̅d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient channel code.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"3 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":"125544839","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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404649
Chiranjib Choudhuri, U. Mitra
Motivated by the presence of an implicit communication channel in the asymptotic version of Witsenhausen's counterexample, implicit discrete memoryless channels (IDMC) with discrete memoryless (DM) states are considered. Information-theoretic lower and upper bounds (based respectively on the ideas from rate-distortion theory and hybrid-coding) are derived on the optimal distortion in estimating the input of the implicit channel. The intuition gained from the DMIC with DM state model is then used to evaluate the optimal distortion for the asymptotic version of the Witsenhausen counterexample. The minimum distortion is characterized for the counterexample and it is shown that a combination of linear coding and dirty-paper coding (DPC) proposed in [1] achieves the minimum distortion.
{"title":"On Witsenhausen's counterexample: The asymptotic vector case","authors":"Chiranjib Choudhuri, U. Mitra","doi":"10.1109/ITW.2012.6404649","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404649","url":null,"abstract":"Motivated by the presence of an implicit communication channel in the asymptotic version of Witsenhausen's counterexample, implicit discrete memoryless channels (IDMC) with discrete memoryless (DM) states are considered. Information-theoretic lower and upper bounds (based respectively on the ideas from rate-distortion theory and hybrid-coding) are derived on the optimal distortion in estimating the input of the implicit channel. The intuition gained from the DMIC with DM state model is then used to evaluate the optimal distortion for the asymptotic version of the Witsenhausen counterexample. The minimum distortion is characterized for the counterexample and it is shown that a combination of linear coding and dirty-paper coding (DPC) proposed in [1] achieves the minimum distortion.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"26 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":"116743418","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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404716
A. Pierrot, M. Bloch
We present a practical coded cooperative jamming scheme for the problem of secure communications over the two-way wiretap channel. We design low-density parity-check (LDPC) based codes whose codewords interfere at the eavesdropper's terminal, thus providing secrecy. We show that our scheme can guarantee low information leakage rate, and we assess its precise performance for classical and spatially coupled LDPC codes.
{"title":"LDPC-based coded cooperative jamming codes","authors":"A. Pierrot, M. Bloch","doi":"10.1109/ITW.2012.6404716","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404716","url":null,"abstract":"We present a practical coded cooperative jamming scheme for the problem of secure communications over the two-way wiretap channel. We design low-density parity-check (LDPC) based codes whose codewords interfere at the eavesdropper's terminal, thus providing secrecy. We show that our scheme can guarantee low information leakage rate, and we assess its precise performance for classical and spatially coupled LDPC codes.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"138 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":"117049174","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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404642
A. Bracher, A. Lapidoth, Y. Steinberg
We show that the capacity region of the state-dependent multiple-access channel (SD-MAC) with strictly-causally cribbing encoders is not enlarged if strictly-causal state-information (SI) and feedback are furnished to the encoders. We also derive the capacity region of the SD-MAC with causal SI at the cribbing encoders and show that Shannon strategies are optimal. Such strategies are generally suboptimal if the encoders access distinct SI. However, Shannon strategies are optimal and we have a characterization of the capacity region for the case where both encoders crib, causal SI is revealed to one encoder, and feedback is available to the other encoder.
{"title":"On feedback, cribbing, and causal state-information on the multiple-access channel","authors":"A. Bracher, A. Lapidoth, Y. Steinberg","doi":"10.1109/ITW.2012.6404642","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404642","url":null,"abstract":"We show that the capacity region of the state-dependent multiple-access channel (SD-MAC) with strictly-causally cribbing encoders is not enlarged if strictly-causal state-information (SI) and feedback are furnished to the encoders. We also derive the capacity region of the SD-MAC with causal SI at the cribbing encoders and show that Shannon strategies are optimal. Such strategies are generally suboptimal if the encoders access distinct SI. However, Shannon strategies are optimal and we have a characterization of the capacity region for the case where both encoders crib, causal SI is revealed to one encoder, and feedback is available to the other encoder.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"143 2 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":"116715899","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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404696
S. S. Bidokhti, V. Prabhakaran, S. Diggavi
In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the higher priority messages. We give a complete rate region characterization over combination networks with three public and any number of private receivers, where achievability is through linear coding. Our encoding scheme is general and characterizes an achievable region for arbitrary number of public and private receivers.
{"title":"On multicasting nested message sets over combination networks","authors":"S. S. Bidokhti, V. Prabhakaran, S. Diggavi","doi":"10.1109/ITW.2012.6404696","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404696","url":null,"abstract":"In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the higher priority messages. We give a complete rate region characterization over combination networks with three public and any number of private receivers, where achievability is through linear coding. Our encoding scheme is general and characterizes an achievable region for arbitrary number of public and private receivers.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"52 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":"127153828","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}
Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404768
Y. Ishai
Summary form only given. A protocol for secure computation allows two or more parties to perform a distributed computation on their local inputs while hiding the inputs from each other. In the so-called “information theoretic” setting for secure computation, the parties are assumed to communicate over secure channels and the inputs should remain hidden even from computationally unbounded parties. It is known that every computation can done securely when there is a majority of honest parties, or alternatively when the parties are given access to certain types of correlated secret randomness. However, the true cost of such secure computations remains wide open. The talk will survey some recent progress and open questions in this area.
{"title":"The complexity of information theoretic secure computation","authors":"Y. Ishai","doi":"10.1109/ITW.2012.6404768","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404768","url":null,"abstract":"Summary form only given. A protocol for secure computation allows two or more parties to perform a distributed computation on their local inputs while hiding the inputs from each other. In the so-called “information theoretic” setting for secure computation, the parties are assumed to communicate over secure channels and the inputs should remain hidden even from computationally unbounded parties. It is known that every computation can done securely when there is a majority of honest parties, or alternatively when the parties are given access to certain types of correlated secret randomness. However, the true cost of such secure computations remains wide open. The talk will survey some recent progress and open questions in this area.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"9 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":"124802004","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：