dc.contributor.author |
Gunther, Ulrich |
en |
dc.contributor.author |
Hertling, P |
en |
dc.contributor.author |
Nicolescu, Radu |
en |
dc.contributor.author |
Titchener, M |
en |
dc.date.accessioned |
2009-04-16T23:18:52Z |
en |
dc.date.available |
2009-04-16T23:18:52Z |
en |
dc.date.issued |
1997-08 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-044 (1997) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3553 |
en |
dc.description.abstract |
T-Codes are a class of variable-length codes. Their self-synchronisation properties are
useful in compression and communication applications where error recovery rather than error correction is at issue, for example, in digital telephony. T-Codes may be used without
error correction or additional synchronisation mechanisms. Typically, the representation of
variable-length codes is a problem in computers based on a fixed-length word architecture.
This presents a problem in encoder and decoder applications. The present paper introduces a fixed-length format for storing and handling variable-length T-Code codewords, the
T-depletion codewords, which are derived from the recursive construction of the T-Code code-
words. The paper further proposes an algorithm for the conversion of T-Code codewords into
T-depletion codewords that may be used as a decoder for generalized T-Codes. As well as
representing all codewords of a T-Code set (the leaf nodes in the set's decoding tree), the
T-depletion code format also permits the representation of “pseudo-T codewords” - strings
that are not in the T-Code set. These strings are shown to correspond uniquely to all proper
prefixes of T-Code codewords, thus permitting the representation of both intermediate and final decoder states in a single format. We show that this property may be used to store
arbitrary finite and prefix-free variable-length codes in a compact fixed-length format. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |