Trit
= Trit
{title2=$\log_2 3\ \text{bits}$}
A ternary digit, taking one of three values. A <codeword> of length $l$ over a three-symbol <alphabet> uses $l$ <trits>. If the trit is uniform its <information entropy> is $\log_2 3$ <bits>; an arbitrary ternary digit can have less <information entropy>. <Expected codeword length> in <trits> must therefore be distinguished from source <information entropy> measured in <bits>.