Help with theorem proof
- From: "ASM" <asmarchio@xxxxxxxxxxx>
- Date: 11 Mar 2006 09:17:06 -0800
I would appreciate if anybody could provide a clear explanation to the
theorem 12.4 on page 183 of Oliver Pretzel's book "Error Correcting
Codes and Finite Fields", OUP 1992.
I am getting stuck on the critical passage:
....'Let ord(alpha) = n and ord(beta) = m. If m does not divide n,
there must be a prime r for which the highest power x=r^k dividing m is
greater than the highest power y=r^l dividing n.' ... etc
I can follow the proof of (another version of) this theorem on Blahut's
book (Algebraic Codes ...) without trouble, but I am stuck on this one.
Apologies to the professionals, I am just an amateur.
Thank you,
ASM
.
- Follow-Ups:
- Re: Help with theorem proof
- From: cbrown
- Re: Help with theorem proof
- Prev by Date: Re: Logarithm of transfinite numbers
- Next by Date: Re: ? statistic and deterministic average
- Previous by thread: SOME QUESTIONS TO MEDITATE ON!:
- Next by thread: Re: Help with theorem proof
- Index(es):
Relevant Pages
|