Universal Compression and Retrieval:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Dordrecht
Springer Netherlands
1994
|
| Schriftenreihe: | Mathematics and Its Applications
274 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Objectives Computer and communication practice relies on data compression and dictionary search methods. They lean on a rapidly developing theory. Its exposition from a new viewpoint is the purpose of the book. We start from the very beginning and finish with the latest achievements of the theory, some of them in print for the first time. The book is intended for serving as both a monograph and a self-contained textbook. Information retrieval is the subject of the treatises by D. Knuth (1973) and K. Mehlhorn (1987). Data compression is the subject of source coding. It is a chapter of information theory. Its up-to-date state is presented in the books of Storer (1988), Lynch (1985), T. Bell et al. (1990). The difference between them and the present book is as follows. First. We include information retrieval into source coding instead of discussing it separately. Information-theoretic methods proved to be very effective in information search. Second. For many years the target of the source coding theory was the estimation of the maximal degree of the data compression. This target is practically bit today. The sought degree is now known for most of the sources. We believe that the next target must be the estimation of the price of approaching that degree. So, we are concerned with trade-off between complexity and quality of coding. Third. We pay special attention to universal families that contain a good com pressing map for every source in a set |
| Beschreibung: | 1 Online-Ressource (VIII, 224 p) |
| ISBN: | 9789401736282 9789048143573 |
| DOI: | 10.1007/978-94-017-3628-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042424328 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1994 |||| o||u| ||||||eng d | ||
| 020 | |a 9789401736282 |c Online |9 978-94-017-3628-2 | ||
| 020 | |a 9789048143573 |c Print |9 978-90-481-4357-3 | ||
| 024 | 7 | |a 10.1007/978-94-017-3628-2 |2 doi | |
| 035 | |a (OCoLC)1184485127 | ||
| 035 | |a (DE-599)BVBBV042424328 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 003.54 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Krichevsky, Rafail |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Universal Compression and Retrieval |c by Rafail Krichevsky |
| 264 | 1 | |a Dordrecht |b Springer Netherlands |c 1994 | |
| 300 | |a 1 Online-Ressource (VIII, 224 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Mathematics and Its Applications |v 274 | |
| 500 | |a Objectives Computer and communication practice relies on data compression and dictionary search methods. They lean on a rapidly developing theory. Its exposition from a new viewpoint is the purpose of the book. We start from the very beginning and finish with the latest achievements of the theory, some of them in print for the first time. The book is intended for serving as both a monograph and a self-contained textbook. Information retrieval is the subject of the treatises by D. Knuth (1973) and K. Mehlhorn (1987). Data compression is the subject of source coding. It is a chapter of information theory. Its up-to-date state is presented in the books of Storer (1988), Lynch (1985), T. Bell et al. (1990). The difference between them and the present book is as follows. First. We include information retrieval into source coding instead of discussing it separately. Information-theoretic methods proved to be very effective in information search. Second. For many years the target of the source coding theory was the estimation of the maximal degree of the data compression. This target is practically bit today. The sought degree is now known for most of the sources. We believe that the next target must be the estimation of the price of approaching that degree. So, we are concerned with trade-off between complexity and quality of coding. Third. We pay special attention to universal families that contain a good com pressing map for every source in a set | ||
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Coding theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer engineering | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Coding and Information Theory | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Electrical Engineering | |
| 650 | 4 | |a Plant Systematics/Taxonomy/Biogeography | |
| 650 | 4 | |a Informatik | |
| 650 | 0 | 7 | |a Datenkompression |0 (DE-588)4121121-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Datenkompression |0 (DE-588)4121121-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-94-017-3628-2 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027859745 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153101161070592 |
|---|---|
| any_adam_object | |
| author | Krichevsky, Rafail |
| author_facet | Krichevsky, Rafail |
| author_role | aut |
| author_sort | Krichevsky, Rafail |
| author_variant | r k rk |
| building | Verbundindex |
| bvnumber | BV042424328 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184485127 (DE-599)BVBBV042424328 |
| dewey-full | 003.54 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003.54 |
| dewey-search | 003.54 |
| dewey-sort | 13.54 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/978-94-017-3628-2 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03261nmm a2200529zcb4500</leader><controlfield tag="001">BV042424328</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1994 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789401736282</subfield><subfield code="c">Online</subfield><subfield code="9">978-94-017-3628-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789048143573</subfield><subfield code="c">Print</subfield><subfield code="9">978-90-481-4357-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-94-017-3628-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184485127</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042424328</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">003.54</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Krichevsky, Rafail</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Universal Compression and Retrieval</subfield><subfield code="c">by Rafail Krichevsky</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer Netherlands</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 224 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Mathematics and Its Applications</subfield><subfield code="v">274</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Objectives Computer and communication practice relies on data compression and dictionary search methods. They lean on a rapidly developing theory. Its exposition from a new viewpoint is the purpose of the book. We start from the very beginning and finish with the latest achievements of the theory, some of them in print for the first time. The book is intended for serving as both a monograph and a self-contained textbook. Information retrieval is the subject of the treatises by D. Knuth (1973) and K. Mehlhorn (1987). Data compression is the subject of source coding. It is a chapter of information theory. Its up-to-date state is presented in the books of Storer (1988), Lynch (1985), T. Bell et al. (1990). The difference between them and the present book is as follows. First. We include information retrieval into source coding instead of discussing it separately. Information-theoretic methods proved to be very effective in information search. Second. For many years the target of the source coding theory was the estimation of the maximal degree of the data compression. This target is practically bit today. The sought degree is now known for most of the sources. We believe that the next target must be the estimation of the price of approaching that degree. So, we are concerned with trade-off between complexity and quality of coding. Third. We pay special attention to universal families that contain a good com pressing map for every source in a set</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding and Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Plant Systematics/Taxonomy/Biogeography</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenkompression</subfield><subfield code="0">(DE-588)4121121-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenkompression</subfield><subfield code="0">(DE-588)4121121-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-94-017-3628-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027859745</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042424328 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:15Z |
| institution | BVB |
| isbn | 9789401736282 9789048143573 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027859745 |
| oclc_num | 1184485127 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (VIII, 224 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Springer Netherlands |
| record_format | marc |
| series2 | Mathematics and Its Applications |
| spelling | Krichevsky, Rafail Verfasser aut Universal Compression and Retrieval by Rafail Krichevsky Dordrecht Springer Netherlands 1994 1 Online-Ressource (VIII, 224 p) txt rdacontent c rdamedia cr rdacarrier Mathematics and Its Applications 274 Objectives Computer and communication practice relies on data compression and dictionary search methods. They lean on a rapidly developing theory. Its exposition from a new viewpoint is the purpose of the book. We start from the very beginning and finish with the latest achievements of the theory, some of them in print for the first time. The book is intended for serving as both a monograph and a self-contained textbook. Information retrieval is the subject of the treatises by D. Knuth (1973) and K. Mehlhorn (1987). Data compression is the subject of source coding. It is a chapter of information theory. Its up-to-date state is presented in the books of Storer (1988), Lynch (1985), T. Bell et al. (1990). The difference between them and the present book is as follows. First. We include information retrieval into source coding instead of discussing it separately. Information-theoretic methods proved to be very effective in information search. Second. For many years the target of the source coding theory was the estimation of the maximal degree of the data compression. This target is practically bit today. The sought degree is now known for most of the sources. We believe that the next target must be the estimation of the price of approaching that degree. So, we are concerned with trade-off between complexity and quality of coding. Third. We pay special attention to universal families that contain a good com pressing map for every source in a set Computer science Coding theory Computational complexity Computer engineering Computer Science Coding and Information Theory Discrete Mathematics in Computer Science Electrical Engineering Plant Systematics/Taxonomy/Biogeography Informatik Datenkompression (DE-588)4121121-2 gnd rswk-swf Datenkompression (DE-588)4121121-2 s 1\p DE-604 https://doi.org/10.1007/978-94-017-3628-2 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Krichevsky, Rafail Universal Compression and Retrieval Computer science Coding theory Computational complexity Computer engineering Computer Science Coding and Information Theory Discrete Mathematics in Computer Science Electrical Engineering Plant Systematics/Taxonomy/Biogeography Informatik Datenkompression (DE-588)4121121-2 gnd |
| subject_GND | (DE-588)4121121-2 |
| title | Universal Compression and Retrieval |
| title_auth | Universal Compression and Retrieval |
| title_exact_search | Universal Compression and Retrieval |
| title_full | Universal Compression and Retrieval by Rafail Krichevsky |
| title_fullStr | Universal Compression and Retrieval by Rafail Krichevsky |
| title_full_unstemmed | Universal Compression and Retrieval by Rafail Krichevsky |
| title_short | Universal Compression and Retrieval |
| title_sort | universal compression and retrieval |
| topic | Computer science Coding theory Computational complexity Computer engineering Computer Science Coding and Information Theory Discrete Mathematics in Computer Science Electrical Engineering Plant Systematics/Taxonomy/Biogeography Informatik Datenkompression (DE-588)4121121-2 gnd |
| topic_facet | Computer science Coding theory Computational complexity Computer engineering Computer Science Coding and Information Theory Discrete Mathematics in Computer Science Electrical Engineering Plant Systematics/Taxonomy/Biogeography Informatik Datenkompression |
| url | https://doi.org/10.1007/978-94-017-3628-2 |
| work_keys_str_mv | AT krichevskyrafail universalcompressionandretrieval |