No label defined (Q4070732)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3489011
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3489011

      Statements

      1974
      0 references
      error-correcting codes
      0 references
      variable-length codes
      0 references
      synchronizable codes
      0 references
      irredundance
      0 references
      correctability
      0 references
      decodability
      0 references
      synchronizability
      0 references
      This book consists of three parts: an introduction (chap. 1 and 2), a study of error-correcting codes (chap. 3--6) and a selection of published papers on tests for certain properties of variable-length codes and on synchronizable codes (chap. 7--11). At the end I list the published papers on which the last five chapters base. Here is presented a detailed study of the theory of variable-length abstract codes (no special assumption is made on the structure of the alphabet). Let \(a, b, \ldots \) be sequences of various lengths whose terms are elements (letters) of a set (alphabet), which is not necessarily assumed finite. A code is a finite set \(A\) of such sequences. Free semigroups are of importance in this part of coding theory and characterizations of free semigroups (theorems 2.3 and 4.3) are used. Certain (nondeterministic) mappings associated with codes are introduced and studied (chap. 3). Irredundance and precorrecting are defined and characterized. The notion of an expandable code property, which runs through much of the study, is formally defined and discussed. This is done in the context of decodability (chap. 4). The code properties of synchronizability and comma-freedom are treated in chap. 5. A generalization of the notion of scansion is used to introduce the concept of an unambiguous set. This latter notion permits a characterization of the code-related properties of irredundance, correctability, decodability and synchronizability. There are some interesting generalizations of results of Levenshteĭn (e.g. chap. 3). I think that the publication of the results in this form is useful not only for specialists in coding theory. Chap. 7--11: \textit{L. Calabi} and \textit{W. E. Hartnett} [Inf. Control 15, 235--249 (1969; Zbl 0205.20302)]; \textit{W. E. Hartnett} [Inf. Control 13, 20--45 (1968; Zbl 0174.50804)]; \textit{T. R. Hatcher} [IEEE Trans. Inf. Theory 15, 620--636 (1969; Zbl 0176.49402)]; \textit{L. Calabi} and \textit{W. E. Hartnett} [IEEE Trans. Inf. Theory 15, 102--106 (1969; Zbl 0169.21607)].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references