Optimal Permutation Codes for Uniform SourcesThis work was completed at Bell Labs, Lucent Technologies. Conference Paper

abstract

• Permutation codes (PC's) are vector quantizers whose code vectors are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal PC design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design. However, contradicting intuition and previously published assertions, there are finite block length PC's that perform better than the best ones with asymptotically large length; thus, there are PC's whose performances cannot be matched by ECSQ's. Specific counterexamples are created with a memoryless uniform source.

name of conference

• Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

authors

• Savari, Serap

published proceedings

• Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

author list (cited authors)

• Goyal, V. K., Savari, S. A., & Wang, W.

citation count

• 0

complete list of authors

• Goyal, Vivek K||Savari, Serap A||Wang, Wei

publication date

• January 2001

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/isit.2001.935893

start page

• 30

end page

• 30

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fisit.2001.935893