The Construction of Variable-length Comma-Free Codes

DOI10.1093/COMJNL/28.4.379MaRDI QIDQ3680752zbMATH OpenOpenAlexFDO

Authors John A. Llewellyn

Publication date 1985

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/28.4.379

zbMATH Keywords

algorithmfinite state modelsScholtz methodvariable-length codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Maximal and variable word-length comma-free codes
• A family of comma-free codes with even word-length
• Varieties of comma-free codes
• Finite Completion of comma-free codes Part 1
• Comma-free error-correcting codes

Cited in

(12)

• Restrictions and generalizations on comma-free codes
• scientific article; zbMATH DE number 3891253 (Why is no real title available?)
• A family of circular systematic comma-free codes
• Constructions for variable-length error-correcting codes
• scientific article; zbMATH DE number 6765487 (Why is no real title available?)
• A family of comma-free codes with even word-length
• Comma-free error-correcting codes
• Maximal and variable word-length comma-free codes
• Computer-aided constructions of commafree codes
• Complete variable-length codes: an excursion into word edit operations
• Binary templates for comma-free DNA codes
• Varieties of comma-free codes

This page was built for publication: The Construction of Variable-length Comma-Free Codes

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