We present a geometric approach towards derandomizing the Isolation lemma for a given family, i.e., deterministically constructing a weight assingnment which ensures a unique minimum weight set in the family.

Compression of a message up to the information it carries is key to many tasks involved in classical and quantum information theory.