#12418: adding Delsarte bound for codes
----------------------------------+-----------------------------------------
Reporter: dimpase | Owner: wdj
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.5
Component: coding theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: #12533, #13650 | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by ppurka):
Replying to [comment:18 dimpase]:
> I
[https://bitbucket.org/dimpase/qcode/src/9e3b79dc71992aa2a8ea170dbd13f9f373772411/aw.sage?at=default
use] the descriptions in the book "Algebraic Combinatorics I" by E.Bannai
and T.Ito.
> Something known as [http://mathworld.wolfram.com/EberleinPolynomial.html
Eberlein polynomials].
That's for the binary case. For the q-ary case it is a product of
Krawtchouk and Hahn, if I recall properly. Let me fish out the paper; I
will send it to you.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12418#comment:19>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
