#20526: A benchmarking tool for linear codes
-------------------------------------+-------------------------------------
       Reporter:  dlucas             |        Owner:
           Type:  enhancement        |       Status:  new
       Priority:  major              |    Milestone:  sage-7.2
      Component:  coding theory      |   Resolution:
       Keywords:                     |    Merged in:
        Authors:                     |    Reviewers:
Report Upstream:  N/A                |  Work issues:
         Branch:                     |       Commit:
  u/dlucas/benchmarking_tool         |  0ab93ecbf861c585b83bb162493afcaf5a2032c8
   Dependencies:                     |     Stopgaps:
-------------------------------------+-------------------------------------

Comment (by jsrn):

 Sounds good! Quick remark (didn't check the code yet): In "A Course In
 Error-Correcting Codes" by Justesen and Høholdt then "decoding error" is
 defined as the decoder returning a codeword which was not the intended,
 and "decoding failure" is defined as the decoder not returning the wanted
 codeword (i.e. either returning nothing or returning a wrong one).

 That is, `P(failure) >= P(error) and P(failure) - P(error) = P(not
 returning anything)`.

 Perhaps this implementation should reflect this (non-universally adopted)
 convention.

--
Ticket URL: <http://trac.sagemath.org/ticket/20526#comment:8>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.

Reply via email to