2 citations · 2 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
Faster construction of asymptotically good unit-cost error correcting codes in the RAM model
Djamal Belazzougui
Assuming we are in a Word-RAM model with word size , we show that we can construct in time an error correcting code with a constant relative positive distance that maps n…
cs.DS2014★ 2 cited
Rank, select and access in grammar-compressed strings
Djamal Belazzougui, Simon J. Puglisi, Yasuo Tabei
Given a string of length on a fixed alphabet of symbols, a grammar compressor produces a context-free grammar of size that generates and only . In this p…