Results 51 to 60 of about 160 (125)
Complete Variable-Length . . .
, 1994 A set of codewords is fix-free if it is both prefix-free and suffix-free: no codeword in the set is a prefix or a suffix of any other. A set of codewords fx 1 x 2 ::: xng over a t-letter alphabet is said to be complete if it satisfies the Kraft ...
Ronald L. Rivest, David Gillman
core
Fixed-to-Variable Length Distribution Matching
, 2013 This work considers prefix-free fixed-to-variable length (f2v) distribution matching. Prefix-free f2v matchers are used to reversibly transform an input sequence of independent and uniformly distributed bits into an output sequence of bits that are ...
Amjad, R. A.; Böcherer, G.
core
, 2020 Huffman coding is entropy encoding algorithm used for lossless data compression. It basically uses variable length coding which is done using binary tree method.
Meshram, Shilpa.K. +1 more
core +2 more sources
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs
, 1998 We consider the problem of constructing prefix-free codes of minimum cost when the encoding alphabet contains letters of unequal length. The complexity of this problem has been unclear for thirty years with the only algorithm known for its solution ...
Rote, G. +3 more
core +1 more source
A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
, 1995 We consider the problem of constructing prefix-free codes of minimum cost when the encoding alphabet contains letters of unequal length. The complexity of this problem has been unclear for thirty years with the only algorithm known for its solution ...
Günter Rote +3 more
core +1 more source
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the monge property
, 1998 In this paper we discuss a variation of the classical Huffman coding problem: finding optimal prefix-free codes for unequal letter costs. Our problem consists of finding a minimal cost prefix-free code in which the encoding alphabet consists of unequal ...
Bradford, Phil +3 more
core +1 more source
, 2017 In order to guarantee the synchronization between a transmited data by transmitter and received data by receiver can be done by periodically inserting a fixed sequence into the transmited data. It is one of the main topic in digital communication systems
Moh. Affaf, Zaiful Ulum
core +2 more sources
Infinite prefix codes for geometric distributions
, 2004 Optimal (minimum cost) binary prefix codes for infinite sources with geometrically distributed frequencies, e.g. , P = {pi(1 - p)}i=0∞<, 0 < p < 1, were first (implicitly) suggested by Golomb over thirty years ago in the context of run-length ...
Ma, Kin-Keung
core
On non-expandable cross-bifix-free codes
, 2023 A cross-bifix-free code of length $n$ over $\mathbb{Z}_q$ is defined as a non-empty subset of $\mathbb{Z}_q^n$ satisfying that the prefix set of each codeword is disjoint from the suffix set of every codeword.
Qin, Chunyan, Luo, Gaojun, Chen, Bocong
core +1 more source
Entropic Bounds on the Average Length of Codes with a Space
We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that their average ...
Vaccaro U. +5 more
core +2 more sources