Learning based hashing techniques have attracted broad research interests in the Big Media research area. They aim to

learn compact binary codes which can preserve semantic similarity in the Hamming embedding. However, the discrete constraints

imposed on binary codes typically make hashing optimizations very challenging. In this paper, we present a code consistent hashing

(CCH) algorithm to learn discrete binary hash codes. To form a simple yet efficient hashing objective function, we introduce a new code

consistency constraint to leverage discriminative information and propose to utilize the Hadamard code which favors an informationtheoretic

criterion as the class prototype. By keeping the discrete constraint and introducing an orthogonal constraint, our objective

function can be minimized efficiently. Experimental results on three benchmark datasets demonstrate that the proposed CCH

outperforms state-of-the-art hashing methods in both image retrieval and classification tasks, especially with short binary codes.