Combinatorial properties of codes with degree \(n\)
type: Item
instance of: scholarly article
title: Combinatorial properties of codes with degree \(n\)
zbMATH Open document ID: 1029.94014
DOI: 10.1016/S0195-6698(03)00016-7
author: Liang Zhang
author: Hong-Fen Zheng
author: K. P. Shum
published in: European Journal of Combinatorics
publication date: 2003-06-26T00:00:00Z
review text: The authors study the very thin codes of degree \(n\). The combinatorial properties of synchronizing codes are extended to the codes of degree \(n\geq 2\). By using a very thin code of degree \(n\), it is shown that it is possible to localize the \(n\) positions of the coded message and that the decoding of the message must pass through one of these positions. It is also proved that the degree of the finite maximal prefix codes can be determined by the gcd of the orders of their letters. The properties of codes of degree 2 are studied in particular.
Mathematics Subject Classification ID: 94A45
Mathematics Subject Classification ID: 94B50
zbMATH DE Number: 1939355
zbMATH Keywords: degrees of codes
zbMATH Keywords: Suschkewitch groups
zbMATH Keywords: very thin codes
zbMATH Keywords: synchronizing codes
zbMATH Keywords: maximal prefix codes
reviewed by: Bai Kishan Dass
MaRDI profile type: Publication
cites work: Q4430300
cites work: Decompositions of recognizable strong maximal codes
cites work: On group codes
cites work: Q4001349
cites work: Rational strong codes and structure of rational group languages
cites work: On completion of codes with finite deciphering delay
description: scientific article; zbMATH DE number 1939355