On the construction of prefix-free and fix-free codes with specified codeword compositions

From MaRDI portal
(Redirected from Publication:765325)


DOI10.1016/J.DAM.2011.08.003MaRDI QIDQ765325zbMATH OpenOpenAlexFDO

Authors A. Kakhbod, Morteza Zadimoghaddam

Publication date 19 March 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1002.0097


zbMATH Keywords

approximation algorithmpolynomial-time algorithmfix-free codeprefix-free code

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)


Abstract: We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimizes the average codeword cost for general letter costs with uniform distribution of the codewords and present an approximation algorithm to find a near optimal fix-free code with a given constant cost.


Recommendations


Cites work


Cited in
(5)






This page was built for publication: On the construction of prefix-free and fix-free codes with specified codeword compositions

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_the_construction_of_prefix-free_and_fix-free_codes_with_specified_codeword_compositions&oldid=64165674"
Powered by MediaWiki