Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences - Japan
doi 10.1587/transfun.e101.a.2110
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Related search

A General Asymptotic Formula for Partition Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1950English

The Rate-Distortion Region for Multiple Descriptions Without Excess Rate

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1985English

Rate Distortion-Based Motion Estimation Search Ordering for Rate-Constrained Successive Elimination Algorithms

2014English

Bounds on the Asymptotic Rate for Capacitive Crosstalk Avoidance Codes for On-Chip Buses

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Electronic EngineeringComputer GraphicsSignal ProcessingApplied MathematicsElectricalComputer-Aided Design
2018English

A Necessary and Sufficient Condition for the Asymptotic Version of Ahlfors’ Distortion Property

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Asymptotic Formula for the Moments of Lebesgue’s Singular Function

Modeling and Analysis of Information Systems
2015English

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Asymptotic Inversion of the Erlang B Formula

SIAM Journal on Applied Mathematics
Applied Mathematics
2009English

A Unified Weight Formula for Calculating the Sample Variance From Weighted Successive Differences

Discrete Dynamics in Nature and Society
ModelingSimulation
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy