Results 61 to 70 of about 10,040,691 (372)
An End-to-End Scheme for Learning Over Compressed Data Transmitted Through a Noisy Channel
IEEE Access, 2023 Within the emerging area of goal-oriented communications, this paper introduces a novel end-to-end transmission scheme dedicated to learning over a noisy channel, under the constraint that no prior training dataset is available.
Alireza Tasdighi, Elsa Dupraz
doaj +1 more source
Successive Wyner-Ziv Coding Scheme and its Application to the Quadratic Gaussian CEO Problem
, 2006 We introduce a distributed source coding scheme called successive Wyner-Ziv coding. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive Wyner-Ziv coding.
Berger, Toby, Chen, Jun
core +2 more sources
Entropy-Constrained Scalar Quantization with a Lossy-Compressed Bit
Entropy, 2016 We consider the compression of a continuous real-valued source X using scalar quantizers and average squared error distortion D. Using lossless compression of the quantizer’s output, Gish and Pierce showed that uniform quantizing yields the smallest ...
Melanie F. Pradier +2 more
doaj +1 more source
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
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
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
Information Bottleneck for a Rayleigh Fading MIMO Channel with an Oblivious Relay
Information, 2021 This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel with an oblivious relay. The relay is constrained to operating without knowledge of the codebooks, i.e., it performs oblivious ...
Hao Xu +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background/Objectives Osteosarcoma is a radioresistant tumor that may benefit from stereotactic body radiation therapy (SBRT) for locoregional control in metastatic/recurrent disease. We report institutional practice patterns, outcomes, toxicity, and failures in osteosarcoma patients treated with SBRT.
Jenna Kocsis +13 more
wiley +1 more source
On the Performance of the Cache Coding Protocol
Information, 2018 Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers ...
Behnaz Maboudi +3 more
doaj +1 more source
Polar Codes for Distributed Hierarchical Source Coding [PDF]
, 2014 We show that polar codes can be used to achieve the rate-distortion functions in the problem of hierarchical source coding also known as the successive refinement problem.
Barg, Alexander, Ye, Min
core +1 more source