#18617: Implement polynomial number_of_terms method (and deprecate
hamming_weight)
-------------------------------------+-------------------------------------
Reporter: bruno | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.8
Component: commutative | Resolution:
algebra | Merged in:
Keywords: polynomial | Reviewers:
Authors: Bruno Grenet | Work issues:
Report Upstream: N/A | Commit:
Branch: | 60ee12ccb9e642959b02199d3cec81126fff64aa
u/bruno/hamming_weight_number_of_terms| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by bruno):
Replying to [comment:10 jdemeyer]:
> There is no fundamental reason to restrict to `GF(2)`. I think that
"weight" is simply ''used'' more rarely for other rings besides `GF(2)`.
I agree with that, my only point is to know whether people actually use
the different possible names.
With a search on Google for "polynomial weight", most results are about
polynomials over `GF(2)`, the few others concern more generally
polynomials over `GF(q)`. And furthermore, the thematic of the papers are
either irreducibility of polynomials or polynomials related to error-
correcting codes.
With a search for "polynomial sparsity", most papers are complexity theory
paper on learning polynomials.
All I say is that though "weight" may be standard in some domains, it is
not in other ones. That's why I prefer "number of terms" that I expect to
be clear for everyone.
--
Ticket URL: <http://trac.sagemath.org/ticket/18617#comment:12>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
