Codec effectiveness trades off against bits spent on side information

Evidence

In order to have longer symbol lengths, which allow greater coding efficiencies, other approaches are used. Golomb-Rice codes use a predetermined statistical distribution to remove the need for tables, thus allowing longer code words; they are used in some lossless encoding schemes. Another approach is arithmetic coding, which does not need predetermined distributions, but, by using the statistics of the symbols occurrence, can encode very long symbols and so approach the source entropy much more closely. — David M. Howard, Jamie Angus, Acoustics and Psychoacoustics, 2644 (#corroborates, via linked claim)

Categorization

• XREF: connects to: Codec artifacts are faint and need trained ears to detect — , Toole, Floyd E - Sound reproduction-…, 1744; A data source’s entropy gives the minimum bits needed to encode it — David Howard, Jamie Angus, coustics and Psychoacoustics, 2625; Entropy coding trade-offs limit how close code rates approach information-theoretic limits (+2 more)

Broader Connections

• Instrument filtering adds predictability that audio coders exploit as redundancy. #expands (0.85)
• Arithmetic coding approaches source entropy better than table-based Huffman methods #corroborates (0.75) — David M. Howard, Jamie Angus, Acoustics and Psychoacoustics, 2644