In this paper we use the Gröbner representation of a binary linear code to give efficient algorithms for computing the whole set of coset leaders, denoted by and the set of leader codewords, denoted ...