Almost all complete binary prefix codes have a self-synchronizing string
The probability that a complete binary prefix code has a self-synchronizing string approaches one, as the number of codewords tends to infinity.
Gespeichert in:
Veröffentlicht in: | IEEE transactions on information theory 2003-09, Vol.49 (9), p.2219-2225 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The probability that a complete binary prefix code has a self-synchronizing string approaches one, as the number of codewords tends to infinity. |
---|---|
ISSN: | 0018-9448 1557-9654 |
DOI: | 10.1109/TIT.2003.815803 |