Click here to Skip to main content
15,899,754 members
Articles / General Programming / Performance

Using a Variation on RLE to Achieve Lossless Compression for Near-consecutive or Grouped Tabular Data

Rate me:
Please Sign up or sign in to vote.
5.00/5 (3 votes)
9 Jun 2023CPOL3 min read 7.6K   2  
Introducing a lossless compression mechanism for data structured in a table or matrix
In scenarios where there is a requirement for storing masses of loosely consecutive or grouped data, a variation of run-length-encoding that repeats content until overridden can be implemented to achieve a form of lossless compression.

Views

Daily Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Student
United Kingdom United Kingdom
I like programming and maths

Comments and Discussions