Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447104
Bahman Moraffah, L. Sankar
An information-theoretic mechanism for privacy-guaranteed interactions is introduced between two memoryless correlated sources where each source is characterized by a pair of public and private variables. The interactions are modeled as a collection of K/2 pairs of random mappings, one pair for each of the K rounds of interactions. The K/2 random mapping pairs are chosen jointly to minimize the information leakage (privacy measure) over K rounds of the private variable of each source at the other source while ensuring that a desired measure of utility (distortion) of the revealed public variable is satisfied. Arguing that an average case information-theoretic privacy metric can be appropriate for streaming data settings, this paper shows that in general, interaction reduces privacy leakage by drawing some parallels between this problem and the classic interactive source coding problem. Specifically, for the log-loss distortion metric it is shown that the resulting interaction problem is an analog of an interactive information bottleneck problem for which a one-shot interactive mechanism is, in general, not optimal. For the resulting problem with a non-convex constraint space, an algorithm that extends the one-way agglomerative information bottleneck algorithm to the interactive setting is introduced.
{"title":"Information-theoretic private interactive mechanism","authors":"Bahman Moraffah, L. Sankar","doi":"10.1109/ALLERTON.2015.7447104","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447104","url":null,"abstract":"An information-theoretic mechanism for privacy-guaranteed interactions is introduced between two memoryless correlated sources where each source is characterized by a pair of public and private variables. The interactions are modeled as a collection of K/2 pairs of random mappings, one pair for each of the K rounds of interactions. The K/2 random mapping pairs are chosen jointly to minimize the information leakage (privacy measure) over K rounds of the private variable of each source at the other source while ensuring that a desired measure of utility (distortion) of the revealed public variable is satisfied. Arguing that an average case information-theoretic privacy metric can be appropriate for streaming data settings, this paper shows that in general, interaction reduces privacy leakage by drawing some parallels between this problem and the classic interactive source coding problem. Specifically, for the log-loss distortion metric it is shown that the resulting interaction problem is an analog of an interactive information bottleneck problem for which a one-shot interactive mechanism is, in general, not optimal. For the resulting problem with a non-convex constraint space, an algorithm that extends the one-way agglomerative information bottleneck algorithm to the interactive setting is introduced.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115792496","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447046
Amir Salimi, M. Médard, Shuguang Cui
It has been shown that there is a duality between the linear network coding solution and the entropic vectors induced by collection of subspaces in a vector space over a finite field (dubbed linearly constructed entropic vectors). The region of all linearly constructed vectors, coincides with the set of all representable polymatroids. For any integer polymatroid, there is an associated matroid, which uniquely identifies the polymatroid. We conjecture that the representability of the underlying matroid is a sufficient condition for integer polymatroids to be linearly representable. We prove that the conjecture holds for representation over real numbers. Furthermore, we show that any real-valued submodular function (such as Shannon entropy) can be approximated (arbitrarily close) by an integer polymatroid.
{"title":"On the representability of integer polymatroids: Applications in linear code construction","authors":"Amir Salimi, M. Médard, Shuguang Cui","doi":"10.1109/ALLERTON.2015.7447046","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447046","url":null,"abstract":"It has been shown that there is a duality between the linear network coding solution and the entropic vectors induced by collection of subspaces in a vector space over a finite field (dubbed linearly constructed entropic vectors). The region of all linearly constructed vectors, coincides with the set of all representable polymatroids. For any integer polymatroid, there is an associated matroid, which uniquely identifies the polymatroid. We conjecture that the representability of the underlying matroid is a sufficient condition for integer polymatroids to be linearly representable. We prove that the conjecture holds for representation over real numbers. Furthermore, we show that any real-valued submodular function (such as Shannon entropy) can be approximated (arbitrarily close) by an integer polymatroid.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124497393","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447052
Aftab Ahmed, Erik I. Verriest
Analysis and design of present machining methods used in mechanical engineering are based on Taylor series approximations and linearizations which cause erroneous and anomalous results. High precision machining cannot tolerate such errors. We consider and analyze an exact mathematical model of the turning process without performing any kind of linearization of the model. We give a strategic design of an estimator for the position of a machining tool based on first principles. The system's dynamics are characterized by a nonlinear State-Dependent Delay Differential Equation (SD-DDE). This delay is extremely convoluted with the state by an implicit relation. The central tenet is to use inversion of the delay model and to extract the state vector given the delay. We use our recently developed observation technique referred to as Delay Injection. Both linear asymptotic and nonlinear observers with different architectures are designed for the state estimation of a machine tool based on state-dependent delay measurement. Simulation results are depicted at the end which portray the effectiveness, validity and usefulness of the proposed observer schemes.
{"title":"Design of linear & nonlinear observers for a turning process with implicit State-Dependent Delay","authors":"Aftab Ahmed, Erik I. Verriest","doi":"10.1109/ALLERTON.2015.7447052","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447052","url":null,"abstract":"Analysis and design of present machining methods used in mechanical engineering are based on Taylor series approximations and linearizations which cause erroneous and anomalous results. High precision machining cannot tolerate such errors. We consider and analyze an exact mathematical model of the turning process without performing any kind of linearization of the model. We give a strategic design of an estimator for the position of a machining tool based on first principles. The system's dynamics are characterized by a nonlinear State-Dependent Delay Differential Equation (SD-DDE). This delay is extremely convoluted with the state by an implicit relation. The central tenet is to use inversion of the delay model and to extract the state vector given the delay. We use our recently developed observation technique referred to as Delay Injection. Both linear asymptotic and nonlinear observers with different architectures are designed for the state estimation of a machine tool based on state-dependent delay measurement. Simulation results are depicted at the end which portray the effectiveness, validity and usefulness of the proposed observer schemes.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121883845","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447118
Abhishek K. Gupta, R. Jain, R. Rajagopal
A market comprising a scheduler with a renewable generator and a pumped water storage system, a certain number of flexible and inflexible loads, and a non-renewable generator is considered. At the beginning of activity, the scheduler receives the following three information from each of the loads - consumption (in MW), duration (in hours) and start window. The start window of a load is the time interval in which the load must be started. A load is inflexible if its start window is singleton. The loads are assumed to be non-preemptive, that is, after a load is started, it cannot be interrupted or paused, and it must be served for its duration. The goal of the scheduler is to develop a scheduling policy that minimizes the aggregate cost of buying electricity from the non-renewable generator. We develop an understanding of the nature of optimal solutions to such an optimization problem and propose an approximately optimal scheduling policy for a sufficiently wide class of scheduling problems.
{"title":"Scheduling, pricing, and efficiency of non-preemptive flexible loads under direct load control","authors":"Abhishek K. Gupta, R. Jain, R. Rajagopal","doi":"10.1109/ALLERTON.2015.7447118","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447118","url":null,"abstract":"A market comprising a scheduler with a renewable generator and a pumped water storage system, a certain number of flexible and inflexible loads, and a non-renewable generator is considered. At the beginning of activity, the scheduler receives the following three information from each of the loads - consumption (in MW), duration (in hours) and start window. The start window of a load is the time interval in which the load must be started. A load is inflexible if its start window is singleton. The loads are assumed to be non-preemptive, that is, after a load is started, it cannot be interrupted or paused, and it must be served for its duration. The goal of the scheduler is to develop a scheduling policy that minimizes the aggregate cost of buying electricity from the non-renewable generator. We develop an understanding of the nature of optimal solutions to such an optimization problem and propose an approximately optimal scheduling policy for a sufficiently wide class of scheduling problems.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126331852","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447102
P. Grover, J. Weldon, S. Kelly, Praveen Venkatesh, Haewon Jeong
It is widely believed in the clinical and biosciences community that Electroencephalography (EEG) is fundamentally limited in the spatial resolution achieved using a few hundred electrodes. This belief rests on the well known decay of high-spatial frequencies as the signal passes from the brain surface to the scalp surface. These high spatial frequencies carry high spatial resolution information about the source. However, recent experimental work as well as our theoretical and numerical analyses strongly suggest that EEG's resolution could be improved significantly through increased electrode density despite this decay. Somewhat counterintuitively, instead of viewing this decay of spatial frequencies as a detriment to signal quality (which it is), in this work we propose an information-theoretic strategy to harness this decay to reduce circuit area and energy needed for high-resolution signal acquisition. This is made possible by the observation that this spatial-low-pass filtering of the signal as it passes from the brain to the scalp induces large spatial correlations that can be exploited information-theoretically. The proposed techniques are shown in idealized head models to reduce requirements on energy required for sensing by 3×. These results are being applied towards an ongoing project on developing the “Neural Web,” a 10,000 electrode portable EEG system at CMU.
{"title":"An information theoretic technique for harnessing attenuation of high spatial frequencies to design ultra-high-density EEG","authors":"P. Grover, J. Weldon, S. Kelly, Praveen Venkatesh, Haewon Jeong","doi":"10.1109/ALLERTON.2015.7447102","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447102","url":null,"abstract":"It is widely believed in the clinical and biosciences community that Electroencephalography (EEG) is fundamentally limited in the spatial resolution achieved using a few hundred electrodes. This belief rests on the well known decay of high-spatial frequencies as the signal passes from the brain surface to the scalp surface. These high spatial frequencies carry high spatial resolution information about the source. However, recent experimental work as well as our theoretical and numerical analyses strongly suggest that EEG's resolution could be improved significantly through increased electrode density despite this decay. Somewhat counterintuitively, instead of viewing this decay of spatial frequencies as a detriment to signal quality (which it is), in this work we propose an information-theoretic strategy to harness this decay to reduce circuit area and energy needed for high-resolution signal acquisition. This is made possible by the observation that this spatial-low-pass filtering of the signal as it passes from the brain to the scalp induces large spatial correlations that can be exploited information-theoretically. The proposed techniques are shown in idealized head models to reduce requirements on energy required for sensing by 3×. These results are being applied towards an ongoing project on developing the “Neural Web,” a 10,000 electrode portable EEG system at CMU.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749269","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447055
Naci Saldi, S. Yüksel, T. Linder
We consider the finite-state approximation of a discrete-time constrained Markov decision process with compact state space, under the discounted cost criterion. Using the linear programming formulation of the constrained problem, we prove the convergence of the optimal value function of the finite-state model to the optimal value function of the original model. Under further continuity condition on the transition probability of the original model, we also establish a method to compute approximately optimal policies.
{"title":"Finite-state approximations to constrained Markov decision processes with Borel spaces","authors":"Naci Saldi, S. Yüksel, T. Linder","doi":"10.1109/ALLERTON.2015.7447055","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447055","url":null,"abstract":"We consider the finite-state approximation of a discrete-time constrained Markov decision process with compact state space, under the discounted cost criterion. Using the linear programming formulation of the constrained problem, we prove the convergence of the optimal value function of the finite-state model to the optimal value function of the original model. Under further continuity condition on the transition probability of the original model, we also establish a method to compute approximately optimal policies.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128061332","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447105
Vinay Praneeth Boda, P. Narayan
Consider a discrete memoryless multiple source with m component sources. A subset of k ≤ m sources are sampled at each time instant and jointly compressed in order to reconstruct all the m sources under a given distortion criterion. A sampling rate distortion function is characterized for the case of memoryless random sampling with the sampler possibly depending on the source outputs; and the decoder is informed of the sequence of sampled sets. Examining the structure of the optimal sampler, it is shown that deterministic sampling, characterized by a conditional point-mass, suffices. Restricted forms of sampling are also addressed. An upper bound for the sampling rate distortion function is provided when the decoder is not informed of the sequence of sampled sets.
{"title":"Memoryless sampling rate distortion","authors":"Vinay Praneeth Boda, P. Narayan","doi":"10.1109/ALLERTON.2015.7447105","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447105","url":null,"abstract":"Consider a discrete memoryless multiple source with m component sources. A subset of k ≤ m sources are sampled at each time instant and jointly compressed in order to reconstruct all the m sources under a given distortion criterion. A sampling rate distortion function is characterized for the case of memoryless random sampling with the sampler possibly depending on the source outputs; and the decoder is informed of the sequence of sampled sets. Examining the structure of the optimal sampler, it is shown that deterministic sampling, characterized by a conditional point-mass, suffices. Restricted forms of sampling are also addressed. An upper bound for the sampling rate distortion function is provided when the decoder is not informed of the sequence of sampled sets.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125090579","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447076
M. Khabbazian
Motivated by applications to distributed storage and computing, the multi-version coding problem was formulated by Wang and Cadambe in [4]. In this problem, a client sequently over time stores v independent versions of a message in a storage system with n server nodes. It is assumed that, a message version may not reach some servers, and that each server is unaware of what has been stored in other servers. The problem requires that any c servers must be able to reconstruct their latest common version. An extended multi-version problem introduced in [5] relaxes the above requirement by requiring any c servers to be able to reconstruct their latest common version or any version later than that. The objective in both the original and extended multi-version problem is to minimize the worst case storage cost. In this work, we propose codes for both the multi-version problem and its extension. For the original multi-version coding problem, we show that the storage cost of our proposed codes are near-optimal. For the extended multi-version coding problem, we show that the storage cost of our first algorithm is optimal when v|c - 1. Our second proposed extended multi-version code shows that storage cost of strictly less than one is achievable even when v is 50% larger than c. This is interesting, as the storage cost of existing codes becomes one as soon as v becomes larger than c.
{"title":"Near-optimal multi-version codes","authors":"M. Khabbazian","doi":"10.1109/ALLERTON.2015.7447076","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447076","url":null,"abstract":"Motivated by applications to distributed storage and computing, the multi-version coding problem was formulated by Wang and Cadambe in [4]. In this problem, a client sequently over time stores v independent versions of a message in a storage system with n server nodes. It is assumed that, a message version may not reach some servers, and that each server is unaware of what has been stored in other servers. The problem requires that any c servers must be able to reconstruct their latest common version. An extended multi-version problem introduced in [5] relaxes the above requirement by requiring any c servers to be able to reconstruct their latest common version or any version later than that. The objective in both the original and extended multi-version problem is to minimize the worst case storage cost. In this work, we propose codes for both the multi-version problem and its extension. For the original multi-version coding problem, we show that the storage cost of our proposed codes are near-optimal. For the extended multi-version coding problem, we show that the storage cost of our first algorithm is optimal when v|c - 1. Our second proposed extended multi-version code shows that storage cost of strictly less than one is achievable even when v is 50% larger than c. This is interesting, as the storage cost of existing codes becomes one as soon as v becomes larger than c.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121134255","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7446994
Santhosh Kumar, Avinash Vem, K. Narayanan, H. Pfister
The focus of this article is on low-complexity capacity-achieving coding schemes for write-once memory (WOM) systems. The construction is based on spatially-coupled compound LDGM/LDPC codes. Both noiseless systems and systems with read errors are considered. Compound LDGM/LDPC codes are known to achieve capacity under MAP decoding for the closely related Gelfand-Pinsker problem and their coset decomposition provides an elegant way to encode the messages while simultaneously providing error protection. The application of compound codes to the WOM system is new. The main result is that spatial coupling enables these codes to achieve the capacity region of the 2-write WOM system with low-complexity message-passing encoding and decoding algorithms.
{"title":"Spatially-coupled codes for write-once memories","authors":"Santhosh Kumar, Avinash Vem, K. Narayanan, H. Pfister","doi":"10.1109/ALLERTON.2015.7446994","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7446994","url":null,"abstract":"The focus of this article is on low-complexity capacity-achieving coding schemes for write-once memory (WOM) systems. The construction is based on spatially-coupled compound LDGM/LDPC codes. Both noiseless systems and systems with read errors are considered. Compound LDGM/LDPC codes are known to achieve capacity under MAP decoding for the closely related Gelfand-Pinsker problem and their coset decomposition provides an elegant way to encode the messages while simultaneously providing error protection. The application of compound codes to the WOM system is new. The main result is that spatial coupling enables these codes to achieve the capacity region of the 2-write WOM system with low-complexity message-passing encoding and decoding algorithms.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127203978","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 : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447035
Georg Pichler, P. Piantanida, G. Matz
A novel multi-terminal source coding problem motivated by biclustering applications is investigated. In this setting, two separate encoders observe two dependent memoryless processes Xn and Zn, respectively. The encoders' goal is to find rate-limited functions f(Xn) and g(Zn) that maximize asymptotically the mutual information I(f(Xn); g(Zn)) ≥ nμ. We derive non-trivial inner and outer bounds on the optimal characterization of the achievable rates for this problem. Applications also arise in the context of distributed hypothesis testing against independence under communication constraints.
{"title":"Distributed information-theoretic biclustering of two memoryless sources","authors":"Georg Pichler, P. Piantanida, G. Matz","doi":"10.1109/ALLERTON.2015.7447035","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447035","url":null,"abstract":"A novel multi-terminal source coding problem motivated by biclustering applications is investigated. In this setting, two separate encoders observe two dependent memoryless processes X<sup>n</sup> and Z<sup>n</sup>, respectively. The encoders' goal is to find rate-limited functions f(X<sup>n</sup>) and g(Z<sup>n</sup>) that maximize asymptotically the mutual information I(f(X<sup>n</sup>); g(Z<sup>n</sup>)) ≥ nμ. We derive non-trivial inner and outer bounds on the optimal characterization of the achievable rates for this problem. Applications also arise in the context of distributed hypothesis testing against independence under communication constraints.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126695529","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
扫码关注我们
求助内容：
应助结果提醒方式：