Foldes, Stephan ; Singhi, Navin M. (2006) On instantaneous codes Journal of Combinatorics, 31 . pp. 317-326. ISSN 1097-1440
|
PDF
- Author Version
156kB |
Official URL: http://www.math.tut.fi/algebra/papers/INSTCODES.pd...
Abstract
Maximal instantaneous codes are characterized by the property that they allow unique parsing of every infinite string. The sequence of codeword lengths of a maximal instantaneous code, sequenced in lexicographic order of the codewords, completely determines the code itself. Any increasing, decreasing or unimodal reordering of such a sequence again corresponds to a maximal instantaneous code. Lexicographic length sequences are characterized by a family of Kraft-type equalities.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to International Press. |
ID Code: | 89781 |
Deposited On: | 30 Apr 2012 14:25 |
Last Modified: | 19 May 2016 04:14 |
Repository Staff Only: item control page