Pseudo-boolean instances relative to our pseudo-boolean constraint model that compute the shortest synchronization codes, i.e. those that add the fewest synchronization bits to the original data.
Copyright (c) 2012, Dany Vohl, Claude-Guy Quimper, Danny Dubé. All rights reserved.
If you use it and find this work useful, please cite the following paper and refer to the license also joint in this repository.
Vohl, D., Quimper, C.-G., Dubé, D. 2012. “Finding Synchronization Codes to Boost Compression by Substring Enumeration”. In Proceedings of the Eleventh International Workshop on Constraint Modelling and Reformulation (ModRef 2012), held at the 18th International Conference on the Principles and Practice of Constraint Programming (CP 12). Read it!