Comma-free code
A comma-free code is block code in which no concatenation of two code words contains a valid code word that overlaps both.[1]
Comma-free codes are also known as self-synchronizing block codes[2] because no synchronization is required to find the beginning of a code word.
In the literature, the requirement that all code words have to have the same length is sometimes dropped, resulting in the same class as self-synchronizing codes, see Self-synchronizing code.
See also
- Self-synchronizing code
- UTF-8, a comma-free character encoding
References
- ^ S. W. Golomb; Gordon, Basil; L. R. Welch (1958). "Comma-free Codes". Canadian Journal of Mathematics. Canadian Mathematical Society: 202–209. doi:10.4153/CJM-1958-023-9.
- ^ Donald Knuth (11 December 2015). Universal Commafree Codes. Stanford University. Retrieved 6 February 2016.
External links
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.