Doris Altenkamp
Kurt Mehlhorn
- 1 ALTENKAMP, D., AND MEHLHORN, K. Codes: Unequal probabilities, unequal letter costs. Tech. Rep., University des Saarlandes, Saarbriicken, Federal Republic of Germany, 1978.Google Scholar
- 2 ASH, R. Information Theory. lnterscience, New York, 1965.Google Scholar
- 3 BAUER, F.L., AND GOOS, G. lnformatik, Heidelberger Taschenbucher. Springer-Verlag, Berlin, 1971.Google Scholar
- 4 BAYER, P.J. Improved bounds on the costs of optimal and balanced binary search trees. Tech. Memo., Project MAC TM 69, M.I.T., Cambridge, Mass., 1975.Google Scholar
- 5 CSrSZAR, 1. Simple proofs of some theorems on noiseless channels. Inf. Control 14 (1969), 285-298.Google Scholar
- 6 Cot, N. Characterization and design of optimal prefix codes. Ph.D. Thesis, Stanford University, Stanford, Calif. June 1977.Google Scholar
- 7 FREDMAN, M.L. Two applications of a probabilistic search technique. Proc. 7th Ann. ACM Conf. on Theory of Computing, Albuquerque, N.M., 1975. Google Scholar
- 8 GILaERT, E.N., AND MOORE, E.F. Variable length encodings. Bell Syst. Tech. J. 38 (1959), 933-968.Google Scholar
- 9 Hu, T.C., AND TUCr~R, A.C. Optimal search trees and variable length alphabetic codes. SIAM .L Appl. Math. 21 (1971), 514-532.Google Scholar
- 10 HUFFMANN, D.A. A method for the construction of minimum-redundancy codes. Proc. IRE 40 (1952), 1098-1101.Google Scholar
- 11 ITAI, A. Optimal alphabetic trees. SlAM J. Comput. 5 (1976), 9-18.Google Scholar
- 12 KARP, R.M. Minimum redundancy coding for the discrete noiseless channel. IEEE Trans. Inf. Theory 17"- 7 (Jan. 1961), 27-39.Google Scholar
- 13 KNUTH, D.E. Optimum binary search trees. Acta Inform. 1 (1971), 14--25.Google Scholar
- 14 KRAUSE, R.M. Channels which transmit letters of unequal duration. Inf. Control 5 (1962), 13-24.Google Scholar
- 15 MEHLHORN, K. Effiziente Algorithmen, Teubner Studienbiicher lnformatik, Stuttgart, 1977.Google Scholar
- 16 MEHLHORN, K. Best possible bounds on the weighted path length of optimum binary search trees. SIAM J. Comput. 6, 2 (1977), 235-239.Google Scholar
- 17 PERL, Y., GAREY, N.R., AND EVEN, S. Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters. J. ACM 22, 2 (April 1975), 202-214. Google Scholar
- 18 SHANNON, C.E. A mathematical theory of communication. Bell Syst. Tech. J. 27 (1948), 379--423, 623-656.Google Scholar
- 19 VAN LEEUWEN, J. Off the construction of Huffmann trees. In 3rd International Colloquium on Automata, Languages, and Programming, S. Michaelson and R. Milner, Eds., Edinburgh University Press, 1976, pp. 382-410.Google Scholar
Index Terms
- Codes: Unequal Probabilities, Unequal Letter Cost
Recommendations
Linear Programming Bounds for Multi-level Unequal Protection Codes
2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC)In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and Linear Programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal ...
Rateless Codes With Unequal Error Protection Property
In this correspondence, a generalization of rateless codes is proposed. The proposed codes provide unequal error protection (UEP). The asymptotic properties of these codes under the iterative decoding are investigated. Moreover, upper and lower bounds ...
Expanding window fountain codes for unequal error protection
A novel approach to provide unequal error protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed. EWF codes use a windowing technique rather than a weighted (non-uniform) ...
Comments