Data Compression and Serial Communication with Generalized T-Codes
| dc.creator | Günther,Ulrich | |
| dc.date | 1996 | |
| dc.date.accessioned | 2024-02-06T12:48:32Z | |
| dc.date.available | 2024-02-06T12:48:32Z | |
| dc.description | Variable-length T-Codes may be used to provide robust compression for data communication and storage on noisy channels or media. Over the past twelve years, a number of papers on T-Codes have been published in various journals and as technical reports. During this time, notation and scope of the T-Codes have changed considerably, giving rise to a more integrated theory of T-Codes as recursive codes. This paper presents all known core principles of T-Code theory by taking a recursive approach throughout. A sufficient condition for information sources, ensuring decoder self-synchronisation for the T-encoded symbol stream, is introduced. By example of a recursive program, the paper shows how a suitable T-Code set for encoding a given memoryless source can be found. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-002-11-0769 | |
| dc.identifier | https://lib.jucs.org/article/27306/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7071 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 2(11): 769-795 | |
| dc.subject | T-Codes | |
| dc.subject | coding | |
| dc.subject | synchronisation | |
| dc.subject | T-augmentation | |
| dc.subject | recursive code | |
| dc.subject | coding efficiency | |
| dc.subject | redundancy | |
| dc.subject | string decomposition | |
| dc.title | Data Compression and Serial Communication with Generalized T-Codes | |
| dc.type | Research Article |