#16546: Enumeration of non-isomorphic network codes over GF(2), GF(3) and GF(4)
for
multi-source multi-sink network coding (MSNC) problem.
------------------------------+----------------------------
Reporter: Jayant | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: matroid theory | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
------------------------------+----------------------------
Given an instance of MSNC problem (a directed acyclic graph, a set of
source nodes, a set of sink nodes, each source node having some source
variables and each sink node wanting some source variables). Use single
element extension of matroids to enumerate the codes with additional
option to compute the rate region (set of all rate tuples) achievable over
given finite field.
--
Ticket URL: <http://trac.sagemath.org/ticket/16546>
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.
