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

Subindex: CoboundaryMapImage  ..  Code


CoboundaryMapImage

   CoboundaryMapImage(M, i, c) : ModCoho, RngIntElt, UserProgram -> UserProgram

Cocycle

   CocycleMap(alpha) : OneCoC -> Map
   CorestrictionMapImage(G, C, c, i) : Grp, ModCoho, UserProgram, RngIntElt -> UserProgram
   ExtendGaloisCocycle(c) : OneCoC -> OneCoC
   ExtendedOneCocycle(alpha) : OneCoC -> SetEnum[OneCoC]
   IdentifyOneCocycle(CM, s) : ModCoho, UserProgram -> ModTupRngElt
   IdentifyTwoCocycle(CM, s) : ModCoho, UserProgram -> ModTupRngElt
   IdentifyZeroCocycle(CM, s) : ModCoho, UserProgram -> ModTupRngElt
   InducedOneCocycle(AmodB, alpha) : GGrp, OneCoC -> OneCoC
   InflationMapImage(M, c) : Map, UserProgram -> UserProgram
   IsOneCocycle(A, imgs) : GGrp, SeqEnum[GrpElt] -> BoolElt, OneCoC
   OneCocycle(A, imgs) : GGrp, SeqEnum[GrpElt] -> OneCoC
   OneCocycle(CM, s) : ModCoho, SeqEnum -> UserProgram
   TrivialOneCocycle(A) : GGrp -> OneCoC
   TwoCocycle(A) : FldAb -> UserProgram
   TwoCocycle(CM, s) : ModCoho, SeqEnum -> UserProgram
   ZeroCocycle(CM, s) : ModCoho, SeqEnum -> UserProgram

CocycleMap

   CocycleMap(alpha) : OneCoC -> Map

Cocycles

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

cocycles

   Cocycles (COHOMOLOGY AND EXTENSIONS)
   Group Cohomology (COHOMOLOGY AND EXTENSIONS)
   One Cocycles (COHOMOLOGY AND EXTENSIONS)
   GrpCoh_cocycles (Example H68E4)

Code

   AdditiveCode(K, C) : FldFin, Code -> CodeAdd
   AdditiveCode<F, K, n | L> : FldFin, RngIntElt, List -> Code
   AdditiveCode(G) : ModMatRngElt -> CodeAdd
   AdditiveCyclicCode(v) : ModTupFldElt -> CodeAdd
   AdditiveCyclicCode(v4, v2) : ModTupFldElt, ModTupFldElt -> CodeAdd
   AdditiveCyclicCode(n, f) : RngIntElt, RngUPolElt -> CodeAdd
   AdditiveCyclicCode(n, f4, f2) : RngIntElt, RngUPolElt, RngUPolElt -> CodeAdd
   AdditiveQuasiCyclicCode(n, Q) : RngIntElt, SeqEnum[RngUPolElt] -> CodeAdd
   AdditiveQuasiCyclicCode(n, Q, h) : RngIntElt, SeqEnum[RngUPolElt], RngIntElt -> CodeAdd
   AdditiveQuasiCyclicCode(Q) : SeqEnum[ModTupFldElt] -> CodeAdd
   AdditiveQuasiCyclicCode(Q, h) : SeqEnum[ModTupFldElt], RngIntElt -> CodeAdd
   AdditiveRepetitionCode(F, K, n) : FldFin, FldFin, RngIntElt -> Code
   AdditiveUniverseCode(F, K, n) : FldFin,FldFin, RngIntElt -> Code
   AdditiveZeroCode(F, K, n) : FldFin, FldFin, RngIntElt -> CodeAdd
   AdditiveZeroSumCode(F, K, n) : FldFin, FldFin, RngIntElt -> Code
   AlgebraicGeometricCode(S, D) : [PlcCrvElt], DivCrvElt -> Code
   AlgebraicGeometricDualCode(S, D) : [PlcCrvElt], DivCrvElt -> Code
   AlternantCode(A, Y, r, S) : [ FldFinElt ], [ FldFinElt ], RngIntElt, FldFin -> Code
   AugmentCode(C) : Code -> Code
   AugmentCode(C) : CodeAdd -> 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
   CSSCode(C1, C2) : Code, Code -> CodeQuantum
   ChienChoyCode(P, G, n, S) : RngUPolElt, RngUPolElt, RngIntElt, FldFin -> Code
   CodeComplement(C, C1) : Code, Code -> Code
   CodeComplement(C, S) : Code, Code -> Code
   CodeToString(n) : RngIntElt -> MonStgElt
   ConcatenatedCode(O, I) : Code, Code -> Code
   ConstaCyclicCode(n, f, 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
   DirectProduct(C, D) : Code, Code -> 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
   ExtendCode(C, n) : Code, RngIntElt -> Code
   ExtendCode(C) : CodeAdd -> CodeAdd
   ExtendCode(Q) : CodeQuantum -> CodeQuantum
   ExtendCode(Q, m) : CodeQuantum, RngIntElt -> CodeQuantum
   ExtendedPerfectCodeZ4(δ, m) : RngIntElt, RngIntElt -> CodeLinRng, Mtrx
   FireCode(h, s, n) : RngUPolElt, RngIntElt, RngIntElt -> Code
   GabidulinCode(A, W, Z, t) : [ FldFinElt ], [ FldFinElt ], [ FldFinElt ], RngIntElt -> Code
   GallagerCode(n, a, b) : RngIntElt, RngIntElt, 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, ext) : FldFin, BoolElt -> Code
   GolayCodeZ4(e) : BoolElt -> Code
   GoppaCode(L, G) : [ FldFinElt ], RngUPolElt -> Code
   HadamardCodeZ4(δ, m) : RngIntElt, RngIntElt -> CodeLinRng, Mtrx
   HammingCode(K, r) : FldFin, RngIntElt -> Code
   HermitianCode(q, r) : RngIntElt, RngIntElt -> Code
   JustesenCode(N, K) : Code, FldFinElt, RngIntElt -> Code
   KerdockCode(m): RngIntElt, RngUPolElt -> Code
   KernelZ2CodeZ4(C) : CodeLinRng -> CodeLinRng
   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
   MargulisCode(p) : RngIntElt -> Code
   NonPrimitiveAlternantCode(n, m, r) : RngIntElt,RngIntElt,RngIntElt->Code
   NormalizerCode(Q) : CodeQuantum -> CodeAdd
   PadCode(C, n) : Code, RngIntElt -> Code
   PadCode(C, n) : Code, RngIntElt -> Code
   PadCode(C, n) : CodeAdd, RngIntElt -> CodeAdd
   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
   PunctureCode(C, i) : CodeAdd, RngIntElt -> Code
   PunctureCode(C, S) : CodeAdd, { RngIntElt } -> Code
   PunctureCode(Q, i) : CodeQuantum, RngIntElt -> CodeQuantum
   PunctureCode(Q, I) : CodeQuantum, SetEnum -> CodeQuantum
   QECC(F, n, k) : FldFin, RngIntElt, RngIntElt -> CodeQuantum, BoolElt
   QuantumCode(S) : Code -> CodeQuantum
   QuantumCode(G) : Grph -> QuantumCode
   QuantumCode(M) : ModMatRngElt -> CodeQuantum
   QuantumCyclicCode(v) : ModTupFldElt -> CodeAdd
   QuantumCyclicCode(v4, v2) : ModTupFldElt, ModTupFldElt -> CodeAdd
   QuantumCyclicCode(n, f) : RngIntElt, RngUPolElt -> CodeAdd
   QuantumQuasiCyclicCode(n, Q) : RngIntElt, SeqEnum[RngUPolElt] -> CodeAdd
   QuantumQuasiCyclicCode(Q) : SeqEnum[ModTupFldElt] -> CodeAdd
   QuasiCyclicCode(n, Gen) : RngIntElt, [ RngUPolElt ] -> Code
   QuasiCyclicCode(n, Gen, h) : RngIntElt, [ RngUPolElt ], RngIntElt -> Code
   QuasiCyclicCode(Gen) : [ ModTupRngElt ] -> Code
   QuasiCyclicCode(Gen, h) : [ModTupRngElt] , RngIntElt -> Code
   QuasiTwistedCyclicCode(n, Gen, alpha) : RngIntElt, [RngUPolElt], FldFinElt -> Code
   QuasiTwistedCyclicCode(Gen, alpha) : [ModTupRngElt], FldFinElt -> Code
   RandomAdditiveCode(F, K, n, k) : FldFin,FldFin, RngIntElt, RngIntElt -> Code
   RandomLinearCode(K, n, k) : FldFin, RngIntElt, RngIntElt -> Code
   RandomLinearCode(R, n, k) : Rng, RngIntElt, RngIntElt -> Code
   RandomQuantumCode(F, n, k) : FldFin, RngIntElt, RngIntElt -> CodeQuantum
   ReedMullerCode(r, m) : RngIntElt, RngIntElt -> Code
   ReedMullerCodeRMZ4(s, r, m) : RngIntElt, RngIntElt, RngIntElt -> CodeLinRng, Mtrx
   ReedMullerCodeZ4(r, m) : RngIntElt, RngIntElt -> Code
   ReedMullerCodeZ4(r, m) : RngIntElt, RngIntElt -> CodeLinRng
   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, i) : Code, RngIntElt -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(Q, i) : CodeQuantum, RngIntElt -> CodeQuantum
   ShortenCode(Q, I) : CodeQuantum, SetEnum -> CodeQuantum
   SimplexAlphaCodeZ4(k) : RngIntElt -> Code
   SimplexBetaCodeZ4(k) : RngIntElt -> Code
   SimplexCode(r) : RngIntElt -> Code
   SpanZ2CodeZ4(C) : CodeLinRng -> CodeLinFld
   SrivastavaCode(A, W, mu, S) : [ FldFinElt ], [ FldFinElt ], RngIntElt, FldFin -> Code
   StabilizerCode(Q) : CodeQuantum -> CodeAdd
   StringToCode(s) : MonStgElt -> RngIntElt
   SubcodeBetweenCode(C1, C2, k) : Code, Code, RngIntElt -> Code
   SubcodeBetweenCode(C1, C2, k) : CodeAdd, CodeAdd, RngIntElt -> CodeAdd
   SubfieldCode(C, S) : Code, FldFin -> Code
   SubfieldRepresentationCode(C, K) : Code, FldFin -> Code
   SubfieldRepresentationParityCode(C, K) : Code, FldFin -> Code
   ToricCode(S, q) : SeqEnum[TorLatElt], RngIntElt -> Code
   ToricCode(P, q) : TorPol, RngIntElt -> 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 H30E2)

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

Version: V2.19 of Mon Dec 17 14:40:36 EST 2012