278 research outputs found

    Raptor codes for infrastructure-to-vehicular broadcast services

    Get PDF

    Simple model of big-crunch/big-bang transition

    Full text link
    We present classical and quantum dynamics of a test particle in the compactified Milne space. Background spacetime includes one compact space dimension undergoing contraction to a point followed by expansion. Quantization consists in finding a self-adjoint representation of the algebra of particle observables. Our model offers some insight into the nature of the cosmic singularity.Comment: 17 pages, no figures, RevTeX4, accepted for publication in Class. Quantum Gra

    Rate adaptive binary erasure quantization with dual fountain codes

    Get PDF
    In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that the source coding dual of the binary erasure channel coding problem, binary erasure quantization, is solved at a nearly optimal rate with application of duals of LT and raptor codes by a belief propagation-like algorithm which amounts to a graph pruning procedure. Furthermore, this quantizing scheme is rate adaptive, i.e., its rate can be modified on-the-fly in order to adapt to the source distribution, very much like LT and raptor codes are able to adapt their rate to the erasure probability of a channel

    Decentralised distributed fountain coding: asymptotic analysis and design

    Get PDF
    A class of generic decentralised distributed fountain coding schemes is introduced and the tools of analysis of the performance of such schemes are presented. It is demonstrated that the developed approach can be used to formulate a robust code design methodology in a number of instances. We show that two non-standard applications of fountain codes, fountain codes for distributed source coding and fountain codes for unequal error protection lie within this decentralised distributed fountain coding framework

    Fountain coding with decoder side information

    Get PDF
    In this contribution, we consider the application of Digital Fountain (DF) codes to the problem of data transmission when side information is available at the decoder. The side information is modelled as a "virtual" channel output when original information sequence is the input. For two cases of the system model, which model both the virtual and the actual transmission channel either as a binary erasure channel or as a binary input additive white Gaussian noise (BIAWGN) channel, we propose methods of enhancing the design of standard non-systematic DF codes by optimizing their output degree distribution based oil the side information assumption. In addition, a systematic Raptor design has been employed as a possible solution to the problem

    Expanding window fountain codes for unequal error protection

    Get PDF
    A novel approach to provide unequal error protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed. EWF codes use a windowing technique rather than a weighted (non-uniform) selection of input symbols to achieve UEP property. The windowing approach introduces additional parameters in the UEP rateless code design, making it more general and flexible than the weighted approach. Furthermore, the windowing approach provides better performance of UEP scheme, which is confirmed both theoretically and experimentally

    Expanding window fountain codes for unequal error protection

    Get PDF
    A novel approach to provide unequal error protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed. EWF codes use a windowing technique rather than a weighted (non-uniform) selection of input symbols to achieve UEP property. The windowing approach introduces additional parameters in the UEP rateless code design, making it more general and flexible than the weighted approach. Furthermore, the windowing approach provides better performance of UEP scheme, which is confirmed both theoretically and experimentally. © 2009 IEEE

    Expanding window fountain codes for unequal error protection

    Get PDF
    A novel approach to provide unequal error protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed. EWF codes use a windowing technique rather than a weighted (non-uniform) selection of input symbols to achieve UEP property. The windowing approach introduces additional parameters in the UEP rateless code design, making it more general and flexible than the weighted approach. Furthermore, the windowing approach provides better performance of UEP scheme, which is confirmed both theoretically and experimentally. © 2009 IEEE

    Bianchi I model in terms of nonstandard loop quantum cosmology: Quantum dynamics

    Full text link
    We analyze the quantum Bianchi I model in the setting of the nonstandard loop quantum cosmology. Elementary observables are used to quantize the volume operator. The spectrum of the volume operator is bounded from below and discrete. The discreteness may imply a foamy structure of spacetime at semiclassical level. The results are described in terms of a free parameter specifying loop geometry to be determined in astro-cosmo observations. An evolution of the quantum model is generated by the so-called true Hamiltonian, which enables an introduction of a time parameter valued in the set of all real numbers.Comment: 18 pages, version accepted for publication by Class. Quant. Gra

    Rateless distributed source code design

    Get PDF
    corecore