By Topic

2013 IEEE Information Theory Workshop (ITW)

9-13 Sept. 2013

Filter Results

Displaying Results 1 - 25 of 141
  • Index

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

    Publication Year: 2013, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Polar codes with dynamic frozen symbols and their decoding by directed search

    Publication Year: 2013, Page(s):1 - 5
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (146 KB) | HTML iconHTML

    A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which employs estimates of the not-yet-processed bit channel error probabilities to perform directed search in code tree, reducing thus the total number of iterations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on achievable rates by polar codes with mismatch polar decoding

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

    In this paper we show that mismatched polar codes over symmetric B-DMCs symmetrized under the same permutation can achieve rates of at least I(W, V) bits whenever I(W, V) > 0, where W denotes the communication channel, V the mismatched channel used in the code design including both the encoder and decoder, and I(W, V) × Σy Σx ϵ {0,1} 1/2 W(y|x) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scaling exponent of list decoders with applications to polar codes

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

    Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error probability Pe and we analyze the tradeoff between the blocklength N and the back-off from capacity C-R using scaling laws. By means ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polar coding for fading channels

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

    A polar coding scheme for fading channels is proposed in this paper. More specifically, the focus is on the Gaussian fading channel with a BPSK modulation, where the equivalent channel is modeled as a binary symmetric channel with varying cross-over probabilities. To deal with variable channel states, a coding scheme of hierarchically utilizing polar codes is proposed. In particular, by observing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On symmetric multiple description coding

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

    We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the Hamming distortion measure, this lower bound can be evaluated with the aid of a certain minimax theorem. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the specia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterising correlation via entropy functions

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

    Characterising the capacity region for a network can be extremely difficult. Even with independent sources, determining the capacity region can be as hard as the open problem of characterising all information inequalities. The majority of computable outer bounds in the literature are relaxations of the Linear Programming bound which involves entropy functions of random variables related to the sou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erasure/list exponents for Slepian-Wolf decoding

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

    We analyze random coding error exponents associated with erasure/list Slepian-Wolf decoding using two different methods and then compare the resulting bounds. The first method follows the well known techniques of Gallager and Forney and the second method is based on a technique of distance enumeration, or more generally, type class enumeration, which is rooted in the statistical mechanics of a dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operational extremality of Gaussianity in network compression, communication, and coding

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

    Summary form only given. Among other extremal properties, Gaussian sources are hardest to compress and communicate over. We review the main results of and exhibiting the generality in which such extremal properties hold in compression, communication and coding over networks. These properties are established via operational arguments, bypassing elusive characterizations of fundamental performance l... View full abstract»

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

    Publication Year: 2013, Page(s):1 - 5
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    We consider the problem of allocating radio channels to links in a wireless network. Links interact through interference, modelled as a conflict graph (i.e., two interfering links cannot be simultaneously active on the same channel). We aim at identifying the channel allocation maximizing the total network throughput over a finite time horizon. Should we know the average radio conditions on each c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Physical-layer cryptography through massive MIMO

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

    We propose the new technique of physical-layer cryptography based on using a massive MIMO channel as a key between the sender and desired receiver, which need not be secret. The goal is for low-complexity encoding and decoding by the desired transmitter-receiver pair, whereas decoding by an eavesdropper is hard in terms of prohibitive complexity. The massive MIMO system has a channel gain matrix t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secrecy & Rate Adaptation for secure HARQ protocols

    Publication Year: 2013, Page(s):1 - 5
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (215 KB) | HTML iconHTML

    This paper is dedicated to the study of HARQ protocols under a secrecy constraint. An encoder sends information to a legitimate decoder while keeping it secret from the eavesdropper. Our objective is to provide a coding scheme that satisfies both reliability and confidentiality conditions. This problem has been investigated in the literature using a coding scheme that involves a unique secrecy par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protecting data against unwanted inferences

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

    We study the competing goals of utility and privacy as they arise when a provider delegates the processing of its personal information to a recipient who is better able to handle this data. We formulate our goals in terms of the inferences which can be drawn using the shared data. A whitelist describes the inferences that are desirable, i.e., providing utility. A blacklist describes the unwanted i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polar coding for secret-key generation

    Publication Year: 2013, Page(s):1 - 5
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (621 KB) | HTML iconHTML

    Practical implementations of secret-key generation are often based on sequential strategies, which handle reliability and secrecy in two successive steps, called reconciliation and privacy amplification. In this paper, we propose an alternative scheme based on polar coding that jointly deals with reliability and secrecy. We study a binary degraded symmetric discrete memoryless source model with un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On polarization for the linear operator channel

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

    We address the problem of reliably transmitting information through a network where the nodes perform random linear network coding and where an adversary potentially injects malicious packets into the network. A good model for such a channel is a linear operator channel, where in this work we employ a combined multiplicative and additive matrix channel. We show that this adversarial channel behave... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel polarization with higher order memory

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

    We introduce the design of a class of code sequences {en(m), n = 1, 2,... } with memory level m = 1,2,... based on the channel polarization idea, where {en(1)} coincides with the polar codes presented by Arıkan in [1]. The new codes achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels. We derive bounds on the polar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some coding and information theoretic problems in contemporary (video) content delivery

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

    Information and coding theory have traditionally been used in point-to-point scenarios, to compute and achieve the transmission channel capacity as well as to compute and achieve the optimal compression rate vs. source distortion tradeoff. In today's networks, the same (video) data is often transmitted to multiple users, simultaneously over diverse channels. The users may differ not only in the si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source broadcasting over erasure channels: Distortion bounds and code design

    Publication Year: 2013, Page(s):1 - 5
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (127 KB) | HTML iconHTML

    We study a lossy source-broadcasting problem involving the transmission of a binary source over a two-receiver erasure broadcast channel. The motivation of our work stems from the problem faced by a server that wishes to singly broadcast content to a diverse set of users with fractional source reconstruction requirements. In this problem, the server wishes to minimize the overall network latency i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of random and burst packet losses on H.264 scalable video coding

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

    This paper studies the impact of packet loss on H.264 scalable video coding (SVC). A Markov Chain (MC) with 2N states is developed to describe the error propagation process inside a group of pictures (GOP). The characteristic of different packet loss events is captured by the initial state vector of the MC. Based on the proposed model, the performance of different GOP structures can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network coding designs suited for the real world: What works, what doesn't, what's promising

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

    Network coding (NC) has attracted tremendous attention from the research community due to its potential to significantly improve networks' throughput, delay, and energy performance as well as a means to simplify protocol design and naturally providing security support. The possibilities in code design have produced a large influx of new ideas and approaches to harness the power of NC. But, which o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting common randomness: A resource for network secrecy

    Publication Year: 2013, Page(s):1 - 5
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they both observe. The communication channels are erasure channels with strictly causal channel state information of... View full abstract»

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

    Publication Year: 2013, Page(s):1 - 5
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    We consider a cascade network where a sequence of nodes each send a message to their downstream neighbor to enable coordination, the first node having access to an information signal. An adversary also receives all the communication as well as additional side-information. The performance of the system is measured by a payoff function over all actions produced by the nodes as well as the adversary.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure degrees of freedom of MIMO X-channels with output feedback and delayed CSI

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

    We investigate the problem of secure transmission over a two-user multi-input multi-output (MIMO) X-channel with noiseless local feedback and delayed channel state information (CSI) available at transmitters. The transmitters are equipped with M antennas each, and the receivers are equipped with N antennas each. For this model, we characterize the optimal sum secure degrees of freedom (SDoF) regio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The secrecy capacity of a compound MIMO Gaussian channel

    Publication Year: 2013, Page(s):1 - 5
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    The compound MIMO Gaussian wiretap channel is studied, where the channel to the legitimate receiver is known and the eavesdropper channel is not known to the transmitter but is known to have a bounded spectral norm (channel gain). The compound secrecy capacity is established without the de-gradedness assumption and the optimal signaling is identified: the compound capacity equals the worst-case ch... View full abstract»

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