Combinatorial properties of quasi-composition of codes

MaRDI QIDQ3445612zbMATH OpenFDO

Authors C. L. Shen

Publication date 12 June 2007

zbMATH Keywords

prefix 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) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Properties of quasi-composition and completion of circular codes
• scientific article; zbMATH DE number 218228
• Combining construction of perfect binary codes
• On constant composition codes
• scientific article; zbMATH DE number 3463503

Cited in

(7)

• Some combinatorial properties of solid codes
• Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
• Properties of quasi-composition and completion of circular codes
• Combinatorial Properties for Traceability Codes Using Error Correcting Codes
• scientific article; zbMATH DE number 218228 (Why is no real title available?)
• A Combinatorial Interpretation for the Shor-Laflamme Weight Enumerators of CWS Codes
• Combinatorial aspects of jump codes

This page was built for publication: Combinatorial properties of quasi-composition of codes

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