On equivalence of two tests for codes

MaRDI QIDQ3615333zbMATH OpenFDO

Authors János Falucskai

Publication date 19 March 2009

Full work available at URL https://eudml.org/doc/55750

zbMATH Keywords

automatalength-variable codesSardinas-Patterson algorithmuniquely decipherable codes

Mathematics Subject Classification ID

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

Recommendations

• Some algorithms concerning uniquely decipherable codes
• Quadratic algorithms for testing of codes and \(\diamond\)-codes
• A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes
• ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH
• On a test for codes

Cited in

(5)

• A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes
• A novel test for unique decipherability of codes
• Quadratic algorithms for testing of codes and \(\diamond\)-codes
• On a test for codes
• Some algorithms concerning uniquely decipherable codes

This page was built for publication: On equivalence of two tests for codes

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