most citedRedundancy Estimates for Word-Based Encoding of Sequences Produced by a Bernoulli Source

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.IT2007★ 2 cited

Redundancy Estimates for Word-Based Encoding of Sequences Produced by a Bernoulli Source

G. L. Khodak

The efficiency of a code is estimated by its redundancy , while the complexity of a code is estimated by its average delay . In this work we construct word-based codes,…