Editing Fibonacci coding (section)

==Comparison with other universal codes==

Fibonacci coding has a useful property that sometimes makes it attractive in comparison to other universal codes: it is an example of a [[self-synchronizing code]], making it easier to recover data from a damaged stream.  With most other universal codes, if a single [[bit]] is altered, then none of the data that comes after it will be correctly read.  With Fibonacci coding, on the other hand, a changed bit may cause one token to be read as two, or cause two tokens to be read incorrectly as one, but reading a "0" from the stream will stop the errors from propagating further.  Since the only stream that has no "0" in it is a stream of "11" tokens, the total [[edit distance]] between a stream damaged by a single bit error and the original stream is at most three.

This approach, encoding using sequence of symbols, in which some patterns (like "11") are forbidden, can be freely generalized.<ref>{{cite arXiv |eprint=0710.3861 |last1=Duda |first1=Jarek |title=Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms |year=2007 |class=cs.IT }}</ref>