Maximal solid codes

MaRDI QIDQ2708467zbMATH OpenFDO

Authors Helmut Jürgensen, Stavros Konstantinidis, Masashi Katsura

Publication date 17 April 2001

Published in Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hierarchy of classes of codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45)

Recommendations

• Finite maximal solid codes
• scientific article; zbMATH DE number 1552695
• Maximal bifix codes
• Compositions of maximal codes
• Finite maximal infix codes
• Some combinatorial properties of solid codes
• Binary divisible codes of maximum dimension
• Completing solid codes to maximal comma-free codes
• Publication:4862900
• On the maximality of linear codes

Cited in

(12)

• Error-detecting properties of languages
• Some combinatorial properties of solid codes
• Automata for solid codes
• Overlap-free languages and solid codes
• scientific article; zbMATH DE number 522835 (Why is no real title available?)
• scientific article; zbMATH DE number 2143014 (Why is no real title available?)
• scientific article; zbMATH DE number 4185539 (Why is no real title available?)
• Finite maximal solid codes
• When variable-length codes meet the field of error detection
• Topologies for error-detecting variable-length codes
• On the universality of peptide computing
• Synchronization

This page was built for publication: Maximal solid codes

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