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