NDLI: In-place length-restricted prefix coding

Content Provider	IEEE Xplore Digital Library
Author	Milidiu, R.L. Pessoa, A.A. Laber, E.S.
Copyright Year	1998
Description	Author affiliation: Dept. de Inf., PUC, Rio de Janeiro, Brazil (Milidiu, R.L.)
Abstract	Huffman codes, combined with word-based models, are considered efficient compression schemes for full-text retrieval systems. The decoding rate for these schemes can be substantially improved if the maximum length of the codewords is not greater then the machine word size L. However, if the vocabulary is large, simple methods for generating optimal length-restricted codes are either too slow or require a significantly large amount of memory. We present an in-place, simple and fast implementation for the BRCI (Build, Remove, Condense and Insert) algorithm, an approximative method for length-restricted coding. It overwrites a sorted input list of n weights with the corresponding codeword lengths in O(n) time. In addition, the worst-case compression loss introduced by BRCI codes with respect to unrestricted Huffman codes is proved to be negligible for all practical values of both L and n.
Starting Page	50
Ending Page	59
File Size	230791
Page Count	10
File Format	PDF
ISBN	0818686642
DOI	10.1109/SPIRE.1998.712982
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-09-11
Publisher Place	Bolivia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Decoding Delay Databases Encoding Vocabulary Information retrieval Upper bound Polynomials
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Reconciling similar sets of data

Low-memory adaptive prefix coding (2008).

Low-memory adaptive prefix coding (2009).

A Fast Algorithm for Adaptive Prefix Coding

In-place Length-Restricted Prefix Coding (1998)

On decoding delay of intra-session random linear network coding for line networks

Dynamic shannon coding (2005).

Coding delay analysis of Chunked codes over line networks

On Random Network Coding for Multicast

In-place length-restricted prefix coding

Similar Documents

Reconciling similar sets of data

Low-memory adaptive prefix coding (2008).

Low-memory adaptive prefix coding (2009).

A Fast Algorithm for Adaptive Prefix Coding

In-place Length-Restricted Prefix Coding (1998)

On decoding delay of intra-session random linear network coding for line networks

Dynamic shannon coding (2005).

Coding delay analysis of Chunked codes over line networks

On Random Network Coding for Multicast

In-place length-restricted prefix coding