Výsledky vyhľadávania - weak variable-length source coding

Universal Weak Variable-Length Source Coding on Countably Infinite Alphabets Autor Silva, Jorge F., Piantanida, Pablo

“…) is not feasible, this work introduces the notion of "almost lossless source coding". Analog to the weak variable-length source coding problem studied by Han ( IEEE Trans. Inf. Theory , vol. 46, no. 4, pp. 1217-1226, Jul. 2000…”
Získať plný text

An Information-Spectrum Approach to Weak Variable-Length Source Coding With Side-Information Autor Kuzuoka, Shigeaki, Watanabe, Shun

“…This paper studies variable-length (VL) source coding of general sources with side-information…”
Získať plný text

Weak variable-length source coding Autor Han, Te Sun

“…/) is variable, then it is called variable-length source coding. Usually, in the context of fixed-length source coding the probability of error /spl epsi//sub n/ is required to asymptotically vanish (i.e…”
Získať plný text

Universal Weak Variable-Length Source Coding on Countable Infinite Alphabets Autor Silva, Jorge F, Piantanida, Pablo

“… Analog to the weak variable-length source coding problem studied by Han (IEEE TIT, 2000, 46, 1217-1226…”
Získať plný text

Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources Autor Kimura, A., Uyematsu, T.

“… Next, we investigate the variable-length coding having the asymptotically vanishing probability of error…”
Získať plný text

An Information-Spectrum Approach to Weak Variable-Length Source Coding with Side-Information Autor Kuzuoka, Shigeaki, Watanabe, Shun

“…This paper studies variable-length (VL) source coding of general sources with side-information…”
Získať plný text

Weak variable-length source coding theorems Autor Te Sun Han

“…The author first defines a general source as an infinite sequence X={X/sup n/=(X/sub 1//sup (n)/,...,X/sub n//sup (n)/)}/sub n=1//sup /spl infin// of n…”
Získať plný text

Weak variable-length slepian-wolf coding wih linked encoders for mixed sources Autor Kimura, Akisato, Uyematsu, Tomohiko

“… Next, we investigate the variable-length coding having the asymptotically vanishing probability…”
Získať plný text

Almost lossless variable-length source coding on countably infinite alphabets Autor Silva, Jorge F., Piantanida, Pablo

“… This idea -analog to the weak variable-length source coding problem proposed by Han [1]- aims at relaxing the lossless block-wise assumption to allow a distortion that vanishes asymptotically as the block-length goes to infinity 1…”
Získať plný text

Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources Autor Kimura, A., Uyematsu, T.

“… In this paper, we investigate variable-length coding which allows asymptotically vanishing probability of error for the system considered by Oohama…”
Získať plný text

On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets Autor Silva, Jorge F., Piantanida, Pablo

“…The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding…”
Získať plný text

An information-spectrum approach to weak variable-length Slepian-Wolf coding Autor Kuzuoka, Shigeaki, Watanabe, Shun

“…In this paper, we investigate weak variable-length Slepian-Wolf (VL-SW) coding of general sources…”
Získať plný text

On variable length codes for iterative source/channel decoding Autor Bauer, R., Hagenauer, J.

“… In contrast to previous approaches using this kind of trellis we do not consider the received sequence as a concatenation of variable length codewords, but as one long code word of a (weak…”
Získať plný text

On Universal D-Semifaithful Coding for Memoryless Sources with Infinite Alphabets Autor Silva, Jorge F, Piantanida, Pablo

“…The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding…”
Získať plný text

Tracking Markov targets in binary sensor networks: Source coding and large deviation limits on the required number of queries Autor Rezaeian, M., Manton, J. H., Moran, B.

“…Using concepts from coding theory, we define e-achievability for target tracking in binary sensor networks and compare this to the more usual notion of trackability…”
Získať plný text