Skip to main content

Questions tagged [compression]

The name given to the process of encoding data such that it uses lesser number of bits as compared to the original representation.

1 vote
1 answer
102 views

Intro (See the version 1.0.0.) (See the GitHub repository.) This time I have got rid of some generic classes and adapted the entire code base to deal with byte ...
coderodde's user avatar
  • 32.3k
5 votes
1 answer
465 views

Intro (See the version A Java program for compressing/decompressing files via Huffman algorithms (version 1.1.1).) (The full repository is here. It contains also some unit tests that do not fit in ...
coderodde's user avatar
  • 32.3k
2 votes
1 answer
146 views

Intro (This is the continuation of HuffmannEncoder.java - computing prefix codes for arbitrary (generic) alphabets.) (See the GitHub repository.) This time: I have fixed the misspelled ...
coderodde's user avatar
  • 32.3k
4 votes
2 answers
360 views

(See the continuation of this post at HuffmanEncoder.java - computing prefix codes for arbitrary (generic) alphabets - Take II.) I have this Java implementation of the Huffmann encoding. It looks like ...
coderodde's user avatar
  • 32.3k
4 votes
3 answers
484 views

Intro In this post, I will elaborate on A simple method for compressing white space in text (Java). Here, I have incorporated some advice offered by Chris. Also, this version preserves a single new ...
coderodde's user avatar
  • 32.3k
5 votes
1 answer
532 views

(The story continues in A simple method for compressing white space in text (Java) - Take II.) Intro Now I have that text space compressor. For example, ...
coderodde's user avatar
  • 32.3k
2 votes
1 answer
152 views

Intro This time, I have implemented the Shannon-Fano coding. Code io.github.coderodde.compression.ShannonFanoEncoder.java ...
coderodde's user avatar
  • 32.3k
2 votes
1 answer
95 views

Range coder implementation provided here is not the same as the traditional arithmetic coder covered by historical patents. Range coding was developed as a patent-free alternative to arithmetic coding....
Leo's user avatar
  • 249
2 votes
1 answer
145 views

Code review would be appreciated. Nothing heroic. Very trivial implementation of Adaptive Huffman Coding, LZ77 compression and deflate coding by the book: https://github.com/leok7v/sqz Reason for ...
Leo's user avatar
  • 249
2 votes
2 answers
294 views

This is a small project to implement Philip Gage's Byte Pair Encoding compression for the purpose of learning C. In particular, it's written in C89 for fun as that's what would've been contemporary (...
qwr's user avatar
  • 1,233
2 votes
2 answers
237 views

I wrote this to check files for successful compression with LZ4. Any advice is welcome. Particularly regarding raising exceptions and error handling. ...
voices's user avatar
  • 767
1 vote
1 answer
152 views

The following is a general purpose file compression function with the following features: It can take either a single file or directory as the source input It defaults to the source directory when to ...
Christian Fitzner's user avatar
0 votes
1 answer
125 views

Usage of the program is in Facebook. Intro In this JavaFX program, a user is presented with a white canvas with a black circle at the center of the canvas. Then, the user has 10 seconds to record a ...
coderodde's user avatar
  • 32.3k
5 votes
1 answer
333 views

I'm trying to build a format that can represent the user's cart on my website in the most compact way. The website is related to computer parts and there are 23 product categories. Each product has an ...
Raees Iqbal's user avatar
3 votes
2 answers
1k views

Here is an implementation of compression with Huffman coding. It works well by my testing. It compresses a 1 GB string in about 30 seconds, and decompresses in about 15 seconds with VisualStudio 2022 &...
Aykhan Hagverdili's user avatar

15 30 50 per page
1
2 3 4 5
14