Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3518695

From MaRDI portal
Publication:4096859
Jump to:navigation, search

zbMATH Open0331.94005MaRDI QIDQ4096859FDOQ4096859


Authors: Norbert Cot Edit this on Wikidata


Publication date: 1975



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




Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)



Cited In (2)

  • A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
  • Bounds for optimalα-β binary trees





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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4096859&oldid=17860358"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 06:46. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki