Changeset f32177 in git for Singular/LIB/brnoeth.lib

Timestamp:

Apr 7, 2009, 11:31:52 AM (15 years ago)

Author:

Frank Seelisch <seelisch@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

0ad81f2c92a459da3968f1add8868540fe570fb8

Parents:

1288efb1bc6f003f059484c99a625cf47c1ed08b

Message:

removed some docu errors prior to release 3-1-0


git-svn-id: file:///usr/local/Singular/svn/trunk@11635 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/brnoeth.lib (modified) (5 diffs)

Singular/LIB/brnoeth.lib

@@ -1 @@
-version="$Id: brnoeth.lib,v 1.20 2008-10-07 17:36:30 Singular Exp $";
+version="$Id: brnoeth.lib,v 1.21 2009-04-07 09:30:44 seelisch Exp $";
 category="Coding theory";
 info="
@@ -8 +8 @@
 OVERVIEW:
  Implementation of the Brill-Noether algorithm for solving the
- Riemann-Roch problem and applications in Algebraic Geometry codes.
+ Riemann-Roch problem and applications to Algebraic Geometry codes.
  The computation of Weierstrass semigroups is also implemented.@*
  The procedures are intended only for plane (singular) curves defined over
@@ -15 +15 @@
 
 MAIN PROCEDURES:
- Adj_div(f);            computes the conductor of a curve
- NSplaces(h,A);         computes non-singular places with given degrees
- BrillNoether(D,C);     computes a vector space basis of the linear system L(D)
- Weierstrass(P,m,C);    computes the Weierstrass semigroup of C at P up to m
- extcurve(d,C);         extends the curve C to an extension of degree d
- AGcode_L(G,D,E);       computes the evaluation AG code with divisors G and D
- AGcode_Omega(G,D,E);   computes the residual AG code with divisors G and D
- prepSV(G,D,F,E);       preprocessing for the basic decoding algorithm
- decodeSV(y,K);         decoding of a word with the basic decoding algorithm
+ Adj_div(f)            computes the conductor of a curve
+ NSplaces(h,A)         computes non-singular places with given degrees
+ BrillNoether(D,C)     computes a vector space basis of the linear system L(D)
+ Weierstrass(P,m,C)    computes the Weierstrass semigroup of C at P up to m
+ extcurve(d,C)         extends the curve C to an extension of degree d
+ AGcode_L(G,D,E)       computes the evaluation AG code with divisors G and D
+ AGcode_Omega(G,D,E)   computes the residual AG code with divisors G and D
+ prepSV(G,D,F,E)       preprocessing for the basic decoding algorithm
+ decodeSV(y,K)         decoding of a word with the basic decoding algorithm
 
 AUXILIARY PROCEDURES:
- closed_points(I);      computes the zero-set of a zero-dim. ideal in 2 vars
- dual_code(C);          computes the dual code
- sys_code(C);           computes an equivalent systematic code
- permute_L(L,P);        applies a permutation to a list
+ closed_points(I)      computes the zero-set of a zero-dim. ideal in 2 vars
+ dual_code(C)          computes the dual code
+ sys_code(C)           computes an equivalent systematic code
+ permute_L(L,P)        applies a permutation to a list
 
 KEYWORDS:  Weierstrass semigroup; Algebraic Geometry codes;
@@ -3345 +3345 @@
           which represent the numerator, resp. denominator, of a rational
           function).@*
-          The corresponding rational functions form a vector basis of the
+          The corresponding rational functions form a vector space basis of the
           linear system L(G), G a rational divisor over a non-singular curve.
 NOTE:     The procedure must be called from the ring CURVE[1][2], where
@@ -3943 +3943 @@
           The intvec G represents a rational divisor (see @ref{BrillNoether}
           for more details).@*
-          The code evaluates the vector basis of L(G) at the rational
+          The code evaluates the vector space basis of L(G) at the rational
           places given by D.
 WARNINGS: G should satisfy @math{ 2*genus-2 < deg(G) < size(D) }, which is