Amanote Research

Amanote Research

    RegisterSign In

Improved Bounds for the Rate Loss of Multi-Resolution Source Codes

doi 10.1109/isit.2001.936056
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
H. FengM. Effros
Publisher

IEEE


Related search

Improved Lower Bounds for Multicovering Codes

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

Rate-Adaptive BCH Codes for Distributed Source Coding

Eurasip Journal on Advances in Signal Processing
HardwareElectronic EngineeringSignal ProcessingElectricalArchitecture
2013English

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

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Upper Bounds on the Probability of the Correct Path Loss for List Decoding of Fixed Convolutional Codes

English

Informational Divergence Bounds for Authentication Codes

English

Information Loss-Guided Multi-Resolution Image Fusion

IEEE Transactions on Geoscience and Remote Sensing
EarthPlanetary SciencesElectricalElectronic Engineering
2020English

Improved Bounds for Centered Colorings

2020English

Improved Bounds for Wireless Localization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy