In computer science, a succinct data structure is a data structure which uses an amount of space that is “close” to the information-theoretic lower bound, but (unlike other compressed representations) still allows for efficient query operations.
Bibliography
“Succinct Data Structure.” 2021. Wikipedia, February. https://en.wikipedia.org/w/index.php?title=Succinct_data_structure&oldid=1007270369.