Decompositions of recognizable strong maximal codes

DOI10.1016/0304-3975(93)90235-LzbMATH Open0778.68053MaRDI QIDQ685444FDOQ685444

Authors: Liang Zhang, Weide Qiu 

Publication date: 9 January 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 62492
• scientific article; zbMATH DE number 1047910
• Compositions of maximal codes
• scientific article; zbMATH DE number 123790
• scientific article; zbMATH DE number 1552695
• scientific article; zbMATH DE number 1560311
• On a class of perfect codes with maximum components
• scientific article; zbMATH DE number 3926268
• Codes and maximal monoids
• scientific article; zbMATH DE number 2044502

zbMATH Keywords

decomposition of codesrecognizable codesstrong codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rational strong codes and structure of rational group languages
• Title not available (Why is that?)

Cited In (7)

• Combinatorial properties of codes with degree \(n\)
• Groups and decompositions of codes
• Title not available (Why is that?)
• On the decomposition of prefix codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Decompositions of recognizable strong maximal codes

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