Run-length Encoding
Run-Length Encoding is a lossless data compression algorithm that encodes sequences of identical symbols by replacing each run of repeated symbols with a single instance paired with its occurrence count.
333
Publications
16.8K
Citations
804
Authors
355
Institutions
Publications per year
2017–2026
58
333
Data Compression: The Complete Reference
Kybernetes · 2009 · 1.6K citations
Solomon W. Golomb · IEEE Transactions on Information Theory · 1966 · 679 citations
An analysis of the Burrows—Wheeler transform
Giovanni Manzini · Journal of the ACM · 2001 · 372 citations
1–5 of 333
804
Singapore University of Technology and Design, Singapore
8 publications · 286 citations
8
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 804
355
IBM (United States)
Armonk, United States
8 h-index
10 publications
524 citations
Philips (Netherlands)
Amsterdam, The Netherlands
7 h-index
9 publications
379 citations
Feng Chia University
Taichung, Taiwan
6 h-index
12 publications
430 citations
University of Haifa
Haifa, Israel
5 h-index
9 publications
497 citations
State University of New York
Albany, United States
5 h-index
6 publications
540 citations
Purdue University West Lafayette
West Lafayette, United States
5 h-index
7 publications
199 citations
University of California San Diego
San Diego, United States
5 h-index
9 publications
435 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
5 publications
208 citations
1–8 of 355
18 publications · 1.5K citations
15
h-index
12 publications · 277 citations
10
h-index
8 publications · 240 citations
8
h-index
6 publications · 92 citations
6
h-index
5 publications · 323 citations
5
h-index
1–5