New posts in Bit Manipulation

For given two integers A and B, find a pair of numbers X and Y such that A = X*Y and B = X xor Y

Count leading zero bits for each element in AVX2 vector, emulate _mm256_lzcnt_epi32

Weird output when summing 1<<2 and 1<<3 in C++

Why C compilers optimize switch and if differently

Efficiently randomly shuffling the bits of a sequence of words

Fast method to multiply integer by proper fraction without floats or overflow

Given a 32 bit number, what is an efficient way to scale each byte by a certain factor?

How do I write a maintainable, fast, compile-time bit-mask in C++?

How to implement arithmetic right shift in C

Bit mask in Bash