On the proportion of prefix codes in the set of three-element codes

Abstract: Let

L

be a finite sequence of natural numbers. In Woryna (2017,2018), we derived some interesting properties for the ratio

h o_{n, L} = | P R_{n} (L) | / | U D_{n} (L) |

, where

U D_{n} (L)

denotes the set of all codes over an

n

-letter alphabet and with length distribution

L

, and

P R_{n} (L) s u b s e t e q U D_{n} (L)

is the corresponding subset of prefix codes. In the present paper, we study the case when the length distributions are three-element sequences. We show in this case that the ratio

h o_{n, L}

is always greater than

a l p h a_{n}

, where

a l p h a_{n} = (n - 2) / n

for

n > 2

and

a l p h a_{2} = 1 / 6

. Moreover, the number

a l p h a_{n}

is the best possible lower bound for this ratio, as the length distributions of the form

L = (1, 1, c)

and

L = (1, 2, c)

assure that the ratios asymptotically approach

a l p h a_{n}

. Namely, if

L = (1, 1, c)

, then

h o_{n, L}

tends to

(n - 2) / n

with

c o i n f t y

, and, if

L = (1, 2, c)

, then

h o_{2, L}

tends to

1 / 6

with

c o i n f t y

.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: On the proportion of prefix codes in the set of three-element codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185934)