By Topic

Randomly chosen index assignments are asymptotically bad for uniform sources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mehes, A. ; Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA ; Zeger, K.

It is known that among all redundancy-free codes (or index assignments), the natural binary code minimizes the mean-squared error (MSE) of the uniform source and uniform quantizer on a binary symmetric channel. We derive a code which maximizes the MSE and demonstrate that the code is linear and its distortion is asymptotically equivalent, as the block length grows, to the expected distortion of an index assignment chosen uniformly at random

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 2 )