Permutation Codes for Sources

IEEE Transactions on Information Theory

Volumn 18, Issue 1, 1972, Pages 160-169

  Berger, Toby ^a   Jelinek, Frederick ^a   Wolf, Jack K ^b  

^a Department of Obstetrics Gynecology   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES;

INFORMATION THEORY;

EID: 0015282374     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1972.1054729     Document Type: Article

References (23)

1. D. Slepian, “Permutation modulation,” Proc. IEEE, vol. 53, Mar. 1965, pp. 228–236.
2. J. G. Dunn, “Coding for continuous sources and channels,” Ph.D. dissertation, Dep. Elec. Eng., Columbia Univ., New York, N.Y., 1965.
3. —, “The performance of a class of n-dimensional quantizers for a Gaussian source,” in Proc. Symp. Signal Transmission and Processing, Columbia Univ., New York, N.Y., May 13–14, 1965, pp. 76–81.
4. J. Klotz, “Small sample power and efficiency for the one sample Wilcoxon and normal scores tests,” Ann. Math. Statist., vol. 34, 1963, pp. 624–632.
5. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 2. New York: Wiley, 1966, p. 225.
6. C. E. Shannon, “Coding theorems for a discrete source with a fidelity criterion,” IRE Nat. Conv. Rec., pt. 4, Mar. 1959, pp. 142–163.
7. T. J. Goblick, Jr., and J. L. Holsinger, “Analog source digitization: A comparison of theory and practice,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-13, Apr. 1967, pp. 323–326.
8. E. J. Gumbel, Statistics of Extremes. New York: Columbia Univ. Press, 1958.
9. F. N. David et. al., Normal Centroids, Medians and Scores for Ordinal Data. Cambridge: Cambridge Univ. Press, 1968.
10. J. Hájek and Z. Sidak, Theory of Rank Tests. New York: Academic Press, 1967.
11. C. A. R. Hoare, “Quicksort,” Comput. J., vol. 5, 1962, pp. 10–15.
12. W. D. Frazer and A. C. McKellar, “Samplesort: A sampling approach to minimal storage tree sorting,” J. Ass. Comput. Mach., vol. 17, July 1970.
13. R. W. Floyd, “Treesort 3,” Commun. Ass. Comput. Mach., vol. 7, 1964, p. 701.
14. D. H. Lehmer, “Teaching combinatorial tricks to a computer,” in Combinatorial Analysis, R. Bellman and M. Hall, Jr., Eds. Providence, R.I.: Amer. Math. Soc., 1960.
15. F. Jelinek, Probabilistic Information Theory, New York: McGraw-Hill, 1968, pp. 479–489.
16. D. Slepian, U.S. Patent 3 396 351.
17. H. Gish and J. N. Pierce, “Asymptotically efficient quantizing,” IEEE Trans. Inform. Theory, vol. IT-14, Sept. 1968, pp. 676-683.
18. F. Jelinek, “Buffer overflow in variable length coding of fixed rate sources,” IEEE Trans. Inform. Theory, vol. IT-14, May 1968, pp. 490–501.
19. K. Schneider and F. Jelinek, “Variable length-to-block coding of fixed rate sources for transmission through fixed rate noiseless channels,” submitted to IEEE Trans. Inform. Theory.
20. S. Lloyd, “Least square quantization in PCM,” Bell Telephone Lab., Internal Memo., 1959.
21. J. Max, “Quantizing for minimum distortion,” IEEE Trans. Inform. Theory, vol. IT-6, Mar. 1960, pp. 7–12.
22. K. Pearson, “Note on Francis Galton's problem,” Biometrika, vol. 1, 1902, pp. 390–399.
23. H. L. Harter, “Expected values of normal order statistics,” Biometrika, vol. 48, 1961, pp. 151–165.