Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A nearly-optimal Fano-based coding algorithm

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

DOI10.1016/S0306-4573(03)00007-4zbMath1091.68053DBLPjournals/ipm/RuedaO04WikidataQ60328020 ScholiaQ60328020MaRDI QIDQ1881249

B. John Oommen, Luis G. Rueda

Publication date: 4 October 2004

Published in: Information Processing and Management (Search for Journal in Brave)


zbMATH Keywords

Huffman's algorithmstatistical coding techniques


Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)


Related Items (2)

An adaptive character wordlength algorithm for data compression ⋮ A fast and efficient nearly-optimal adaptive Fano coding scheme






This page was built for publication: A nearly-optimal Fano-based coding algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1881249&oldid=14282906"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki