counting operations in the coefficient field

Hello all,

I have implemented a decoding algorithm for a class of algebraic
codes as arxiv.org/abs/1201.6248.
I used a finite field as the coefficient field of the basering,
and I want to count the numbers of additions, subtractions,
multiplications, and divisions in the finite field.

Is there any convenient way to count those operations in
a finite coefficient field during execution of a Singular script?
Or do I have to modify the source code (maybe kernel/ffields.cc)
of Singular to count them?

Thanks in advance,
Ryutaroh

You need to modifiy the sources: kernel/modulop.* for
computations in Z/p, kernel/ffields.* for computations in
GF(p^n)

Thank you very much for the information.

I will modify my own Singular script so that it can count the
number of operations in the coefficient field. This should be
easier for me.

Ryutaroh