Seminal
The magazine and atlas of EU-funded researchA new publication from the web and AI team at Scott Charnley

Atlas / Spain

European Research Council grant · Running

UNIDACT Universal Data Compression with Circular Context Trees

Coordinator
Universitat Politecnica De Catalunya, Spain
Runs
1 January 2025 to 30 June 2026
Status
Running
EU funding
€150k
Total cost
—
Partners
2 organisations in 1 countries
Type
European Research Council grant
Grant agreement
101158232

What the project is doing

In the project's own words, from its summary on CORDIS.

Within the ITUL project, funded by an ERC Consolidator Grant, we have developed a data compression algorithm based on circular context trees. The proposed algorithm is universal in that it can compress any type of data. The proposed compression algorithm offers unprecedented compression performance, and shows an average of at least 82% improvement over commercial algorithms like Lempel-Ziv (ZIP), Burrows-Wheeler transform compression (BZIP), and more complex state-of-the-art algorithms like prediction by partial matching (PPM) and context tree weighting (CTW).

The proposed algorithm has linear decoding complexity. The proposed PoC is intended to extend the current binary implementation to arbitrary alphabets, provide fast encoder/decoder implementation, develop specific applications to compress satellite observation data and genomic data, develop an indexed version of the compression algorithm in order to access some of the data without full decompression, and investigate specific software licensing options and opportunities.

Topics

Who is involved

OrganisationCityCountryRole
Universitat Politecnica De CatalunyaBarcelonaSpainCoordinator
Centre Tecnologic De Telecomunicacions De CatalunyaCastelldefels BarcelonaSpainParticipant

Source: CORDIS, European Commission. Data of 5 Nov 2026, reused under the Commission's reuse policy. View on CORDIS · Grant DOI