Mathematical optimization and the synchronizing properties of encodings

DOI10.1016/0890-5401(88)90045-4zbMath0642.94039OpenAlexW1997961596MaRDI QIDQ1101414

Larry E. Stanfel

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90045-4

zbMATH Keywords

tree structureanagrammaticbinary exhaustive prefix codesminimal synchronizing delay

Mathematics Subject Classification ID

Integer programming (90C10) Prefix, length-variable, comma-free codes (94A45) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (1)

New optimization models for designing synchronizing codes

Uses Software

• LINDO

Cites Work

• A Method for the Construction of Minimum-Redundancy Codes
• On the structure of anagrammatic encodings
• Test for synchronizability of finite automata and variable length codes
• An optimum encoding with minimum longest code and total number of digits
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematical optimization and the synchronizing properties of encodings