[____] [____] [_____] [____] [__] [Index] [Root]

Subindex: ClosestVectorsMatrix  ..  Code


ClosestVectorsMatrix

   ClosestVectorsMatrix(L, w) : Lat, ModTupRngElt -> ModMatRngElt, RngElt

CloseVectors

   CloseVectors(L, w, u) : Lat, ModTupRngElt, RngElt -> [ <LatElt, RngElt> ]

CloseVectorsMatrix

   CloseVectorsMatrix(L, w, u) : Lat, ModTupRngElt, RngElt -> ModMatRngElt

CloseVectorsProcess

   CloseVectorsProcess(L, w, u) : Lat, ModTupRngElt, RngElt -> LatEnumProc

Closure

   AlgebraicClosure() : -> FldAC
   ClosureGraph(P, G) : GrpPerm, GrphUnd -> GrphUnd
   IntegralClosure(R, F) : Rng, FldFun -> RngFunOrd
   MakeProjectiveClosureMap(A, P, S) : Aff,Prj,SeqEnum ->
   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat
   NormalClosure(G, H) : GrpAb, GrpAb -> GrpAb
   OrbitClosure(G, S) : GrpMat, { Elt } -> GSet
   OrbitClosure(G, Y, S) : GrpPerm, GSet, { Elt } -> GSet
   ProjectiveClosure(f) : MapSch -> MapSch
   ProjectiveClosure(A): Sch -> Sch
   ProjectiveClosure(C) : Sch -> Sch
   ProjectiveClosure(X) : Sch -> Sch
   ProjectiveClosureMap(A) : Aff -> MapSch
   VarietySizeOverAlgebraicClosure(I) : RngMPol -> RngIntElt
   H ^ G : GrpFin -> GrpFin
   H ^ G : GrpFin, GrpFin -> GrpFin
   H ^ G : GrpFP, GrpFP -> GrpFP
   H ^ G : GrpGPC, GrpGPC -> GrpGPC
   H ^ G : GrpMat -> GrpMat
   H ^ G : GrpMat, GrpMat -> GrpMat
   H ^ G : GrpPC, GrpPC -> GrpPC
   H ^ G : GrpPerm, GrpPerm -> GrpPerm

closure

   Affine Patches and Projective Closure (SCHEMES)
   Maps and Closure (SCHEMES)
   Projective Closure (PLANE ALGEBRAIC CURVES)
   Projective Closure (SCHEMES)
   Projective Closure and Affine Patches (PLANE ALGEBRAIC CURVES)

closure-crvpl

   Projective Closure and Affine Patches (PLANE ALGEBRAIC CURVES)

ClosureGraph

   ClosureGraph(P, G) : GrpPerm, GrphUnd -> GrphUnd

Cluster

   IsCluster(X) : Sch -> BoolElt,Clstr
   Scheme(p) : Pt -> Sch
   Scheme(X,f) : Sch,RngMPolElt -> Sch

cluster-degree5

   Scheme_cluster-degree5 (Example H87E9)

clusters

   Zero-dimensional Schemes (SCHEMES)

cmpeq

   x cmpeq y : Elt, Elt -> BoolElt

cmpne

   x cmpne y : Elt, Elt -> BoolElt

Co1

   GrpFP_1_Co1 (Example H26E55)

Cocycle

   IdentifyOneCocycle(CM, s) : ModCoho, ModTupRngElt -> UserProgram
   IdentifyTwoCocycle(CM, s) : ModCoho, UserProgram -> ModTupRngElt
   IdentifyZeroCocycle(CM, s) : ModCoho, SeqEnum -> ModTupRngElt
   OneCocycle(CM, s) : ModCoho, SeqEnum -> UserProgram
   TwoCocycle(CM, s) : ModCoho, SeqEnum -> ModTupRngElt
   ZeroCocycle(CM, s) : ModCoho, SeqEnum -> ModTupRngElt

cocycle

   Lifting a Quotient by Choosing an Individual Cocycle (FINITELY PRESENTED GROUPS: ADVANCED)

Cocycles

   RepresentativeCocycles(G, U, Ext, Hom) : GrpPC, GrpPC, [AlgMatElt], [AlgMatElt]-> [AlgMatElt]

cocycles

   Cocycles (COHOMOLOGY)

cocylces

   GrpCoh_cocylces (Example H23E4)

Code

   Combinatorial and Geometrical Structures (OVERVIEW)
   AlgebraicGeometricCode(S, D) : [PlcCrvElt], DivCrvElt -> Code
   AlternantCode(A, Y, r, S) : [ FldFinElt ], [ FldFinElt ], RngIntElt, FldFin -> Code
   AugmentCode(C) : Code -> Code
   BDLC(K, n, d) : FldFin, RngIntElt, RngIntElt -> Code, BoolElt
   BKLC(K, n, k) : FldFin, RngIntElt, RngIntElt -> Code, BoolElt
   BLLC(K, k, d) : FldFin, RngIntElt, RngIntElt -> Code, BoolElt
   BinaryResidueCode(C) : Code -> Code
   BinaryTorsionCode(C) : Code -> Code
   ChienChoyCode(P, G, n, S) : RngUPolElt, RngUPolElt, RngIntElt, FldFin -> Code
   CodeComplement(C, C1) : Code, Code -> Code
   CodeToString(n) : RngIntElt -> MonStgElt
   ConcatenatedCode(O, I) : Code, Code -> Code
   ConstaCyclicCode(f, n, alpha) : RngUPolElt, RngIntElt, FldFinElt -> Code
   CordaroWagnerCode(n) : RngIntElt -> Code
   CyclicCode(u) : ModTupRngElt -> Code
   CyclicCode(u) : ModTupRngElt -> Code
   CyclicCode(n, g) : RngIntElt, RngUPolElt -> Code
   CyclicCode(n, g) : RngIntElt, RngUPolElt -> Code
   CyclicCode(n, T, K) : RngIntElt, [ FldFinElt ], FldFin -> Code
   DelsarteGoethalsCode(m, delta) : RngIntElt, RngIntElt -> Code
   EvenWeightCode(n) : RngIntElt -> Code
   ExpurgateCode(C) : Code -> Code
   ExpurgateCode(C, L) : Code,[ModTupFldElt] -> Code
   ExpurgateWeightCode(C, w) : Code, RngIntElt -> Code
   ExtendCode(C) : Code -> Code
   ExtendCode(C) : Code -> Code
   ExtendCode(C, n) : Code, RngIntElt -> Code
   ExtendCode(C, n) : Code, RngIntElt -> Code
   FireCode(h, s, n) : RngUPolElt, RngIntElt, RngIntElt -> Code
   GabidulinCode(A, W, Z, t) : [ FldFinElt ], [ FldFinElt ], [ FldFinElt ], RngIntElt -> Code
   GeneralizedSrivastavaCode(A, W, Z, t, S) : [ FldFinElt ], [ FldFinElt ], [ FldFinElt ], RngIntElt, FldFin -> Code
   GoethalsCode(m) : RngIntElt -> Code
   GoethalsDelsarteCode(m, delta) : RngIntElt, RngIntElt -> Code
   GolayCode(K, extend) : FldFin, BoolElt -> Code
   GolayCodeZ4(e) : BoolElt -> Code
   GoppaCode(L, G) : [ FldFinElt ], RngUPolElt -> Code
   HammingCode(K, r) : FldFin, RngIntElt -> Code
   HermitianCode(q, r) : RngIntElt, RngIntElt -> Code
   JustesenCode(N, K) : Code, FldFinElt, RngIntElt -> Code
   KerdockCode(m): RngIntElt, RngUPolElt -> Code
   LengthenCode(C) : Code -> Code
   LinearCode(C, S) : Code, FldFin -> Code, Map
   LinearCode<R, n | L> : FldFin, RngIntElt, List -> Code
   LinearCode(D, K) : Inc, FldFin -> Code
   LinearCode(A) : ModMatRngElt -> Code
   LinearCode(A) : ModMatRngElt -> Code
   LinearCode(U) : ModTupRng -> Code
   LinearCode(U) : ModTupRng -> Code
   LinearCode(P, K) : Plane, FldFin -> Code
   LinearCode<R, n | L> : Rng, RngIntElt, List -> Code
   NonPrimitiveAlternantCode(n, m, r) : RngIntElt,RngIntElt,RngIntElt->Code
   PadCode(C, n) : Code, RngIntElt -> Code
   PadCode(C, n) : Code, RngIntElt -> Code
   PermutationCode(u, G) : ModTupRngElt, GrpPerm -> Code
   PermutationCode(u, G) : ModTupRngElt, GrpPerm -> Code
   PowerResidueCode(K, n, p) : FldFin, RngIntElt, RngIntElt -> Code
   PreparataCode(m): RngIntElt, RngUPolElt -> Code
   PunctureCode(C, i) : Code, RngIntElt -> Code
   PunctureCode(C, i) : Code, RngIntElt -> Code
   PunctureCode(C, S) : Code, { RngIntElt } -> Code
   PunctureCode(C, S) : Code, { RngIntElt } -> Code
   QuasiCyclicCode(n, Gen, h) : RngIntElt, SeqEnum, RngIntElt -> Code
   QuasiCyclicCode(Gen) : RngIntElt, [ ModTupRngElt ] -> Code
   QuasiCyclicCode(n, Gen) : RngIntElt, [ RngUPolElt ] -> Code
   QuasiCyclicCode(Gen, h) : [ModTupRngElt] , RngIntElt -> Code
   QuasiTwistedCyclicCode(n, Gen, alpha) : RngIntElt, [RngUPolElt], FldFinElt -> Code
   QuasiTwistedCyclicCode(Gen, alpha) : [ModTupRngElt], FldFinElt -> Code
   RandomLinearCode(K, n, k) : FldFin, RngIntElt, RngIntElt -> Code
   RandomLinearCode(R, n, k) : Rng, RngIntElt, RngIntElt -> Code
   ReedMullerCode(r, m) : RngIntElt, RngIntElt -> Code
   ReedMullerCodeZ4(r, m) : RngIntElt, RngIntElt -> Code
   ReedSolomonCode(K, d, b) : FldFin, RngIntElt, RngIntElt -> Code
   ReedSolomonCode(n, d) : RngIntElt, RngIntElt -> Code
   RepetitionCode(R, n) : FldFin, RngIntElt -> Code
   RepetitionCode(R, n) : Rng, RngIntElt -> Code
   ShortenCode(C, i) : Code, RngIntElt -> Code
   ShortenCode(C, i) : Code, RngIntElt -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   SimplexAlphaCodeZ4(k) : RngIntElt -> Code
   SimplexBetaCodeZ4(k) : RngIntElt -> Code
   SimplexCode(r) : RngIntElt -> Code
   SrivastavaCode(A, W, mu, S) : [ FldFinElt ], [ FldFinElt ], RngIntElt, FldFin -> Code
   StringToCode(s) : MonStgElt -> RngIntElt
   SubcodeBetweenCode(C1, C2, k) : Code, Code, RngIntElt -> Code
   SubfieldCode(C, S) : Code, FldFin -> Code
   SubfieldRepresentationCode(C, S) : Code, FldFin -> Code
   SubfieldRepresentationParityCode(C, K) : Code, FldFin -> Code
   UniverseCode(R, n) : FldFin, RngIntElt -> Code
   UniverseCode(R, n) : Rng, RngIntElt -> Code
   Z4CodeFromBinaryChain(C1, C2) : Code, Code -> Code
   ZeroCode(R, n) : FldFin, RngIntElt -> Code
   ZeroCode(R, n) : Rng, RngIntElt -> Code
   ZeroSumCode(R, n) : FldFin, RngIntElt -> Code
   ZeroSumCode(R, n) : Rng, RngIntElt -> Code
   ZinovievCode(I, O) : [Code], [Code] -> Code
   Lat_Code (Example H46E2)


[____] [____] [_____] [____] [__] [Index] [Root]