Binary Cyclic Codes

Determine all binery cyclic codes of length 5. Note: To find all cyclic codes of length n, find all ideals in B[x]/x^2+1 Note: If 1 is an Ideal (I) then R = I. Example: n=2 R=B[x]/x^2+1, x^2=1 R={o,1,x,1+x} Ideals <0> = 0 <1> = R x = (0, x, x^2...) = (1,... = R <1+x> = (1+x, 0, x+x^2, 1+x^2) x+x^2 = x+1 1+x^2 = 1+1 = 0 so, <1+x> = (1+x, 0) Therefore: Ideal Code Words <0> 00 <1> 00 01 10 11 x = <1> <1+x> ... click for more

Binary addition

101010100 101010111 000000011 I am confused as to how to add up 3 binary numbers with the wrap around and the ones compliment.

I need help with binary subtraction and division

example problem: 1001/10101010 I am expecially having problems subracting with there is a borrow involved.

Output for values

4. Consider the following program in Pascal with static scope: program main (input, output); var i, j, k, m: integer; procedure Q (var i: integer; m: integer); begin i := j + 1; m := k + 1; writeln (i, j, k, m); end procedure P(var i: integer; j: integer); var k: integer; procedure S(i: integer) begin i := k + 3; m := i + 3; writeln(i, j, k, m); end begin k := 8; i := i + k; j := j + k; Q(i, j); writeln(i, j, k, m); S(m); writeln(i, j, k, m); end begin i := 5; j := 2; k := 7; m := 9; writeln(i, j, k, m); P(i, k); writeln(i, j, k, m); Q(j, m); writeln(i, j, k, m); end Please fill in the following table with the values of i, j, k, and m for each writeln st... click for more

Programming Languages

Find the sequence of CARs and CDRs that return X when applied to he following S-expressions. (1) ( (A B ) C X C D ) (2) (A (B (C D X D) ) ) (3) ( ( ( (A (B C (X)) D ) ) ) )