2005 · 14 citations · 10 references
ComputingComputer ScienceInformation TechnologyCryptographyData EngineeringDigital CommunicationCoding TheoryData CompressionImage CompressionLossy Data CompressionText EncodingBandwidthBurrows-wheeler TransformCellular Communication NetworksCellular NetworksCompressionCompression AlgorithmsCompression TechniquesSecure Data Transmission
The compression algorithms reduce the redundancy in data representation to decrease the storage required for that data. Data compression offers an attractive approach to reducing communication costs by using available bandwidth effectively. There has been an unprecedented increase in the amount of digital data transmitted via networks especially through the Internet and mobile cellular networks, over the last decade. Digital data represent text, images, video, sound, computer programs, etc. With this trend expected to continue, it makes sense to pursue research on developing algorithms that can most effectively use available network bandwidth by maximally compressing data. A strategy called intelligent dictionary based encoding (IDBE) in conjunction with Burrows Wheeler Transform (BWT) is discussed to achieve this. It has been observed that a preprocessing of the text prior to conventional compression will improve the compression efficiency much better. The intelligent dictionary based encoding provides some level of confidentiality. The experimental results of this compression method are also analyzed.
10
A Block-sorting Lossless Data Compression Algorithm
Michael T. Burrows, D. J. Wheeler · 1994 · 2.4K citations
A Technique for High-Performance Data Compression
Implementing the PPM data compression scheme
Alistair Moffat · IEEE Transactions on Communications · 1990 · 421 citations
The context trees of block sorting compression
Niklas Larsson · 2002 · 47 citations
Preprocessing text to improve compression ratios
Holger Kruse, Amar Mukherjee · 2002 · 43 citations · Full text