public static boolean t32( int word )
    {
        int sum = 0;
        for(int y = 0; y < 32; y++)
        {
            sum = 0;
            for(int x = 0; x < 32; x++)
            {
                sum += ( 1 - 2 * ( ( Integer.bitCount( x & y ) ^ (1 & (word >> (31 - x ) ) ) ) % 2 ) );
            }
            if( sum != 0 )
            {
                if( sum != 8 )
                {
                    if( sum != -8 )
                    {
                        return false;
                    }
                }
            }
        }
        return true;
    }