scientific article; zbMATH DE number 3557667

zbMATH Open0357.94021MaRDI QIDQ4133533FDOQ4133533

Authors:

Publication date: 1975

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3557666
• Multi-alphabet universal coding of memoryless sources
• Publication:4206688
• Noiseless coding of binary finite-order Markov sources (Corresp.)
• Efficient universal noiseless source codes

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (14)

• Title not available (Why is that?)
• A source matching approach to finding minimax codes
• Title not available (Why is that?)
• A stack algorithm for source coding with a fidelity criterion
• Title not available (Why is that?)
• An efficient coding system for long source sequences
• Interval and recency rank source coding: Two on-line adaptive variable-length schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new method of partial generalized interval transformations for memoryless source coding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analytical coding of Gaussian sources
• Title not available (Why is that?)

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 Q4133533)