69,050 research outputs found

    A Rate-Distortion Based Secrecy System with Side Information at the Decoders

    Full text link
    A secrecy system with side information at the decoders is studied in the context of lossy source compression over a noiseless broadcast channel. The decoders have access to different side information sequences that are correlated with the source. The fidelity of the communication to the legitimate receiver is measured by a distortion metric, as is traditionally done in the Wyner-Ziv problem. The secrecy performance of the system is also evaluated under a distortion metric. An achievable rate-distortion region is derived for the general case of arbitrarily correlated side information. Exact bounds are obtained for several special cases in which the side information satisfies certain constraints. An example is considered in which the side information sequences come from a binary erasure channel and a binary symmetric channel.Comment: 8 pages. Allerton 201

    The Likelihood Encoder for Lossy Source Compression

    Full text link
    In this work, a likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on a soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma gives alternative achievability proofs for classical source coding problems. The case of the rate-distortion function with side information at the decoder (i.e. the Wyner-Ziv problem) is carefully examined and an application of the likelihood encoder to the multi-terminal source coding inner bound (i.e. the Berger-Tung region) is outlined.Comment: 5 pages, 2 figures, ISIT 201

    A Bit of Secrecy for Gaussian Source Compression

    Full text link
    In this paper, the compression of an independent and identically distributed Gaussian source sequence is studied in an unsecure network. Within a game theoretic setting for a three-party noiseless communication network (sender Alice, legitimate receiver Bob, and eavesdropper Eve), the problem of how to efficiently compress a Gaussian source with limited secret key in order to guarantee that Bob can reconstruct with high fidelity while preventing Eve from estimating an accurate reconstruction is investigated. It is assumed that Alice and Bob share a secret key with limited rate. Three scenarios are studied, in which the eavesdropper ranges from weak to strong in terms of the causal side information she has. It is shown that one bit of secret key per source symbol is enough to achieve perfect secrecy performance in the Gaussian squared error setting, and the information theoretic region is not optimized by joint Gaussian random variables

    Entropy of Contracting Universe in Cyclic Cosmology

    Get PDF
    Following up a recent proposal \cite{BF} for a cyclic model based on phantom dark energy, we examine the content of the contracting universe (cu) and its entropy ScuS_{cu}. We find that beyond dark energy the universe contains on average zero or at most a single photon which if present immediately after turnaround has infinitesimally energy which subsequently blue shifts to produce e+ee^+e^- pairs. These statements are independent of the equation of state ω=p/ρ\omega = p/\rho of dark energy provided ω<1\omega < -1. Thus Scu=0S_{cu} = 0 and if observations confirm ω<1\omega < -1 the entropy problem is solved. We discuss the absence of a theoretical lower bound on ϕ=ω+1\phi = |\omega + 1|, then describe an anthropic fine tuning argument that renders unlikely extremely small ϕ\phi. The present bound ϕ0.1\phi \lesssim 0.1 already implies a time until turnaround of (tTt0)100(t_T - t_0) \gtrsim 100 Gy.Comment: 5 pages late

    Cyclic Universe and Infinite Past

    Get PDF
    We address two questions about the past for infinitely cyclic cosmology. The first is whether it can contain an infinite length null geodesic into the past in view of the Borde-Guth-Vilenkin (BGV) "no-go" theorem, The second is whether, given that a small fraction of spawned universes fail to cycle, there is an adequate probability for a successful universe after an infinite time. We give positive answers to both questions then show that in infinite cyclicity the total number of universes has been infinite for an arbitrarily long time.Comment: 7 pages. Clarification in discussion of infinite pas
    corecore