Interval algorithm for homophonic coding

DOI10.1109/18.915659MaRDI QIDQ4544538zbMATH OpenOpenAlexFDO

Authors Mamoru Hoshi, Te Sun Han

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.915659

zbMATH Keywords

arithmetic codingcost codingElias codinghomophonic codinginterval algorithminterval partitionsrandom number generationsuccessive refinement

Mathematics Subject Classification ID

General methods in interval analysis (65G40) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 1455099
• Efficient homophonic coding
• A fast and efficient homophonic coding algorithm
• scientific article; zbMATH DE number 4070801
• A fast method for complete randomization of messages.

Cited in

(6)

• On numerically decipherable codes and their homophonic partitions
• Universal homophonic coding scheme using differential encoding and interleaving
• A framework for interval quantization and application to interval based algorithms in digital signal processing
• scientific article; zbMATH DE number 4070801 (Why is no real title available?)
• scientific article; zbMATH DE number 1455099 (Why is no real title available?)
• A fast and efficient homophonic coding algorithm

This page was built for publication: Interval algorithm for homophonic coding

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