\begin{theindex} \item $A(n,d)$, \hyperpage{129} \item $GF(p)$, \hyperpage{17} \item $GF(q)$, \hyperpage{17} \item $t(n,k)$, \hyperpage{53} \item \texttt {*}, \hyperpage{31} \item \texttt {+}, \hyperpage{23}, \hyperpage{31} \item \texttt {-}, \hyperpage{23} \item \texttt {=}, \hyperpage{22}, \hyperpage{30} \item {\textless} {\textgreater}, \hyperpage{22}, \hyperpage{30} \indexspace \item acceptable coordinate, \hyperpage{147, 148} \item \texttt {AClosestVectorComb..MatFFEVecFFECoords}, \hyperpage{15} \item \texttt {AClosestVectorCombinationsMatFFEVecFFE}, \hyperpage{14} \item \texttt {ActionMoebiusTransformationOnDivisorP1 }, \hyperpage{100} \item \texttt {ActionMoebiusTransformationOnFunction }, \hyperpage{100} \item \texttt {AddedElementsCode}, \hyperpage{112} \item affine code, \hyperpage{37} \item \texttt {AffineCurve}, \hyperpage{92} \item \texttt {AffinePointsOnCurve}, \hyperpage{93} \item \texttt {AlternantCode}, \hyperpage{70} \item \texttt {AmalgamatedDirectSumCode}, \hyperpage{121} \item \texttt {AreMOLS}, \hyperpage{146} \item \texttt {AsSSortedList}, \hyperpage{41} \item \texttt {AugmentedCode}, \hyperpage{111} \item \texttt {AutomorphismGroup}, \hyperpage{39} \indexspace \item \texttt {BCHCode}, \hyperpage{81} \item \texttt {BestKnownLinearCode}, \hyperpage{74} \item \texttt {BinaryGolayCode}, \hyperpage{77} \item \texttt {BitFlipDecoder}, \hyperpage{59} \item \texttt {BlockwiseDirectSumCode}, \hyperpage{122} \item Bose distance, \hyperpage{81} \item bound, Gilbert-Varshamov lower, \hyperpage{130} \item bound, sphere packing lower, \hyperpage{130} \item bounds, Elias, \hyperpage{128} \item bounds, Griesmer, \hyperpage{128} \item bounds, Hamming, \hyperpage{127} \item bounds, Johnson, \hyperpage{127} \item bounds, Plotkin, \hyperpage{128} \item bounds, Singleton, \hyperpage{126} \item bounds, sphere packing bound, \hyperpage{127} \item \texttt {BoundsCoveringRadius}, \hyperpage{132} \item \texttt {BoundsMinimumDistance}, \hyperpage{131} \item \texttt {BZCode}, \hyperpage{124} \item \texttt {BZCodeNC}, \hyperpage{125} \indexspace \item check polynomial, \hyperpage{29}, \hyperpage{79} \item \texttt {CheckMat}, \hyperpage{44} \item \texttt {CheckMatCode}, \hyperpage{69} \item \texttt {CheckMatCodeMutable}, \hyperpage{69} \item \texttt {CheckPol}, \hyperpage{45} \item \texttt {CheckPolCode}, \hyperpage{80} \item \texttt {CirculantMatrix}, \hyperpage{154} \item code, \hyperpage{28} \item code, $(n,M,d)$, \hyperpage{28} \item code, $[n, k, d]r$, \hyperpage{29} \item code, AG, \hyperpage{92} \item code, alternant, \hyperpage{70} \item code, Bose-Chaudhuri-Hockenghem, \hyperpage{81} \item code, conference, \hyperpage{65} \item code, Cordaro-Wagner, \hyperpage{72} \item code, cyclic, \hyperpage{29} \item code, Davydov, \hyperpage{76} \item code, doubly-even, \hyperpage{36} \item code, element test, \hyperpage{32} \item code, elements of, \hyperpage{28} \item code, evaluation, \hyperpage{89} \item code, even, \hyperpage{36} \item code, Fire, \hyperpage{84} \item code, Gabidulin, \hyperpage{76} \item code, Golay (binary), \hyperpage{77} \item code, Golay (ternary), \hyperpage{78} \item code, Goppa (classical), \hyperpage{70} \item code, greedy, \hyperpage{67} \item code, Hadamard, \hyperpage{65} \item code, Hamming, \hyperpage{69} \item code, linear, \hyperpage{28} \item code, maximum distance separable, \hyperpage{35} \item code, Nordstrom-Robinson, \hyperpage{67} \item code, perfect, \hyperpage{34} \item code, Reed-Muller, \hyperpage{70} \item code, Reed-Solomon, \hyperpage{81} \item code, self-dual, \hyperpage{35} \item code, self-orthogonal, \hyperpage{35} \item code, singly-even, \hyperpage{36} \item code, Srivastava, \hyperpage{71} \item code, subcode, \hyperpage{33} \item code, Tombak, \hyperpage{76} \item code, toric, \hyperpage{91} \item code, unrestricted, \hyperpage{28} \item \texttt {CodeDensity}, \hyperpage{149} \item \texttt {CodeDistanceEnumerator}, \hyperpage{149} \item \texttt {CodeIsomorphism}, \hyperpage{38} \item \texttt {CodeMacWilliamsTransform}, \hyperpage{149} \item \texttt {CodeNorm}, \hyperpage{147} \item codes, addition, \hyperpage{31} \item codes, decoding, \hyperpage{32} \item codes, direct sum, \hyperpage{31} \item codes, encoding, \hyperpage{31} \item codes, product, \hyperpage{31} \item \texttt {CodeWeightEnumerator}, \hyperpage{148} \item \texttt {Codeword}, \hyperpage{20} \item \texttt {CodewordNr}, \hyperpage{21} \item codewords, addition, \hyperpage{23} \item codewords, cosets, \hyperpage{23} \item codewords, subtraction, \hyperpage{23} \item \texttt {CoefficientMultivariatePolynomial}, \hyperpage{155} \item \texttt {CoefficientToPolynomial}, \hyperpage{157} \item conference matrix, \hyperpage{66} \item \texttt {ConferenceCode}, \hyperpage{65} \item \texttt {ConstantWeightSubcode}, \hyperpage{117} \item \texttt {ConstructionBCode}, \hyperpage{114} \item \texttt {ConstructionXCode}, \hyperpage{122} \item \texttt {ConstructionXXCode}, \hyperpage{123} \item \texttt {ConversionFieldCode}, \hyperpage{116} \item \texttt {ConwayPolynomial}, \hyperpage{17} \item \texttt {CoordinateNorm}, \hyperpage{147} \item \texttt {CordaroWagnerCode}, \hyperpage{72} \item coset, \hyperpage{23} \item \texttt {CosetCode}, \hyperpage{116} \item covering code, \hyperpage{53} \item \texttt {CoveringRadius}, \hyperpage{53} \item cyclic, \hyperpage{87} \item \texttt {CyclicCodes}, \hyperpage{85} \item \texttt {CyclicMDSCode}, \hyperpage{87} \item \texttt {CyclotomicCosets}, \hyperpage{152} \indexspace \item \texttt {DavydovCode}, \hyperpage{76} \item \texttt {Decode}, \hyperpage{56} \item \texttt {Decodeword}, \hyperpage{57} \item \texttt {DecreaseMinimumDistanceUpperBound}, \hyperpage{51} \item defining polynomial, \hyperpage{17} \item degree, \hyperpage{95} \item \texttt {DegreeMultivariatePolynomial}, \hyperpage{154} \item \texttt {DegreesMonomialTerm}, \hyperpage{157} \item \texttt {DegreesMultivariatePolynomial}, \hyperpage{155} \item density of a code, \hyperpage{149} \item \texttt {Dimension}, \hyperpage{41} \item \texttt {DirectProductCode}, \hyperpage{119} \item \texttt {DirectSumCode}, \hyperpage{119} \item \texttt {Display}, \hyperpage{43} \item \texttt {DisplayBoundsInfo}, \hyperpage{43} \item distance, \hyperpage{55} \item \texttt {DistanceCodeword}, \hyperpage{26} \item \texttt {DistancesDistribution}, \hyperpage{55} \item \texttt {DistancesDistributionMatFFEVecFFE}, \hyperpage{15} \item \texttt {DistancesDistributionVecFFEsVecFFE}, \hyperpage{16} \item \texttt {DistanceVecFFE}, \hyperpage{16} \item divisor, \hyperpage{94} \item \texttt {DivisorAddition }, \hyperpage{95} \item \texttt {DivisorAutomorphismGroupP1 }, \hyperpage{101} \item \texttt {DivisorDegree }, \hyperpage{95} \item \texttt {DivisorGCD }, \hyperpage{96} \item \texttt {DivisorIsZero }, \hyperpage{96} \item \texttt {DivisorLCM }, \hyperpage{96} \item \texttt {DivisorNegate }, \hyperpage{96} \item \texttt {DivisorOfRationalFunctionP1 }, \hyperpage{98} \item \texttt {DivisorOnAffineCurve}, \hyperpage{95} \item \texttt {DivisorsEqual }, \hyperpage{96} \item \texttt {DivisorsMultivariatePolynomial}, \hyperpage{158} \item doubly-even, \hyperpage{35} \item \texttt {DualCode}, \hyperpage{115} \indexspace \item \texttt {ElementsCode}, \hyperpage{64} \item encoder map, \hyperpage{31} \item \texttt {EnlargedGabidulinCode}, \hyperpage{76} \item \texttt {EnlargedTombakCode}, \hyperpage{76} \item equivalent codes, \hyperpage{38} \item \texttt {EvaluationBivariateCode}, \hyperpage{103} \item \texttt {EvaluationBivariateCodeNC}, \hyperpage{103} \item \texttt {EvaluationCode}, \hyperpage{89} \item even, \hyperpage{36} \item \texttt {EvenWeightSubcode}, \hyperpage{109} \item \texttt {ExhaustiveSearchCoveringRadius}, \hyperpage{133} \item \texttt {ExpurgatedCode}, \hyperpage{110} \item \texttt {ExtendedBinaryGolayCode}, \hyperpage{77} \item \texttt {ExtendedCode}, \hyperpage{108} \item \texttt {ExtendedDirectSumCode}, \hyperpage{121} \item \texttt {ExtendedReedSolomonCode}, \hyperpage{82} \item \texttt {ExtendedTernaryGolayCode}, \hyperpage{78} \item external distance, \hyperpage{139} \indexspace \item \texttt {FerreroDesignCode}, \hyperpage{72} \item \texttt {FireCode}, \hyperpage{84} \item \texttt {FourNegacirculantSelfDualCode}, \hyperpage{88} \item \texttt {FourNegacirculantSelfDualCodeNC}, \hyperpage{89} \indexspace \item \texttt {GabidulinCode}, \hyperpage{76} \item Gary code, \hyperpage{141} \item \texttt {GeneralizedCodeNorm}, \hyperpage{148} \item \texttt {GeneralizedReedMullerCode}, \hyperpage{90} \item \texttt {GeneralizedReedSolomonCode}, \hyperpage{89} \item \texttt {GeneralizedReedSolomonDecoderGao}, \hyperpage{58} \item \texttt {GeneralizedReedSolomonListDecoder}, \hyperpage{58} \item \texttt {GeneralizedSrivastavaCode}, \hyperpage{71} \item \texttt {GeneralLowerBoundCoveringRadius}, \hyperpage{134} \item \texttt {GeneralUpperBoundCoveringRadius}, \hyperpage{134} \item generator polynomial, \hyperpage{29}, \hyperpage{79} \item \texttt {GeneratorMat}, \hyperpage{44} \item \texttt {GeneratorMatCode}, \hyperpage{68} \item \texttt {GeneratorPol}, \hyperpage{45} \item \texttt {GeneratorPolCode}, \hyperpage{79} \item \texttt {GenusCurve}, \hyperpage{93} \item \texttt {GoppaCode}, \hyperpage{71} \item \texttt {GoppaCodeClassical}, \hyperpage{103} \item \texttt {GOrbitPoint }, \hyperpage{93} \item \texttt {GrayMat}, \hyperpage{141} \item greatest common divisor, \hyperpage{96} \item \texttt {GreedyCode}, \hyperpage{67} \item Griesmer code, \hyperpage{129} \item \texttt {GuavaVersion}, \hyperpage{156} \indexspace \item Hadamard matrix, \hyperpage{65}, \hyperpage{142} \item \texttt {HadamardCode}, \hyperpage{65} \item \texttt {HadamardMat}, \hyperpage{142} \item Hamming metric, \hyperpage{16} \item \texttt {HammingCode}, \hyperpage{70} \item \texttt {HorizontalConversionFieldMat}, \hyperpage{145} \item hull, \hyperpage{120} \indexspace \item \texttt {in}, \hyperpage{32} \item \texttt {IncreaseCoveringRadiusLowerBound}, \hyperpage{132} \item information bits, \hyperpage{32} \item \texttt {InformationWord}, \hyperpage{32} \item \texttt {InnerDistribution}, \hyperpage{55} \item \texttt {IntersectionCode}, \hyperpage{120} \item \texttt {IrreduciblePolynomialsNr}, \hyperpage{151} \item \texttt {IsAction}\discretionary {-}{}{}\texttt {Moebius}\discretionary {-}{}{}\texttt {Transformation}\discretionary {-}{}{}\texttt {On}\discretionary {-}{}{}\texttt {Divisor}\discretionary {-}{}{}\texttt {DefinedP1 }, \hyperpage{100} \item \texttt {IsAffineCode}, \hyperpage{37} \item \texttt {IsAlmostAffineCode}, \hyperpage{38} \item IsCheapConwayPolynomial, \hyperpage{17} \item \texttt {IsCode}, \hyperpage{33} \item \texttt {IsCodeword}, \hyperpage{22} \item \texttt {IsCoordinateAcceptable}, \hyperpage{147} \item \texttt {IsCyclicCode}, \hyperpage{33} \item \texttt {IsDoublyEvenCode}, \hyperpage{35} \item \texttt {IsEquivalent}, \hyperpage{38} \item \texttt {IsEvenCode}, \hyperpage{36} \item \texttt {IsFinite}, \hyperpage{40} \item \texttt {IsGriesmerCode}, \hyperpage{129} \item \texttt {IsInStandardForm}, \hyperpage{144} \item \texttt {IsLatinSquare}, \hyperpage{146} \item \texttt {IsLinearCode}, \hyperpage{33} \item \texttt {IsMDSCode}, \hyperpage{34} \item \texttt {IsNormalCode}, \hyperpage{148} \item \texttt {IsPerfectCode}, \hyperpage{34} \item IsPrimitivePolynomial, \hyperpage{18} \item \texttt {IsSelfComplementaryCode}, \hyperpage{37} \item \texttt {IsSelfDualCode}, \hyperpage{35} \item \texttt {IsSelfOrthogonalCode}, \hyperpage{35} \item \texttt {IsSinglyEvenCode}, \hyperpage{36} \item \texttt {IsSubset}, \hyperpage{33} \indexspace \item \texttt {Krawtchouk}, \hyperpage{150} \item \texttt {KrawtchoukMat}, \hyperpage{141} \indexspace \item Latin square, \hyperpage{145} \item LDPC, \hyperpage{105} \item least common multiple, \hyperpage{96} \item \texttt {LeftActingDomain}, \hyperpage{41} \item length, \hyperpage{28} \item \texttt {LengthenedCode}, \hyperpage{113} \item \texttt {LexiCode}, \hyperpage{68} \item linear code, \hyperpage{19} \item \texttt {LowerBoundCoveringRadiusCountingExcess}, \hyperpage{136} \item \texttt {LowerBoundCoveringRadiusEmbedded1}, \hyperpage{137} \item \texttt {LowerBoundCoveringRadiusEmbedded2}, \hyperpage{137} \item \texttt {LowerBoundCoveringRadiusInduction}, \hyperpage{138} \item \texttt {LowerBoundCoveringRadiusSphereCovering}, \hyperpage{135} \item \texttt {LowerBoundCoveringRadiusVanWee1}, \hyperpage{135} \item \texttt {LowerBoundCoveringRadiusVanWee2}, \hyperpage{136} \item \texttt {LowerBoundGilbertVarshamov}, \hyperpage{130} \item \texttt {LowerBoundMinimumDistance}, \hyperpage{130} \item \texttt {LowerBoundSpherePacking}, \hyperpage{130} \indexspace \item MacWilliams transform, \hyperpage{149} \item \texttt {MatrixRepresentationOfElement}, \hyperpage{151} \item \texttt {Matrix}\discretionary {-}{}{}\texttt {Representation}\discretionary {-}{}{}\texttt {On}\discretionary {-}{}{}\texttt {Riemann}\discretionary {-}{}{}\texttt {Roch}\discretionary {-}{}{}\texttt {SpaceP1 }, \hyperpage{102} \item \texttt {Matrix}\discretionary {-}{}{}\texttt {Transformation}\discretionary {-}{}{}\texttt {On}\discretionary {-}{}{}\texttt {Multivariate}\discretionary {-}{}{}\texttt {Polynomial }, \hyperpage{154} \item maximum distance separable, \hyperpage{127} \item MDS, \hyperpage{35}, \hyperpage{87} \item minimum distance, \hyperpage{28} \item \texttt {MinimumDistance}, \hyperpage{46} \item \texttt {MinimumDistanceLeon}, \hyperpage{47} \item \texttt {MinimumDistanceRandom}, \hyperpage{51} \item \texttt {MinimumWeight}, \hyperpage{48} \item \texttt {MinimumWeightWords}, \hyperpage{54} \item \texttt {MoebiusTransformation }, \hyperpage{100} \item \texttt {MOLS}, \hyperpage{145} \item \texttt {MOLSCode}, \hyperpage{66} \item \texttt {MostCommonInList}, \hyperpage{153} \item \texttt {MultiplicityInList}, \hyperpage{153} \item mutually orthogonal Latin squares, \hyperpage{145} \indexspace \item \texttt {NearestNeighborDecodewords}, \hyperpage{61} \item \texttt {NearestNeighborGRSDecodewords}, \hyperpage{60} \item \texttt {NordstromRobinsonCode}, \hyperpage{67} \item norm of a code, \hyperpage{147} \item normal code, \hyperpage{148} \item not =, \hyperpage{22}, \hyperpage{30} \item \texttt {NrCyclicCodes}, \hyperpage{85} \item \texttt {NullCode}, \hyperpage{85} \item \texttt {NullWord}, \hyperpage{26} \indexspace \item \texttt {OnePointAGCode}, \hyperpage{104} \item \texttt {OptimalityCode}, \hyperpage{74} \item order of polynomial, \hyperpage{84} \item \texttt {OuterDistribution}, \hyperpage{56} \indexspace \item Parity check, \hyperpage{108} \item parity check matrix, \hyperpage{28} \item perfect, \hyperpage{127} \item perfect code, \hyperpage{150} \item permutation equivalent codes, \hyperpage{38} \item PermutationAutomorphismGroup, \hyperpage{39} \item \texttt {PermutationAutomorphismGroup}, \hyperpage{40} \item \texttt {PermutationDecode}, \hyperpage{63} \item \texttt {PermutationDecodeNC}, \hyperpage{63} \item \texttt {PermutedCode}, \hyperpage{110} \item \texttt {PermutedCols}, \hyperpage{144} \item \texttt {PiecewiseConstantCode}, \hyperpage{118} \item point, \hyperpage{92} \item \texttt {PolyCodeword}, \hyperpage{24} \item primitive element, \hyperpage{17} \item \texttt {PrimitivePolynomialsNr}, \hyperpage{151} \item \texttt {PrimitiveUnityRoot}, \hyperpage{150} \item \texttt {Print}, \hyperpage{42} \item \texttt {PuncturedCode}, \hyperpage{109} \item \texttt {PutStandardForm}, \hyperpage{143} \indexspace \item \texttt {QCLDPCCodeFromGroup}, \hyperpage{106} \item \texttt {QQRCode}, \hyperpage{83} \item \texttt {QQRCodeNC}, \hyperpage{83} \item \texttt {QRCode}, \hyperpage{82} \item \texttt {QuasiCyclicCode}, \hyperpage{86} \indexspace \item \texttt {RandomCode}, \hyperpage{67} \item \texttt {RandomLinearCode}, \hyperpage{73} \item \texttt {RandomPrimitivePolynomial}, \hyperpage{18} \item reciprocal polynomial, \hyperpage{152} \item \texttt {ReciprocalPolynomial}, \hyperpage{152} \item \texttt {Redundancy}, \hyperpage{46} \item \texttt {ReedMullerCode}, \hyperpage{70} \item \texttt {ReedSolomonCode}, \hyperpage{82} \item \texttt {RemovedElementsCode}, \hyperpage{111} \item \texttt {RepetitionCode}, \hyperpage{85} \item \texttt {ResidueCode}, \hyperpage{114} \item \texttt {RiemannRochSpaceBasisFunctionP1 }, \hyperpage{98} \item \texttt {RiemannRochSpaceBasisP1 }, \hyperpage{99} \item \texttt {RootsCode}, \hyperpage{80} \item \texttt {RootsOfCode}, \hyperpage{45} \item \texttt {RotateList}, \hyperpage{154} \indexspace \item self complementary code, \hyperpage{37} \item self-dual, \hyperpage{89}, \hyperpage{115} \item self-orthogonal, \hyperpage{35} \item \texttt {SetCoveringRadius}, \hyperpage{54} \item \texttt {ShortenedCode}, \hyperpage{112} \item singly-even, \hyperpage{36} \item \texttt {Size}, \hyperpage{40} \item size, \hyperpage{28} \item \texttt {SolveLinearSystem}, \hyperpage{156} \item \texttt {SphereContent}, \hyperpage{150} \item \texttt {SrivastavaCode}, \hyperpage{72} \item standard form, \hyperpage{143} \item \texttt {StandardArray}, \hyperpage{62} \item \texttt {StandardFormCode}, \hyperpage{117} \item strength, \hyperpage{139} \item \texttt {String}, \hyperpage{42} \item \texttt {SubCode}, \hyperpage{114} \item \texttt {Support}, \hyperpage{26} \item support, \hyperpage{94} \item \texttt {SylvesterMat}, \hyperpage{141} \item \texttt {Syndrome}, \hyperpage{61} \item syndrome table, \hyperpage{62} \item \texttt {SyndromeTable}, \hyperpage{62} \indexspace \item \texttt {TernaryGolayCode}, \hyperpage{78} \item \texttt {TombakCode}, \hyperpage{76} \item \texttt {ToricCode}, \hyperpage{91} \item \texttt {ToricPoints}, \hyperpage{91} \item \texttt {TraceCode}, \hyperpage{116} \item \texttt {TreatAsPoly}, \hyperpage{25} \item \texttt {TreatAsVector}, \hyperpage{25} \indexspace \item \texttt {UnionCode}, \hyperpage{120} \item \texttt {UpperBound}, \hyperpage{129} \item \texttt {UpperBoundCoveringRadiusCyclicCode}, \hyperpage{140} \item \texttt {UpperBoundCoveringRadiusDelsarte}, \hyperpage{139} \item \texttt {UpperBoundCoveringRadiusGriesmerLike}, \hyperpage{139} \item \texttt {UpperBoundCoveringRadiusRedundancy}, \hyperpage{138} \item \texttt {UpperBoundCoveringRadiusStrength}, \hyperpage{139} \item \texttt {UpperBoundElias}, \hyperpage{128} \item \texttt {UpperBoundGriesmer}, \hyperpage{129} \item \texttt {UpperBoundHamming}, \hyperpage{127} \item \texttt {UpperBoundJohnson}, \hyperpage{127} \item \texttt {UpperBoundMinimumDistance}, \hyperpage{131} \item \texttt {UpperBoundPlotkin}, \hyperpage{128} \item \texttt {UpperBoundSingleton}, \hyperpage{127} \item \texttt {UUVCode}, \hyperpage{119} \indexspace \item \texttt {VandermondeMat}, \hyperpage{142} \item \texttt {VectorCodeword}, \hyperpage{24} \item \texttt {VerticalConversionFieldMat}, \hyperpage{144} \indexspace \item weight enumerator polynomial, \hyperpage{148} \item \texttt {WeightCodeword}, \hyperpage{27} \item \texttt {WeightDistribution}, \hyperpage{55} \item \texttt {WeightHistogram}, \hyperpage{153} \item \texttt {WeightVecFFE}, \hyperpage{16} \item \texttt {WholeSpaceCode}, \hyperpage{84} \item \texttt {WordLength}, \hyperpage{46} \indexspace \item \texttt {ZechLog}, \hyperpage{156} \end{theindex}