Amanote Research
Register
Sign In
Do Optimal Entropy-Constrained Quantizers Have a Finite or Infinite Number of Codewords?
IEEE Transactions on Information Theory
- United States
doi 10.1109/tit.2003.819340
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Science Applications
Information Systems
Library
Information Sciences
Date
November 1, 2003
Authors
A. Gyorgy
T. Linder
P.A. Chou
B.J. Betts
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Related search
Design of Optimal Quantizers for Distributed Source Coding
Optimal Rate Allocation for Shape-Gain Gaussian Quantizers
Error Estimates for the Finite Element Discretization of Semi-Infinite Elliptic Optimal Control Problems
Discussiones Mathematicae. Differential Inclusions, Control and Optimization
Complexity of Infinite Sequences With Zero Entropy
Acta Arithmetica
Number Theory
Algebra
Min- And Max-Entropy in Infinite Dimensions
Communications in Mathematical Physics
Nonlinear Physics
Mathematical Physics
Statistical
Infinite Locally Finite Hypohamiltonian Graphs.
Mathematica Scandinavica
Mathematics
A Model for Optimal Constrained Adaptive Testing
Applied Psychological Measurement
Psychology
Social Sciences
Finite and Infinite Goods: A Framework for Ethics
The Philosophical Review
Philosophy
Finite-State Automata on Infinite Inputs
