Shortest Synchronizing Strings for Huffman Codes (Q3599120)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Shortest Synchronizing Strings for Huffman Codes	scientific article

Statements

scholarly article

0 references

Shortest Synchronizing Strings for Huffman Codes (English)

0 references

Marek Tomasz Biskup

0 references

Lecture Notes in Computer Science

0 references

publication date

3 February 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-85238-4_9

0 references

On the characterization of statistically synchronizable variable-length codes

0 references

Almost all complete binary prefix codes have a self-synchronizing string

0 references

On synchronizing prefix codes

0 references

Construction of minimum-redundance codes with an optimum synchronizing property

0 references

Synchronizing codewords of \(q\)-ary Huffman codes

0 references

On the construction of statistically synchronizable codes

0 references

Self-synchronizing Huffman codes (Corresp.)

0 references

0 references

Synchronizing generalized monotonic automata

0 references

Synchronizing finite automata on Eulerian digraphs.

0 references

On two Combinatorial Problems Arising from Automata Theory

0 references

Synchronizing automata with a letter of deficiency 2

0 references

An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture

0 references

Reset Sequences for Monotonic Automata

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-85238-4_9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3599120

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3599120&oldid=35091579"