New optimization models for designing synchronizing codes

DOI10.1016/0895-7177(90)90076-YzbMATH Open0709.94019OpenAlexW2000856108MaRDI QIDQ922437FDOQ922437

Larry E. Stanfel

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(90)90076-y

zbMATH Keywords

integer programmingvariable length codesminimum redundancy codesynchronizing codeunlabeled binary tree structure

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• An optimum encoding with minimum longest code and total number of digits
• Mathematical optimization and the synchronizing properties of encodings

Cited In (2)

• Title not available (Why is that?)
• Optimal synchronizing experiments with linear automata

   Recommendations

• Mathematical optimization and the synchronizing properties of encodings 👍 👎
• Binary Huffman equivalent codes with a short synchronizing codeword 👍 👎
• On codeword lengths guaranteeing synchronization 👍 👎
• Optimal synchronous coding 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: New optimization models for designing synchronizing codes

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