Variable-to-fixed length codes: a geometrical approach to low-complexity source codes

Summary form only given. We consider the coding of a binary IID source using variable-to-fixed length (VF) source codes. The goal is to design "good" codes of low complexity. A VF code maps variable length source sequences (segments) into fixed length code sequences (codewords). We conclude that Petry codes are an efficient implementation of Tunstall codes and moreover that by approximating the enumeration an even better trade-off between redundancy and complexity is achieved.