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