By Topic

Information Theory Workshop (ITW), 2012 IEEE

Date 3-7 Sept. 2012

Filter Results

Displaying Results 1 - 25 of 141
  • Index

    Publication Year: 2012, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Committees

    Publication Year: 2012, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • An information-theoretic protocol compiler

    Publication Year: 2012, Page(s):1 - 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    One of the most fundamental goals in cryptography is to design protocols that remain secure when adversarial participants can engage in arbitrary malicious behavior. In 1986, Goldreich, Micali, and Wigderson presented a powerful paradigm for designing such protocols: their approach reduced the task of designing secure protocols to designing protocols that only guarantee security against “ho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • To code or not to code: Revisited

    Publication Year: 2012, Page(s):5 - 9
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (502 KB) | HTML iconHTML

    We revisit the dilemma of whether one should or should not code when operating under delay constraints. In those curious cases when the source and the channel are probabilistically matched so that symbol-by-symbol coding is optimal in terms of the average distortion achieved, we show that it also achieves the dispersion of joint source-channel coding. Moreover, even in the absence of such probabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Results on combinatorial joint source-channel coding

    Publication Year: 2012, Page(s):10 - 14
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (307 KB) | HTML iconHTML

    This paper continues the investigation of the combinatorial formulation of the joint source-channel coding problem. In particular, the connections are drawn to error-reducing codes, isometric embeddings and list-decodable codes. The optimal performance for the repetition construction is derived and is shown to be achievable by low complexity Markov decoders. The compound variation of the problem i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On uncoded transmission and blocklength

    Publication Year: 2012, Page(s):15 - 19
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (461 KB) | HTML iconHTML

    This work considers the definition of the excess-distortion exponent, used to measure the asymptotic finite blocklength behavior of joint source-channel coding. We arrive at the conclusion that it is not a meaningful measure for the operational tradeoffs of a scheme. We propose a new definition, which makes a distinction between the processing block of the coding scheme (which implies delay and ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced complexity window decoding schedules for coupled LDPC codes

    Publication Year: 2012, Page(s):20 - 24
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1592 KB) | HTML iconHTML

    Window decoding schedules are very attractive for message passing decoding of spatially coupled LDPC codes. They take advantage of the inherent convolutional code structure and allow continuous transmission with low decoding latency and complexity. In this paper we show that the decoding complexity can be further reduced if suitable message passing schedules are applied within the decoding window.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple proof of threshold saturation for coupled vector recursions

    Publication Year: 2012, Page(s):25 - 29
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (411 KB) | HTML iconHTML

    Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation phenomenon, which is defined by the belief-propagation threshold of the spatially-coupled ensemble saturating to a fundamental threshold defined by the uncouple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient termination of spatially-coupled codes

    Publication Year: 2012, Page(s):30 - 34
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and a memory-efficient sliding-window decoding algorithm. On the other hand, the encoder needs to solve large linear equations to terminate the encoding process. In this paper, we propose modified spatially-coupled codes. The modified (dl, dr, L) codes have less... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Common randomness amplification: A constructive view

    Publication Year: 2012, Page(s):35 - 39
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (455 KB) | HTML iconHTML

    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 a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling with privacy constraints

    Publication Year: 2012, Page(s):40 - 44
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    In multi-tasking systems where a finite resource is to be shared, a scheduler dictates how the resource is divided among competing processes. Examples of systems which have schedulers include, a computer where the CPU needs to be shared between the different threads running, a cloud computing infrastructure with shared computing resources, a network router serving packets from different streams et... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new achievable region for Gaussian multiple descriptions based on subset typicality

    Publication Year: 2012, Page(s):45 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    This paper addresses the L-channel multiple descriptions problem for a Gaussian source under mean squared error (MSE) distortion metric. We focus on particular cross-sections of the general rate-distortion region where a subset the 2L - 1 distortion constraints are not imposed. Specifically, we assume that certain descriptions are never received simultaneously at the decoder and thereby... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On transmission of multiple Gaussian sources over a Gaussian MAC using a VQLC mapping

    Publication Year: 2012, Page(s):50 - 54
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB) | HTML iconHTML

    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 co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source coding with conditionally less noisy side information

    Publication Year: 2012, Page(s):55 - 59
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    We consider a lossless multi-terminal source coding problem with one transmitter, two receivers and side information. The achievable rate region of the problem is not well understood. In this paper, we characterise the rate region when the side information at one receiver is conditionally less noisy than the side information at the other, given this other receiver's desired source. The conditional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the role of deterministic models in K × K × K wireless networks

    Publication Year: 2012, Page(s):60 - 64
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB) | HTML iconHTML

    This paper establishes a connection between the capacity region of the K × K × K wireless network under the AWGN channel model and under a truncated deterministic channel model, which allows any outer bound on the capacity region of the truncated network to be translated into an outer bound on the capacity region of the AWGN network. The result is obtained through the utilization of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof of the outage probability conjecture for MISO channels

    Publication Year: 2012, Page(s):65 - 69
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    It is conjectured in [6] that the covariance matrices minimizing the outage probability under a power constraint for MIMO channels with Gaussian fading are diagonal with either zeros or constant values on the diagonal. In the MISO setting, this is equivalent to conjecture that the Gaussian quadratic forms having largest tail probability correspond to such diagonal matrices. This paper provides a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source coding for dependent sources

    Publication Year: 2012, Page(s):70 - 74
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    In this work, we address the capacity region of multi-source multi-terminal network communication problems, and study the change in capacity when one moves form independent to dependent source information. Specifically, we ask whether the trade off between capacity and source independence is of continuous nature. We tie the question at hand to that of edge removal which has seen recent interest. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The arithmetic codex

    Publication Year: 2012, Page(s):75 - 79
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    In this invited talk,1 we introduce the notion of arithmetic codex, or codex for short. It encompasses several well-established notions from cryptography (arithmetic secret sharing schemes, which enjoy additive as well as multiplicative properties) and algebraic complexity theory (bilinear complexity of multiplication) in a natural mathematical framework. Arithmetic secret sharing schem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of information theoretic secure computation

    Publication Year: 2012, Page(s): 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (115 KB) | HTML iconHTML

    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 unbou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential privacy as a protocol constraint

    Publication Year: 2012, Page(s):81 - 83
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (135 KB) | HTML iconHTML

    Differential privacy, introduced in 2006, has become a standard definition of privacy for statistical computations. Most of the research on differential privacy has explored questions arising in the client-server setting, where privacy guarantees are one-sided and cover data held by just one of the protocol participants. We observe that differential privacy complements the classic definition of se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput maximization for an energy harvesting communication system with processing cost

    Publication Year: 2012, Page(s):84 - 88
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    In wireless networks, energy consumed for communication includes both the transmission and the processing energy. In this paper, point-to-point communication over a fading channel with an energy harvesting transmitter is studied considering jointly the energy costs of transmission and processing. Under the assumption of known energy arrival and fading profiles, optimal transmission policy for thro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaussian wiretap channel with a batteryless energy harvesting transmitter

    Publication Year: 2012, Page(s):89 - 93
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB) | HTML iconHTML

    We study the Gaussian wiretap channel with an energy harvesting transmitter which does not have a battery to save energy. In the absence of a battery, the necessary transmission energy is maintained by an i.i.d. energy arrival process. We observe that this channel is an instance of the state-dependent wiretap channel with state available only to the transmitter causally, where the state is the ava... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The energy harvesting multiple access channel with energy storage losses

    Publication Year: 2012, Page(s):94 - 98
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (347 KB) | HTML iconHTML

    This work considers a Gaussian multiple access channel with two energy harvesting transmitters with lossy energy storage. The power allocation policy maximizing the average weighted sum rate given the energy harvesting profiles is found. In particular, it is shown that the optimal policy has a double-threshold structure on each of the transmit powers, while the two transmit powers interact through... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On secure multiparty sampling for more than two parties

    Publication Year: 2012, Page(s):99 - 103
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (245 KB) | HTML iconHTML

    We investigate secure multi-party sampling problems involving more than two parties. In the public discussion model, we give a simple characterization of the distributions that can be sampled without any setup. In a model which allows private point-to-point communication, we reduce the problem of characterizing distributions that can be securely sampled using pairwise setups to the problem of char... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing pseudoentropy

    Publication Year: 2012, Page(s):104 - 108
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    We provide a characterization of “pseudoentropy” in terms of hardness of sampling: Let (X, B) be jointly distributed random variables such that B takes values in a polynomial-sized set. We show that no polynomial-time algorithm can distinguish B from some random variable of higher Shannon entropy given X if and only if there is no probabilistic polynomial-time S such that (X, S(X)) h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.