About GDCC 2023
This competition focuses on the advantages of algorithms and their implementations for universal lossless data compression rather than for certain data types. We test compressors under the following scenarios:
Task 1:
JPEG LOSSLESS RECOMPRESSION
The goal of this task is to provide a fast and efficient lossless compressor and decompressor pair for JPEG-compressed files.
Task 2:
LPAQ8 ALGORITHM IMPROVEMENT
The goal of this task is to provide a fast and efficient lossless compressor and decompressor pair for a dataset of the mixed contents
Task 3:
FAST DUPLICATE STRING SEARCH
The task is to modify the string searching part of the provided GLZ LZ77 Demo compressor to obtain a higher compression ratio and/or speed.
Task 4:
FAST SECONDARY STAGE TRANSFORM
The goal of this task is to provide fast and efficient implementation of the Second Stage Transform (SST) algorithm for the Burrows-Wheeler Transformed (BWT) input.The transformed data has to be further compressed with the FSE entropy coder
Task 5:
COMPRESSION OF QUALITATIVE DATA
The goal of this task is to provide a fast and efficient lossless compressor and decompressor pair for qualitative data.
Task 6:
COMPRESSION OF QUANTITATIVE DATA
The goal of this task is to provide a fast and efficient lossless compressor and decompressor pair for quantitative data.
Task 7:
COMPRESSION OF MIXED DATA
The goal of this task is to provide a fast and efficient lossless compressor and decompressor pair for mixed data.
Task 8:
INDEPENDENT BLOCK COMPRESSION
The goal of this task is to provide a fast and efficient implementation of a block compressor/decompressor pair that allows decompression of subblocks within a block. All input blocks are of size 64KB (65536 bytes). Subblocks are of size 8KB (8192 byes) and are aligned at positions multiple of 8192.
categories
We impose speed limits to separate each of these four tests into three subcategories: rapid compression, balanced compression and high compression ratio (HCR). All told, the result is 12 categories and leaderboards, each with its own prizes.
Board of experts of 3rd edition of GDCC
3rd Edition Leaderboards
- Task 1
- Task 2
- Task 3
- Task 4
- Task 5
- Task 6
- Task 7
- Task 8
- Balanced
Charts for leaderboards
General notes
- The line joining the markers for different compressors on the scatter plot shows the Pareto frontier. That is, for each such compressor, no other analyzed programs in that category achieve better results for both the selected time and compression parameters.
- The names of submitted compressors appear in boldface.
- The names of submitted compressors that failed to fully comply with the competition rules appear in strikethrough.
- Test 1, Balanced
- Test 2, Balanced
- Test 3, Rapid
- Test 4, Rapid
- Test 5, Rapid
- Test 5, Balanced
- Test 5, HCR
- Test 6, Rapid
- Test 6, Balanced
- Test 6, HCR
- Test 7, Rapid
- Test 7, Balanced
- Test 7, HCR
- Test 8, Rapid
- Test 8, Balanced
- Test 8, HCR
- Full time
- Compression time
- Decompression time
- c_full_size
- c_full_size, megabytes
- Compression ratio
- Compression ratio, bits per byte
- Compression degree