Some algorithms concerning uniquely decipherable codes

MaRDI QIDQ5851855zbMATH OpenFDO

Authors János Falucskai

Publication date 25 January 2010

zbMATH Keywords

automatalength-variable codesuniquely decipherable codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Decoding (94B35)

Recommendations

• On equivalence of two tests for codes
• scientific article; zbMATH DE number 3883641
• A novel test for unique decipherability of codes
• A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes
• scientific article; zbMATH DE number 1740158

Cited in

(12)

• A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes
• A fast algorithm for the unique decipherability of multivalued encodings
• A novel test for unique decipherability of codes
• scientific article; zbMATH DE number 3883641 (Why is no real title available?)
• Solving XOR Plaintext Strings with the Viterbi Algorithm
• An efficient algorithm for testing immutability of variable-length codes
• On Unique Decodability
• On equivalence of two tests for codes
• Deciding unique decodability of bigram counts via finite automata
• A comparison of known codes, random codes, and the best codes
• Quadratic algorithms for testing of codes and \(\diamond\)-codes
• On a test for codes

This page was built for publication: Some algorithms concerning uniquely decipherable codes

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