کتاب مرجع WorldCat

download pdf D. Aegidii Hunnii. Theses De Abrogando Exorcismo Quas Paulo Ante Discessum ex hac vita Conscripsit ut de iis publice in Witebergensi Academia disputaretur, دانلود D. Aegidii Hunnii. Theses De Abrogando Exorcismo Quas Paulo Ante Discessum ex hac vita Conscripsit ut de iis publice in Witebergensi Academia disputaretur,Aegidius Hunnius; Egidius Hunn; Ägidius Hunnius; Aegidius Hunn; Egidius Hunnius; All authors, کتاب های Aegidius Hunnius; Egidius Hunn; Ägidius Hunnius; Aegidius Hunn; Egidius Hunnius; All authors,Erphordiae Wittelius Wolfenbüttel Herzog August Bibliothek Erfurt 1606, لیست کتاب های Erphordiae Wittelius Wolfenbüttel Herzog August Bibliothek Erfurt 1606,WorldCat, کتاب های WorldCat

گت بلاگز Internet Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes / دانلود فایل

مشخصات کلی Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes

نویسنده کتاب (Author):

Fariña, Antonio; Gagie, Travis; Manzini, Giovanni; Navarro, Gonzalo; Ordóñez, Alberto

انتشارات (Publisher):

Springer 2016-09-21

ویرایش و نوع فایل (Edition/Format):

 Downloadable article : English

منبع (Database):

WorldCat

عنوان ژورنال (Publication):

60

موضوع (Subject):

Efficient and Compact Representations       Some Non-canonical Prefix-Free Codes       Tree-based representation      

توضیحات خلاصه (Summary):

[Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when we can choose the order in which codewords are assigned to characters. In this paper we first show how, given a probability distribution over an alphabet of σσ characters, we can store a nearly optimal alphabetic prefix-free code in o(σ)o(σ) bits such that we can encode and decode any character in constant time. We then consider a kind of code introduced recently to reduce the space usage of wavelet matrices (Claude, Navarro, and Ordóñez, Information Systems, 2015). They showed how to build an optimal prefix-free code such that the codewords’ lengths are non-decreasing when they are arranged such that their reverses are in lexicographic order. We show how to store such a code in O(σlogL+2ϵL)O(σlog⁡L+2ϵL) bits, where L is the maximum codeword length and ϵϵ is any positive constant, such that we can encode and decode any character in constant time under reasonable assumptions. Otherwise, we can always encode and decode a codeword of ℓℓ bits in time O(ℓ)O(ℓ) using O(σlogL)O(σlog⁡L) bits of space.  Read more…

ژانر / فرم:info:eu-repo/semantics/conferenceObject

موضوع:Internet resource

نوع منبع:Internet Resource, Article

تمام نویسندگان / همکاران: Fariña, Antonio; Gagie, Travis; Manzini, Giovanni; Navarro, Gonzalo; Ordóñez, Alberto

شناسه OCLC:979265496

Language Note:English

فهرست محتوا:0302-9743 1611-3349 http://hdl.handle.net/2183/18174 10.1007/978-3-319-46049-9_5


دانلود فایل ها

نویسنده : getblogs