Results 41 to 50 of about 1,562,532 (289)
Experimental demonstration of quantum source coding [PDF]
, 2003 We report an experimental demonstration of Schumacher's quantum noiseless coding theorem. Our experiment employs a sequence of single photons each of which represents three qubits.
Atsushi Hasegawa +10 more
core +2 more sources
Source Coding for Quasiarithmetic Penalties
, 2006 Huffman coding finds a prefix code that minimizes mean codeword length for a given probability distribution over a finite number of items. Campbell generalized the Huffman problem to a family of problems in which the goal is to minimize not mean codeword
Baer, Michael B.
core +4 more sources
Critical Behavior in Lossy Source Coding [PDF]
, 2000 The following critical phenomenon was recently discovered. When a memoryless source is compressed using a variable-length fixed-distortion code, the fastest convergence rate of the (pointwise) compression ratio to the optimal $R(D)$ bits/symbol is either
Dembo, Amir, Kontoyiannis, Ioannis
core +2 more sources
IEEE Access, 2016 The recently proposed unary error correction (UEC) and Elias gamma error correction (EGEC) codes facilitate the near-capacity joint source and channel coding (JSCC) of symbol values selected from large alphabets at a low complexity.
Matthew F. Brejza +6 more
doaj +1 more source
Memory-Assisted Universal Source Coding
, 2012 The problem of the universal compression of a sequence from a library of several small to moderate length sequences from similar context arises in many practical scenarios, such as the compression of the storage data and the Internet traffic.
Beirami, Ahmad, Fekri, Faramarz
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Retinoblastoma (RB) is the most common pediatric ocular cancer, yet population‐based data on survival and risk factors remain limited. This study aimed to describe survival in a large national RB cohort and identify predictors of death and complications.
Samuel Sassine +14 more
wiley +1 more source
A Universal Random Coding Ensemble for Sample-Wise Lossy Compression
Entropy, 2023 We propose a universal ensemble for the random selection of rate–distortion codes which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector, x^, is selected independently at random under the probability ...
Neri Merhav
doaj +1 more source
Near-capacity dirty-paper code design : a source-channel coding approach [PDF]
, 2009 This paper examines near-capacity dirty-paper code designs based on source-channel coding. We first point out that the performance loss in signal-to-noise ratio (SNR) in our code designs can be broken into the sum of the packing loss from channel coding ...
Liveris, Angelos D. +4 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Although not always achieved, complete chemotherapy‐induced nausea and vomiting (CINV) control is the conventional goal of CINV prophylaxis. In this two‐center, mixed‐methods study, we sought to understand the preferences of adolescent patients and family caregivers for CINV control endpoints.
Haley Newman +8 more
wiley +1 more source
A Low-Complexity and Asymptotically Optimal Coding Strategy for Gaussian Vector Sources
Entropy, 2019 In this paper, we present a low-complexity coding strategy to encode (compress) finite-length data blocks of Gaussian vector sources. We show that for large enough data blocks of a Gaussian asymptotically wide sense stationary (AWSS) vector source, the ...
Marta Zárraga-Rodríguez +2 more
doaj +1 more source