[1XIndex[0X [2X*[0X 4.2-2 [2X*[0X 4.2-3 [2X+[0X 3.3-1 [2X+[0X 3.3-3 [2X+[0X 4.2-1 [2X-[0X 3.3-2 < > 3.2-1 < > 4.1-1 [2X=[0X 3.2-1 [2X=[0X 4.1-1 A(n,d) 7.1-7 acceptable coordinate 7.4-2 acceptable coordinate 7.4-3 [2XAClosestVectorComb..MatFFEVecFFECoords[0X 2.1-2 [2XAClosestVectorCombinationsMatFFEVecFFE[0X 2.1-1 [2XActionMoebiusTransformationOnDivisorP1 [0X 5.7-18 [2XActionMoebiusTransformationOnFunction [0X 5.7-17 [2XAddedElementsCode[0X 6.1-8 affine code 4.3-13 [2XAffineCurve[0X 5.7-1 [2XAffinePointsOnCurve[0X 5.7-2 [2XAlternantCode[0X 5.2-6 [2XAmalgamatedDirectSumCode[0X 6.2-7 [2XAreMOLS[0X 7.3-13 [2XAsSSortedList[0X 4.5-5 [2XAugmentedCode[0X 6.1-6 [2XAutomorphismGroup[0X 4.4-3 [2XBCHCode[0X 5.5-4 [2XBestKnownLinearCode[0X 5.2-14 [2XBinaryGolayCode[0X 5.4-1 [2XBitFlipDecoder[0X 4.10-5 [2XBlockwiseDirectSumCode[0X 6.2-8 Bose distance 5.5-4 bound, Gilbert-Varshamov lower 7.1-9 bound, sphere packing lower 7.1-10 bounds, Elias 7.1-4 bounds, Griesmer 7.1-5 bounds, Hamming 7.1-1 bounds, Johnson 7.1-2 bounds, Plotkin 7.1-3 bounds, Singleton 7.1 bounds, sphere packing bound 7.1-1 [2XBoundsCoveringRadius[0X 7.2-1 [2XBoundsMinimumDistance[0X 7.1-13 [2XBZCode[0X 6.2-11 [2XBZCodeNC[0X 6.2-12 check polynomial 4. check polynomial 5.5 [2XCheckMat[0X 4.7-2 [2XCheckMatCode[0X 5.2-3 [2XCheckMatCodeMutable[0X 5.2-2 [2XCheckPol[0X 4.7-4 [2XCheckPolCode[0X 5.5-2 [2XCirculantMatrix[0X 7.5-17 code 4. code, (n,M,d) 4. code, [n, k, d]r 4. code, AG 5.7 code, alternant 5.2-5 code, Bose-Chaudhuri-Hockenghem 5.5-3 code, conference 5.1-2 code, Cordaro-Wagner 5.2-9 code, cyclic 4. code, Davydov 5.3-2 code, doubly-even 4.3-10 code, element test 4.3-1 code, elements of 4. code, evaluation 5.6 code, even 4.3-12 code, Fire 5.5-9 code, Gabidulin 5.3 code, Golay (binary) 5.4 code, Golay (ternary) 5.4-2 code, Goppa (classical) 5.2-6 code, greedy 5.1-6 code, Hadamard 5.1-1 code, Hamming 5.2-3 code, linear 4. code, maximum distance separable 4.3-7 code, Nordstrom-Robinson 5.1-5 code, perfect 4.3-6 code, Reed-Muller 5.2-4 code, Reed-Solomon 5.5-4 code, self-dual 4.3-8 code, self-orthogonal 4.3-9 code, singly-even 4.3-11 code, Srivastava 5.2-7 code, subcode 4.3-2 code, Tombak 5.3-3 code, toric 5.6-4 code, unrestricted 4. [2XCodeDensity[0X 7.5-4 [2XCodeDistanceEnumerator[0X 7.5-2 [2XCodeIsomorphism[0X 4.4-2 [2XCodeMacWilliamsTransform[0X 7.5-3 [2XCodeNorm[0X 7.4-2 codes, addition 4.2-1 codes, decoding 4.2-4 codes, direct sum 4.2-1 codes, encoding 4.2-3 codes, product 4.2-2 [2XCodeWeightEnumerator[0X 7.5-1 [2XCodeword[0X 3.1-1 [2XCodewordNr[0X 3.1-2 codewords, addition 3.3-1 codewords, cosets 3.3-3 codewords, subtraction 3.3-2 [2XCoefficientMultivariatePolynomial[0X 7.6-4 [2XCoefficientToPolynomial[0X 7.6-8 conference matrix 5.1-3 [2XConferenceCode[0X 5.1-3 [2XConstantWeightSubcode[0X 6.1-18 [2XConstructionBCode[0X 6.1-13 [2XConstructionXCode[0X 6.2-9 [2XConstructionXXCode[0X 6.2-10 [2XConversionFieldCode[0X 6.1-15 [2XConwayPolynomial[0X 2.2-1 [2XCoordinateNorm[0X 7.4-1 [2XCordaroWagnerCode[0X 5.2-10 coset 3.3-3 [2XCosetCode[0X 6.1-17 covering code 4.8-7 [2XCoveringRadius[0X 4.8-8 cyclic 5.5-17 [2XCyclicCodes[0X 5.5-14 [2XCyclicMDSCode[0X 5.5-17 [2XCyclotomicCosets[0X 7.5-12 [2XDavydovCode[0X 5.3-3 [2XDecode[0X 4.10-1 [2XDecodeword[0X 4.10-2 [2XDecreaseMinimumDistanceUpperBound[0X 4.8-6 defining polynomial 2.2 degree 5.7-7 [2XDegreeMultivariatePolynomial[0X 7.6-2 [2XDegreesMonomialTerm[0X 7.6-9 [2XDegreesMultivariatePolynomial[0X 7.6-3 density of a code 7.5-3 [2XDimension[0X 4.5-4 [2XDirectProductCode[0X 6.2-3 [2XDirectSumCode[0X 6.2-1 [2XDisplay[0X 4.6-3 [2XDisplayBoundsInfo[0X 4.6-4 distance 4.9-3 [2XDistanceCodeword[0X 3.6-2 [2XDistancesDistribution[0X 4.9-4 [2XDistancesDistributionMatFFEVecFFE[0X 2.1-3 [2XDistancesDistributionVecFFEsVecFFE[0X 2.1-4 [2XDistanceVecFFE[0X 2.1-6 divisor 5.7-4 [2XDivisorAddition [0X 5.7-6 [2XDivisorAutomorphismGroupP1 [0X 5.7-20 [2XDivisorDegree [0X 5.7-7 [2XDivisorGCD [0X 5.7-11 [2XDivisorIsZero [0X 5.7-9 [2XDivisorLCM [0X 5.7-12 [2XDivisorNegate [0X 5.7-8 [2XDivisorOfRationalFunctionP1 [0X 5.7-14 [2XDivisorOnAffineCurve[0X 5.7-5 [2XDivisorsEqual [0X 5.7-10 [2XDivisorsMultivariatePolynomial[0X 7.6-10 doubly-even 4.3-9 [2XDualCode[0X 6.1-14 [2XElementsCode[0X 5.1-1 encoder map 4.2-3 [2XEnlargedGabidulinCode[0X 5.3-2 [2XEnlargedTombakCode[0X 5.3-5 equivalent codes 4.4 [2XEvaluationBivariateCode[0X 5.7-23 [2XEvaluationBivariateCodeNC[0X 5.7-24 [2XEvaluationCode[0X 5.6-1 even 4.3-11 [2XEvenWeightSubcode[0X 6.1-3 [2XExhaustiveSearchCoveringRadius[0X 7.2-3 [2XExpurgatedCode[0X 6.1-5 [2XExtendedBinaryGolayCode[0X 5.4-2 [2XExtendedCode[0X 6.1-1 [2XExtendedDirectSumCode[0X 6.2-6 [2XExtendedReedSolomonCode[0X 5.5-6 [2XExtendedTernaryGolayCode[0X 5.4-4 external distance 7.2-13 [2XFerreroDesignCode[0X 5.2-11 [2XFireCode[0X 5.5-10 [2XFourNegacirculantSelfDualCode[0X 5.5-18 [2XFourNegacirculantSelfDualCodeNC[0X 5.5-19 [2XGabidulinCode[0X 5.3-1 Gary code 7.3-1 [2XGeneralizedCodeNorm[0X 7.4-4 [2XGeneralizedReedMullerCode[0X 5.6-3 [2XGeneralizedReedSolomonCode[0X 5.6-2 [2XGeneralizedReedSolomonDecoderGao[0X 4.10-3 [2XGeneralizedReedSolomonListDecoder[0X 4.10-4 [2XGeneralizedSrivastavaCode[0X 5.2-8 [2XGeneralLowerBoundCoveringRadius[0X 7.2-4 [2XGeneralUpperBoundCoveringRadius[0X 7.2-5 generator polynomial 4. generator polynomial 5.5 [2XGeneratorMat[0X 4.7-1 [2XGeneratorMatCode[0X 5.2-1 [2XGeneratorPol[0X 4.7-3 [2XGeneratorPolCode[0X 5.5-1 [2XGenusCurve[0X 5.7-3 GF(p) 2.2 GF(q) 2.2 [2XGoppaCode[0X 5.2-7 [2XGoppaCodeClassical[0X 5.7-22 [2XGOrbitPoint [0X 5.7-4 [2XGrayMat[0X 7.3-2 greatest common divisor 5.7-11 [2XGreedyCode[0X 5.1-7 Griesmer code 7.1-6 [2XGuavaVersion[0X 7.6-6 Hadamard matrix 5.1-2 Hadamard matrix 7.3-3 [2XHadamardCode[0X 5.1-2 [2XHadamardMat[0X 7.3-4 Hamming metric 2.1-5 [2XHammingCode[0X 5.2-4 [2XHorizontalConversionFieldMat[0X 7.3-10 hull 6.2-4 [2Xin[0X 4.3-1 [2XIncreaseCoveringRadiusLowerBound[0X 7.2-2 information bits 4.2-4 [2XInformationWord[0X 4.2-4 [2XInnerDistribution[0X 4.9-3 [2XIntersectionCode[0X 6.2-4 [2XIrreduciblePolynomialsNr[0X 7.5-9 [2XIsActionMoebiusTransformationOnDivisorDefinedP1 [0X 5.7-19 [2XIsAffineCode[0X 4.3-14 [2XIsAlmostAffineCode[0X 4.3-15 IsCheapConwayPolynomial 2.2-1 [2XIsCode[0X 4.3-3 [2XIsCodeword[0X 3.1-3 [2XIsCoordinateAcceptable[0X 7.4-3 [2XIsCyclicCode[0X 4.3-5 [2XIsDoublyEvenCode[0X 4.3-10 [2XIsEquivalent[0X 4.4-1 [2XIsEvenCode[0X 4.3-12 [2XIsFinite[0X 4.5-1 [2XIsGriesmerCode[0X 7.1-7 [2XIsInStandardForm[0X 7.3-7 [2XIsLatinSquare[0X 7.3-12 [2XIsLinearCode[0X 4.3-4 [2XIsMDSCode[0X 4.3-7 [2XIsNormalCode[0X 7.4-5 [2XIsPerfectCode[0X 4.3-6 IsPrimitivePolynomial 2.2-2 [2XIsSelfComplementaryCode[0X 4.3-13 [2XIsSelfDualCode[0X 4.3-8 [2XIsSelfOrthogonalCode[0X 4.3-9 [2XIsSinglyEvenCode[0X 4.3-11 [2XIsSubset[0X 4.3-2 [2XKrawtchouk[0X 7.5-6 [2XKrawtchoukMat[0X 7.3-1 Latin square 7.3-10 LDPC 5.8 least common multiple 5.7-12 [2XLeftActingDomain[0X 4.5-3 length 4. [2XLengthenedCode[0X 6.1-10 [2XLexiCode[0X 5.1-8 linear code 3. [2XLowerBoundCoveringRadiusCountingExcess[0X 7.2-9 [2XLowerBoundCoveringRadiusEmbedded1[0X 7.2-10 [2XLowerBoundCoveringRadiusEmbedded2[0X 7.2-11 [2XLowerBoundCoveringRadiusInduction[0X 7.2-12 [2XLowerBoundCoveringRadiusSphereCovering[0X 7.2-6 [2XLowerBoundCoveringRadiusVanWee1[0X 7.2-7 [2XLowerBoundCoveringRadiusVanWee2[0X 7.2-8 [2XLowerBoundGilbertVarshamov[0X 7.1-10 [2XLowerBoundMinimumDistance[0X 7.1-9 [2XLowerBoundSpherePacking[0X 7.1-11 MacWilliams transform 7.5-2 [2XMatrixRepresentationOfElement[0X 7.5-10 [2XMatrixRepresentationOnRiemannRochSpaceP1 [0X 5.7-21 [2XMatrixTransformationOnMultivariatePolynomial [0X 7.6-1 maximum distance separable 7.1-1 MDS 4.3-7 MDS 5.5-17 minimum distance 4. [2XMinimumDistance[0X 4.8-3 [2XMinimumDistanceLeon[0X 4.8-4 [2XMinimumDistanceRandom[0X 4.8-7 [2XMinimumWeight[0X 4.8-5 [2XMinimumWeightWords[0X 4.9-1 [2XMoebiusTransformation [0X 5.7-16 [2XMOLS[0X 7.3-11 [2XMOLSCode[0X 5.1-4 [2XMostCommonInList[0X 7.5-15 [2XMultiplicityInList[0X 7.5-14 mutually orthogonal Latin squares 7.3-10 [2XNearestNeighborDecodewords[0X 4.10-7 [2XNearestNeighborGRSDecodewords[0X 4.10-6 [2XNordstromRobinsonCode[0X 5.1-6 norm of a code 7.4-1 normal code 7.4-4 not = 3.2-1 not = 4.1-1 [2XNrCyclicCodes[0X 5.5-15 [2XNullCode[0X 5.5-12 [2XNullWord[0X 3.6-1 [2XOnePointAGCode[0X 5.7-25 [2XOptimalityCode[0X 5.2-13 order of polynomial 5.5-10 [2XOuterDistribution[0X 4.9-5 Parity check 6.1 parity check matrix 4. perfect 7.1-1 perfect code 7.5-4 permutation equivalent codes 4.4 PermutationAutomorphismGroup 4.4-3 [2XPermutationAutomorphismGroup[0X 4.4-4 [2XPermutationDecode[0X 4.10-11 [2XPermutationDecodeNC[0X 4.10-12 [2XPermutedCode[0X 6.1-4 [2XPermutedCols[0X 7.3-8 [2XPiecewiseConstantCode[0X 6.1-20 point 5.7-1 [2XPolyCodeword[0X 3.4-2 primitive element 2.2 [2XPrimitivePolynomialsNr[0X 7.5-8 [2XPrimitiveUnityRoot[0X 7.5-7 [2XPrint[0X 4.6-1 [2XPuncturedCode[0X 6.1-2 [2XPutStandardForm[0X 7.3-6 [2XQCLDPCCodeFromGroup[0X 5.8-1 [2XQQRCode[0X 5.5-9 [2XQQRCodeNC[0X 5.5-8 [2XQRCode[0X 5.5-7 [2XQuasiCyclicCode[0X 5.5-16 [2XRandomCode[0X 5.1-5 [2XRandomLinearCode[0X 5.2-12 [2XRandomPrimitivePolynomial[0X 2.2-2 reciprocal polynomial 7.5-10 [2XReciprocalPolynomial[0X 7.5-11 [2XRedundancy[0X 4.8-2 [2XReedMullerCode[0X 5.2-5 [2XReedSolomonCode[0X 5.5-5 [2XRemovedElementsCode[0X 6.1-7 [2XRepetitionCode[0X 5.5-13 [2XResidueCode[0X 6.1-12 [2XRiemannRochSpaceBasisFunctionP1 [0X 5.7-13 [2XRiemannRochSpaceBasisP1 [0X 5.7-15 [2XRootsCode[0X 5.5-3 [2XRootsOfCode[0X 4.7-5 [2XRotateList[0X 7.5-16 self complementary code 4.3-12 self-dual 5.5-18 self-dual 6.1-14 self-orthogonal 4.3-8 [2XSetCoveringRadius[0X 4.8-9 [2XShortenedCode[0X 6.1-9 singly-even 4.3-10 size 4. [2XSize[0X 4.5-2 [2XSolveLinearSystem[0X 7.6-5 [2XSphereContent[0X 7.5-5 [2XSrivastavaCode[0X 5.2-9 standard form 7.3-5 [2XStandardArray[0X 4.10-10 [2XStandardFormCode[0X 6.1-19 strength 7.2-15 [2XString[0X 4.6-2 [2XSubCode[0X 6.1-11 [2XSupport[0X 3.6-3 support 5.7-4 [2XSylvesterMat[0X 7.3-3 [2XSyndrome[0X 4.10-8 syndrome table 4.10-9 [2XSyndromeTable[0X 4.10-9 t(n,k) 4.8-7 [2XTernaryGolayCode[0X 5.4-3 [2XTombakCode[0X 5.3-4 [2XToricCode[0X 5.6-5 [2XToricPoints[0X 5.6-4 [2XTraceCode[0X 6.1-16 [2XTreatAsPoly[0X 3.5-2 [2XTreatAsVector[0X 3.5-1 [2XUnionCode[0X 6.2-5 [2XUpperBound[0X 7.1-8 [2XUpperBoundCoveringRadiusCyclicCode[0X 7.2-17 [2XUpperBoundCoveringRadiusDelsarte[0X 7.2-14 [2XUpperBoundCoveringRadiusGriesmerLike[0X 7.2-16 [2XUpperBoundCoveringRadiusRedundancy[0X 7.2-13 [2XUpperBoundCoveringRadiusStrength[0X 7.2-15 [2XUpperBoundElias[0X 7.1-5 [2XUpperBoundGriesmer[0X 7.1-6 [2XUpperBoundHamming[0X 7.1-2 [2XUpperBoundJohnson[0X 7.1-3 [2XUpperBoundMinimumDistance[0X 7.1-12 [2XUpperBoundPlotkin[0X 7.1-4 [2XUpperBoundSingleton[0X 7.1-1 [2XUUVCode[0X 6.2-2 [2XVandermondeMat[0X 7.3-5 [2XVectorCodeword[0X 3.4-1 [2XVerticalConversionFieldMat[0X 7.3-9 weight enumerator polynomial 7.5 [2XWeightCodeword[0X 3.6-4 [2XWeightDistribution[0X 4.9-2 [2XWeightHistogram[0X 7.5-13 [2XWeightVecFFE[0X 2.1-5 [2XWholeSpaceCode[0X 5.5-11 [2XWordLength[0X 4.8-1 [2XZechLog[0X 7.6-7 -------------------------------------------------------