Almost surely complete parsing and variable-to-variable length coding
Mikihiko Nishiara, Hiroyoshi Morita · 2002
We introduce the idea of proper and almost surely complete parsing. This parsing can uniquely segment the source output with probability one, and strengthens the coding converse theorem. Some kinds of non-proper parsing are involved in the proper and almost surely complete parsing.