REASONING ABOUT RECURSIVELY DEFINED DATA-STRUCTURES

[1] ALTENKAMP D, 1978, CODES UNEQUAL PROBAB

[2] ASH R, 1965, INFORMATION THEORY

[3] BAUER FL, 1971, INFORMATIK HEIDELBER

[4] BAYER PJ, 1975, TM69 MAC MIT PROJ

[5] COT N, 1977, THESIS STANFORD U ST

[6] SIMPLE PROOFS OF SOME THEOREMS ON NOISELESS CHANNELS [J]. INFORMATION AND CONTROL, 1969, 14 (03): : 285 - &

[7] FREDMAN ML, 1975, 7TH P ANN ACM C THEO

[8] VARIABLE-LENGTH BINARY ENCODINGS [J]. BELL SYSTEM TECHNICAL JOURNAL, 1959, 38 (04): : 933 - 967

[9] OPTIMAL COMPUTER SEARCH TREES AND VARIABLE-LENGTH ALPHABETICAL CODES [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 21 (04) : 514 - &

[10] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J]. PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09): : 1098 - 1101

[1] ALTENKAMP D, 1978, CODES UNEQUAL PROBAB

[2] ASH R, 1965, INFORMATION THEORY

[3] BAUER FL, 1971, INFORMATIK HEIDELBER

[4] BAYER PJ, 1975, TM69 MAC MIT PROJ

[5] COT N, 1977, THESIS STANFORD U ST

[6] SIMPLE PROOFS OF SOME THEOREMS ON NOISELESS CHANNELS [J]. INFORMATION AND CONTROL, 1969, 14 (03): : 285 - &

[7] FREDMAN ML, 1975, 7TH P ANN ACM C THEO

[8] VARIABLE-LENGTH BINARY ENCODINGS [J]. BELL SYSTEM TECHNICAL JOURNAL, 1959, 38 (04): : 933 - 967

[9] OPTIMAL COMPUTER SEARCH TREES AND VARIABLE-LENGTH ALPHABETICAL CODES [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 21 (04) : 514 - &

[10] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J]. PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09): : 1098 - 1101