Truncated Binary Encoding

Truncated binary encoding is an entropy encoding typically used for uniform probability distributions with a finite alphabet. It is parameterized by a maximum number n. It is slightly more general than binary encoding which is only optimal where n is a power of two. For example, if n is 4, binary encoding allocates these codewords:
Number Encoding
0000
1001
2010
3011
4100
UNUSED101
UNUSED110
UNUSED111
Instead, truncated binary allocates:
Number Encoding
000
101
210
3110
4111
You can think of this as allocating an UNUSED to the first few symbols (until you run out of UNUSEDs), to make the first few symbols' codewords shorter.

 

<< PreviousWord BrowserNext >>
tom araya
sarcopterygii
marcus velleius paterculus
stahlhelm, bund der frontsoldaten
bichir
rockwell scale
first lord of the treasury
eleuthre irne du pont
kobe municipal transportation bureau
isabel la negra
mona (ascii art)
sonic adventure dx
unitary transformation
tipi
facelift
dirt
byker grove
okeh records
elliptic geometry
mellophone
emerson records
lincoln records
street fighter ii
list of cities, villages, and townships in michigan
hit of the week records
unary coding
bismarck archipelago campaign
saint mary's university
rudimentary peni
recoilless rifle
uss chillicothe
newtown, new south wales
invisible woman
mamie smith
mysteron
pump and dump
cochin china
syn flood
cocksucker blues
syn cookies
subsequence
uss atlanta
imperial japanese navy
longest common subsequence problem