An efficient coding system for long source sequences

DOI10.1109/TIT.1981.1056356MaRDI QIDQ3908918zbMATH OpenOpenAlexFDO

Authors C. B. Jones

Publication date 1981

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

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

zbMATH Keywords

cryptographydata compressionencoding and decoding algorithmsnonblock arithmetic code

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to information and communication theory (94-04) Source coding (94A29) Arithmetic codes (94B40)

Recommendations

• scientific article; zbMATH DE number 4127149
• Fast and efficient coding of information sources
• scientific article; zbMATH DE number 3557667
• Efficient method of adaptive arithmetic coding for sources with large alphabets

Cited in

(9)

• Integrated encryption in dynamic arithmetic compression
• A novel block-based scheme for arithmetic coding
• Almost asymptotically optimal flag encoding of the integers
• scientific article; zbMATH DE number 503181 (Why is no real title available?)
• scientific article; zbMATH DE number 1424161 (Why is no real title available?)
• A variant of the Narayana coding scheme
• Algorithms and architectures for cryptography and source coding in non-volatile flash memories
• Integrated encryption in dynamic arithmetic compression
• Text compression methods

This page was built for publication: An efficient coding system for long source sequences

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