(s,c)-dense coding: an optimized compression code for natural language text databases.
DOI10.1007/B14038zbMATH Open1254.68119OpenAlexW4299547039MaRDI QIDQ5897136FDOQ5897136
Antonio Fariña, Gonzalo Navarro, María F. Esteller, Nieves R. Brisaboa
Publication date: 9 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b14038
Recommendations
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50) Computing methodologies for text processing; mathematical typography (68U15)
Cited In (20)
- New bounds on \(D\)-ary optimal codes
- Accelerating Boyer-Moore searches on binary texts
- Bicriteria Data Compression
- Title not available (Why is that?)
- A general compression algorithm that supports fast searching
- An efficient variable-to-fixed length encoding using multiplexed parse trees
- Title not available (Why is that?)
- Compressed matching for feature vectors
- Compressed matching in dictionaries
- ODC: frame for definition of dense codes
- Huffman coding with non-sorted frequencies
- Random access to Fibonacci encoded files
- Towards efficient positional inverted index
- Accelerating Boyer Moore Searches on Binary Texts
- Practical fixed length Lempel-Ziv coding
- Natural-Language Text Compression Using Reverse Multi-Delimiter Codes
- Lossless text compression by means of binary-coded ternary number representation
- Text and hypertext compression
- Binary mixed-digit data compression codes
- New word-based adaptive dense compressors
This page was built for publication: \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897136)
