scientific article; zbMATH DE number 3930882

MaRDI QIDQ3705345zbMATH OpenFDO

Authors Al. A. Markov, T. G. Smirnova

Publication date 1984

zbMATH Keywords

antiprefix propertybounded decoding delayconstraint in wordsequation in wordsoptimal generalized prefix coding of local models of languagesprobabilistic model of a diagram-bounded language

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• scientific article; zbMATH DE number 4168387
• scientific article; zbMATH DE number 1286207
• Algorithmic ways of deciding whether an infinite language is a code
• Codes and local constraints
• scientific article; zbMATH DE number 8007

Cited in

(11)

• Complexity aspects of guessing prefix codes
• Efficient coding of formalized messages
• Efficient prefix coding of uncertainty spaces
• On alphabetic coding for superwords
• A fast algorithm for adaptive prefix coding
• A generalization of the binary preparata code
• scientific article; zbMATH DE number 4178784 (Why is no real title available?)
• scientific article; zbMATH DE number 3907800 (Why is no real title available?)
• scientific article; zbMATH DE number 1286207 (Why is no real title available?)
• On the structure of anagrammatic encodings
• Codes and local constraints

This page was built for publication:

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