Coding theorems on generalized cost measure

MaRDI QIDQ3622849zbMATH OpenFDO

Authors Rayees Ahmad Dar, Mirza Abdul Khalique Baig

Publication date 28 April 2009

Full work available at URL https://eudml.org/doc/129808, http://www.emis.de/journals/JIPAM/article941.html?sid=941

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

codewordcodeword lengthcost functiondecipherable codeholders inequalitysource alphabet

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Recommendations

• scientific article; zbMATH DE number 3954805
• Non-additive generalized ``useful \(R\)-norm information measures and coding theorem
• Some coding theorems based on three types of the exponential form of cost functions
• scientific article; zbMATH DE number 4039787
• Coding theorems on a non-additive generalized entropy of Havrda-Charvat and Tsallis

Cited in

(6)

• Coding Combinatorial Sources With Costs
• scientific article; zbMATH DE number 3954805 (Why is no real title available?)
• On the cost of worst case coding length constraints
• Some coding theorems based on three types of the exponential form of cost functions
• Non-additive generalized ``useful \(R\)-norm information measures and coding theorem
• Bounds on two generalized cost measures

This page was built for publication: Coding theorems on generalized cost measure

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