In "a survey of algebraic coding theory", Berlekamp mentions Binary Quadratic Residue Codes. He then goes on to prove that they are invariant under the same action as we talked about for modular forms. Are they exemples of modular function?
I am a little confused by the lattices. Why can one of the two generating vectors always chosen to be 1? Why are w_2 in other parts of the fundamental domain not ambiguous?
That way of describing the fundamental domain is just amazing! I always saw it described in terms of the action of SL_2(Z) and this is way simpler!
Although technically these ways are equivalent, for me this is indeed easier to catch up!
I have to say, these lectures are everything I’d hoped for! Thanks so much!
Damn i Love modular forms!
I am really greatfull for These awesome lectures!
this in incredibly technical, and beyond 99.999% of the population.
Wow! More content this is magical
In "a survey of algebraic coding theory", Berlekamp mentions Binary Quadratic Residue Codes. He then goes on to prove that they are invariant under the same action as we talked about for modular forms. Are they exemples of modular function?
I am a little confused by the lattices. Why can one of the two generating vectors always chosen to be 1? Why are w_2 in other parts of the fundamental domain not ambiguous?
The best
Could you consider suggesting some exercises in the future?
As usual if you cannot solve simple exercises you have not understood 😊
yeeeeeeeeeeeeee