binary - Is it an overflow or not? - Mathematics Stack Exchange 1 1101 + 0100 = 0001 is an overflow if it is a wrong answer and not an overflow if it is a correct answer If these are unsigned binary numbers then 13+4=1 is wrong, so there is an overflow In fact, with unsigned binary, a carry out is always an overflow But you have specified 2s-complement binary
Finding two s complement of a fractional binary number You should add 1 to the least significant bit (LSB) and not to the left of decimal (11010010 0011) + (0 0001) = (11010010 0100) The reason this works is because you can first convert the number to an integer by multiplying it with 2^4=16 (equivalent to shifting the radix point 4 places to the right) Then you can take two's complement of the resulting integer followed by dividing the number
coding theory - Equivalence of Codes - Mathematics Stack Exchange 2 Consider the binary codes below: C1= {0000, 1100, 1010, 0110} C2= {0111, 0100, 0010, 0001} C3= {1000, 0100, 0010, 0001} Show that C1 is not equivalent to C3 Is C2 equivalent to C3? When we say two codes are equivalent we mean one can be obtained from the other through repeatedly applying the following two operations to all the codewords:
coding theory - Mathematics Stack Exchange You'll need to complete a few actions and gain 15 reputation points before being able to upvote Upvoting indicates when questions and answers are useful What's reputation and how do I get it? Instead, you can save this post to reference later
Inverse of binary matrix - Mathematics Stack Exchange I have tried creating an inverse of a binary matrix using the identity matrix method Have an identity matrix alongside the square matrix and perform all the operations to convert the square matrix
truncation in twos complment - Mathematics Stack Exchange The four bit two's complement representation of $-4$ is $1100$, which you get by bit complementing $0100$ to get $1011$ then adding one to get $1100$ You are correct that in three bit two's complement notation $100$ is $-4$ decimal You will get proper truncation any time the high order bits are the same down to the first bit you keep, as is the case here
binary - Is this an overflow? - Mathematics Stack Exchange Since we have 2's complement and 8 bits, the leftmost bit is the sign bit This means 1001 0111 is NOT 151, but rather -105 To continue the math: 1001 0111 (-105) - 0011 1100 (60) ---->+ 1100 0100 (-60) Then as you did before, 10010111 (-105) + 11000100 (-60) = 1 0101 1011 Since we are working in 8bits,0101 1011 is 91 in decimal Note that overflow applies when we work with signed numbers and
How is a Generator Matrix for a (7, 4) Hamming code created? Your parity check equations seems to be x5 = x1 + x2 + x3 x6 = x2 + x3 + x4 x7 = x1 + x2 + x4 Normally, this parity check is given if you have to construct the generator matrix G G always starts with the identity matrix 1000 0100 0010 0001 and the last couple digits are found based on the parity check equation
String of 0 and 1s question - Mathematics Stack Exchange 1 There are sixteen different ways of writing four-digit strings using 1s and 0s Three of these strings are 1010, 0100 and 1001 These three can be found as substrings of 101001 There is a string of nineteen 1s and 0s which contains all sixteen strings of length 4 exactly once If this string starts with 1111, the last four digits are?