IDEAS home Printed from https://ideas.repec.org/a/vrs/ijsiel/v12y2022i2p3-10n7.html
   My bibliography  Save this article

In search for the simplest example that proves Huffman coding overperforms Shannon-Fano coding

Author

Listed:
  • Breazu Macarie

    (Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania)

  • Morariu Daniel I.

    (Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania)

  • Crețulescu Radu G.

    (Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania)

  • Pitic Antoniu G.

    (Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania)

  • Bărglăzan Adrian A.

    (Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania)

Abstract

Shannon-Fano coding (SFC) and Huffman coding (HC) are classic and well-known algorithms, but still in use today. The search for the simplest example that proves HC overperforms SFC is still of interest. The problem is not as trivial as it looks like at first view because of several decisions that must be considered. We perform a full-search of the stream data space for a maximum stream length of 100. Depending on additional requests we impose, the simplest solution we found is {1,1,1,1,3} when we accept to select a specific cutting, {2,3,3,3,7} when we accept only deterministic (unique) cuttings and {4,5,6,7,14} when we also ask for different frequencies for symbols as well.

Suggested Citation

  • Breazu Macarie & Morariu Daniel I. & Crețulescu Radu G. & Pitic Antoniu G. & Bărglăzan Adrian A., 2022. "In search for the simplest example that proves Huffman coding overperforms Shannon-Fano coding," International Journal of Advanced Statistics and IT&C for Economics and Life Sciences, Sciendo, vol. 12(2), pages 3-10, December.
    • Handle: RePEc:vrs:ijsiel:v:12:y:2022:i:2:p:3-10:n:7
    DOI: 10.2478/ijasitels-2022-0001
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/ijasitels-2022-0001
    Download Restriction: no
    File URL: https://libkey.io/10.2478/ijasitels-2022-0001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vrs:ijsiel:v:12:y:2022:i:2:p:3-10:n:7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.