Find the radius of convergence of the following series.
i)
ii)
Find the maximum modulus of on the closed circular region defined by
.
Find all the singularities of the function .
Find the constant c such that can be extended to be analytic at
, when
is fixed.
If , then show that there exists a real R > 0 such that
for
.
b) Find all solutions to the equation .
Find the image of the circle under the mapping
. What happens when
?
Find the points where the function is not analytic.
Consider and the closed circular region
. Find points in R where |f(z)| has its maximum and minimum values.
If is entire such that
in
then show that f has the form
where
are constants with
.
Determine whether each of the following statement is true or false. Justify your answer with a short proof or a counter example.
i) If , where a and b are integers, then
if a > 0.
ii) If f(z) and are analytic functions in a domain, then f is necessarily a constant.
iii) A real-valued function u(x, y) is harmonic in D iff u(x, -y) is harmonic in D.
iv) .
v) The inequality holds for
.
vi) If has the property that
converges, then f is necessarily an entire function.
vii) If a power series converges for |z| < 1 and if
is such that |bn| < n2 |an| for all
, then
converges for |z| < 1.
viii) If f is entire and for all z, then there exists an entire function g such that
for all
.
ix) A mobius transformation which maps the upper half plane onto itself and fixing
and no other points, must be of the form
for some
and
.
x) If f is entire and is bounded as
, then f is constant.
Factor x8 - 1 over . Give the generator polynomials of all cyclic codes of length eight over
.
Factor x5 - 1 over . Give the generator polynomials of all cyclic codes of length five over
.
Let C be a cyclic code of length eight over with generator polynomial
. Find the generator matrix of C, the generator polynomial of C and the parity check matrix of C.
Let C be the [5, 2] binary code generated by
Find the weight enumerator C of C . Use McWilliams identity to find the weight enumerator of C. Verify your answer by finding the generator matrix of C and finding the weight distribution of C.
) Let C be the ternary [8,3] narrow-sense BCH code of designed distance , which has defining set
. Use the primitive root 8th root of unity you chose in 4a) to avoid recomputing the the table of powers. If
is the generator polynomial of C and
is the received word, find the transmitted codeword. Use the following table in 1.
he aim of this exercise is to show that every binary repetition code of odd length is perfect.
i) Find the value of t and d for a binary repetition code of length . \hfill (2)
ii) Show that
(Hint: Start with the relation
iii) Deduce that every repetition code of odd length is perfect.
Prepare a syndrome table for C in part a) and decode the vectors (1, 1, 1, 1, 0, 1) and (0, 1, 0, 1, 1, 1). \hfill (5)
See Answer →