All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

ODC: Frame for definition of Dense codes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F13%3A00196725" target="_blank" >RIV/68407700:21240/13:00196725 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.ejc.2012.07.014" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2012.07.014</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ejc.2012.07.014" target="_blank" >10.1016/j.ejc.2012.07.014</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    ODC: Frame for definition of Dense codes

  • Original language description

    The natural language compression made a great progress in last two decades. The main step in this evolution was the introduction of word-based compression by Moffat. Another improvement came with so called Dense codes which proved to be very fast in compression and decompression while keeping good compression ratio and direct search capability. Many variants of the Dense codes were described, each of them using its own definition. In this paper we present generalized concept of dense coding called OpenDense Code (ODC) which aims to be a frame for definition of many other dense code schemas. ODC underlines common features of the dense code schemas but at the same time allows to express the divergences of each of them. Using the frame of ODC we presenttwo new word-based statistical compression algorithms based on dense coding idea: Two Byte Dense Code (TBDC) and Self-Tuning Dense Code (STDC). Our algorithms improve the compression ratio and are considerate to smaller files which are ve

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2013

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    European Journal of Combinatorics

  • ISSN

    0195-6698

  • e-ISSN

  • Volume of the periodical

    2013

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    17

  • Pages from-to

    52-68

  • UT code for WoS article

    000310110100006

  • EID of the result in the Scopus database