Combinatorial properties of codes with degree n

DOI10.1016/S0195-6698(03)00016-7MaRDI QIDQ1395008zbMATH OpenFDO

Authors Liang Zhang, Hong-Fen Zheng, K. P. Shum

Publication date 26 June 2003

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0195-6698(03)00016-7

zbMATH Keywords

degrees of codesmaximal prefix codesSuschkewitch groupssynchronizing codesvery thin codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Synchronization error-correcting codes (94B50)

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.

Recommendations

• The completion of very thin prefix codes with degree n
• Synchronization and decomposability for a family of codes. II
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• Codes with bounded synchronization delay
• scientific article; zbMATH DE number 3950378

Cites work

• Decompositions of recognizable strong maximal codes
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• On completion of codes with finite deciphering delay
• On group codes
• Rational strong codes and structure of rational group languages

Cited in

(7)

• Some combinatorial properties of solid codes
• The completion of very thin prefix codes with degree n
• scientific article; zbMATH DE number 3950378 (Why is no real title available?)
• scientific article; zbMATH DE number 176765 (Why is no real title available?)
• scientific article; zbMATH DE number 3409222 (Why is no real title available?)
• Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
• Combinatorial properties of the G-degree

This page was built for publication: Combinatorial properties of codes with degree \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395008)