  
  
  [1m[4m[31mIndex[0m
  
  [1m[34m*[0m  4.2-2
  [1m[34m*[0m  4.2-3
  [1m[34m+[0m  3.3-1
  [1m[34m+[0m  3.3-3
  [1m[34m+[0m  4.2-1
  [1m[34m-[0m  3.3-2
  < >  3.2-1
  < >  4.1-1
  [1m[34m=[0m  3.2-1
  [1m[34m=[0m  4.1-1
  A(n,d)  7.1-7
  acceptable coordinate  7.4-2
  acceptable coordinate  7.4-3
  [1m[34mAClosestVectorComb..MatFFEVecFFECoords[0m  2.1-2
  [1m[34mAClosestVectorCombinationsMatFFEVecFFE[0m  2.1-1
  [1m[34mActionMoebiusTransformationOnDivisorP1 [0m  5.7-18
  [1m[34mActionMoebiusTransformationOnFunction [0m  5.7-17
  [1m[34mAddedElementsCode[0m  6.1-8
  affine code  4.3-10
  [1m[34mAffineCurve[0m  5.7-1
  [1m[34mAffinePointsOnCurve[0m  5.7-2
  [1m[34mAlternantCode[0m  5.2-6
  [1m[34mAmalgamatedDirectSumCode[0m  6.2-7
  [1m[34mAreMOLS[0m  7.3-13
  [1m[34mAsSSortedList[0m  4.5-5
  [1m[34mAugmentedCode[0m  6.1-6
  [1m[34mAutomorphismGroup[0m  4.4-3
  [1m[34mBCHCode[0m  5.5-4
  [1m[34mBestKnownLinearCode[0m  5.2-14
  [1m[34mBinaryGolayCode[0m  5.4-1
  [1m[34mBitFlipDecoder[0m  4.10-5
  [1m[34mBlockwiseDirectSumCode[0m  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
  [1m[34mBoundsCoveringRadius[0m  7.2-1
  [1m[34mBoundsMinimumDistance[0m  7.1-13
  check polynomial  4.
  check polynomial  5.5
  [1m[34mCheckMat[0m  4.7-2
  [1m[34mCheckMatCode[0m  5.2-3
  [1m[34mCheckMatCodeMutable[0m  5.2-2
  [1m[34mCheckPol[0m  4.7-4
  [1m[34mCheckPolCode[0m  5.5-2
  [1m[34mCirculantMatrix[0m  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, element test  4.3-1
  code, elements of  4.
  code, evaluation  5.6
  code, Fire  5.5-8
  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, Srivastava  5.2-7
  code, subcode  4.3-2
  code, Tombak  5.3-3
  code, toric  5.6-4
  code, unrestricted  4.
  [1m[34mCodeDensity[0m  7.5-4
  [1m[34mCodeDistanceEnumerator[0m  7.5-2
  [1m[34mCodeIsomorphism[0m  4.4-2
  [1m[34mCodeMacWilliamsTransform[0m  7.5-3
  [1m[34mCodeNorm[0m  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
  [1m[34mCodeWeightEnumerator[0m  7.5-1
  [1m[34mCodeword[0m  3.1-1
  [1m[34mCodewordNr[0m  3.1-2
  codewords, addition  3.3-1
  codewords, cosets  3.3-3
  codewords, subtraction  3.3-2
  [1m[34mCoefficientMultivariatePolynomial[0m  7.6-4
  [1m[34mCoefficientToPolynomial[0m  7.6-7
  [1m[34mCoefficientToPolynomial[0m  7.6-8
  conference matrix  5.1-3
  [1m[34mConferenceCode[0m  5.1-3
  [1m[34mConstantWeightSubcode[0m  6.1-17
  [1m[34mConstructionBCode[0m  6.1-12
  [1m[34mConversionFieldCode[0m  6.1-14
  [1m[34mConwayPolynomial[0m  2.2-1
  [1m[34mCoordinateNorm[0m  7.4-1
  [1m[34mCordaroWagnerCode[0m  5.2-10
  coset  3.3-3
  [1m[34mCosetCode[0m  6.1-16
  covering code  4.8-6
  [1m[34mCoveringRadius[0m  4.8-7
  [1m[34mCyclicCodes[0m  5.5-13
  [1m[34mCyclotomicCosets[0m  7.5-12
  [1m[34mDavydovCode[0m  5.3-3
  [1m[34mDecode[0m  4.10-1
  [1m[34mDecodeword[0m  4.10-2
  [1m[34mDecreaseMinimumDistanceUpperBound[0m  4.8-5
  defining polynomial  2.2
  degree  5.7-7
  [1m[34mDegreeMultivariatePolynomial[0m  7.6-2
  [1m[34mDegreesMonomialTerm[0m  7.6-9
  [1m[34mDegreesMultivariatePolynomial[0m  7.6-3
  density of a code  7.5-3
  [1m[34mDimension[0m  4.5-4
  [1m[34mDirectProductCode[0m  6.2-3
  [1m[34mDirectSumCode[0m  6.2-1
  [1m[34mDisplay[0m  4.6-3
  [1m[34mDisplayBoundsInfo[0m  4.6-4
  distance  4.9-3
  [1m[34mDistanceCodeword[0m  3.6-2
  [1m[34mDistancesDistribution[0m  4.9-4
  [1m[34mDistancesDistributionMatFFEVecFFE[0m  2.1-3
  [1m[34mDistancesDistributionVecFFEsVecFFE[0m  2.1-4
  [1m[34mDistanceVecFFE[0m  2.1-6
  divisor  5.7-4
  [1m[34mDivisorAddition [0m  5.7-6
  [1m[34mDivisorAutomorphismGroupP1 [0m  5.7-20
  [1m[34mDivisorDegree [0m  5.7-7
  [1m[34mDivisorGCD [0m  5.7-11
  [1m[34mDivisorIsZero [0m  5.7-9
  [1m[34mDivisorLCM [0m  5.7-12
  [1m[34mDivisorNegate [0m  5.7-8
  [1m[34mDivisorOfRationalFunctionP1 [0m  5.7-14
  [1m[34mDivisorOnAffineCurve[0m  5.7-5
  [1m[34mDivisorsEqual [0m  5.7-10
  [1m[34mDivisorsMultivariatePolynomial[0m  7.6-10
  [1m[34mDualCode[0m  6.1-13
  [1m[34mElementsCode[0m  5.1-1
  encoder map  4.2-3
  [1m[34mEnlargedGabidulinCode[0m  5.3-2
  [1m[34mEnlargedTombakCode[0m  5.3-5
  equivalent codes  4.4
  [1m[34mEvaluationBivariateCode[0m  5.7-23
  [1m[34mEvaluationBivariateCodeNC[0m  5.7-24
  [1m[34mEvaluationCode[0m  5.6-1
  [1m[34mEvenWeightSubcode[0m  6.1-3
  [1m[34mExhaustiveSearchCoveringRadius[0m  7.2-3
  [1m[34mExpurgatedCode[0m  6.1-5
  [1m[34mExtendedBinaryGolayCode[0m  5.4-2
  [1m[34mExtendedCode[0m  6.1-1
  [1m[34mExtendedDirectSumCode[0m  6.2-6
  [1m[34mExtendedTernaryGolayCode[0m  5.4-4
  external distance  7.2-13
  [1m[34mFerreroDesignCode[0m  5.2-11
  [1m[34mFireCode[0m  5.5-9
  [1m[34mGabidulinCode[0m  5.3-1
  Gary code  7.3-1
  [1m[34mGeneralizedCodeNorm[0m  7.4-4
  [1m[34mGeneralizedReedMullerCode[0m  5.6-3
  [1m[34mGeneralizedReedSolomonCode[0m  5.6-2
  [1m[34mGeneralizedReedSolomonDecoderGao[0m  4.10-3
  [1m[34mGeneralizedReedSolomonListDecoder[0m  4.10-4
  [1m[34mGeneralizedSrivastavaCode[0m  5.2-8
  [1m[34mGeneralLowerBoundCoveringRadius[0m  7.2-4
  [1m[34mGeneralUpperBoundCoveringRadius[0m  7.2-5
  generator polynomial  4.
  generator polynomial  5.5
  [1m[34mGeneratorMat[0m  4.7-1
  [1m[34mGeneratorMatCode[0m  5.2-1
  [1m[34mGeneratorPol[0m  4.7-3
  [1m[34mGeneratorPolCode[0m  5.5-1
  [1m[34mGenusCurve[0m  5.7-3
  GF(p)  2.2
  GF(q)  2.2
  [1m[34mGoppaCode[0m  5.2-7
  [1m[34mGoppaCodeClassical[0m  5.7-22
  [1m[34mGOrbitPoint [0m  5.7-4
  [1m[34mGrayMat[0m  7.3-2
  greatest common divisor  5.7-11
  [1m[34mGreedyCode[0m  5.1-7
  Griesmer code  7.1-6
  [1m[34mGuavaVersion[0m  7.6-6
  Hadamard matrix  5.1-2
  Hadamard matrix  7.3-3
  [1m[34mHadamardCode[0m  5.1-2
  [1m[34mHadamardMat[0m  7.3-4
  Hamming metric  2.1-5
  [1m[34mHammingCode[0m  5.2-4
  [1m[34mHorizontalConversionFieldMat[0m  7.3-10
  hull  6.2-4
  [1m[34min[0m  4.3-1
  [1m[34mIncreaseCoveringRadiusLowerBound[0m  7.2-2
  information bits  4.2-4
  [1m[34mInformationWord[0m  4.2-4
  [1m[34mInnerDistribution[0m  4.9-3
  [1m[34mIntersectionCode[0m  6.2-4
  [1m[34mIrreduciblePolynomialsNr[0m  7.5-9
  [1m[34mIsActionMoebiusTransformationOnDivisorDefinedP1 [0m  5.7-19
  [1m[34mIsAffineCode[0m  4.3-11
  [1m[34mIsAlmostAffineCode[0m  4.3-12
  IsCheapConwayPolynomial  2.2-1
  [1m[34mIsCode[0m  4.3-3
  [1m[34mIsCodeword[0m  3.1-3
  [1m[34mIsCoordinateAcceptable[0m  7.4-3
  [1m[34mIsCyclicCode[0m  4.3-5
  [1m[34mIsEquivalent[0m  4.4-1
  [1m[34mIsFinite[0m  4.5-1
  [1m[34mIsGriesmerCode[0m  7.1-7
  [1m[34mIsInStandardForm[0m  7.3-7
  [1m[34mIsLatinSquare[0m  7.3-12
  [1m[34mIsLinearCode[0m  4.3-4
  [1m[34mIsMDSCode[0m  4.3-7
  [1m[34mIsNormalCode[0m  7.4-5
  [1m[34mIsPerfectCode[0m  4.3-6
  IsPrimitivePolynomial  2.2-2
  [1m[34mIsSelfComplementaryCode[0m  4.3-10
  [1m[34mIsSelfDualCode[0m  4.3-8
  [1m[34mIsSelfOrthogonalCode[0m  4.3-9
  [1m[34mIsSubset[0m  4.3-2
  [1m[34mKrawtchouk[0m  7.5-6
  [1m[34mKrawtchoukMat[0m  7.3-1
  Latin square  7.3-10
  least common multiple  5.7-12
  [1m[34mLeftActingDomain[0m  4.5-3
  length  4.
  [1m[34mLengthenedCode[0m  6.1-10
  [1m[34mLexiCode[0m  5.1-8
  linear code  3.
  [1m[34mLowerBoundCoveringRadiusCountingExcess[0m  7.2-9
  [1m[34mLowerBoundCoveringRadiusEmbedded1[0m  7.2-10
  [1m[34mLowerBoundCoveringRadiusEmbedded2[0m  7.2-11
  [1m[34mLowerBoundCoveringRadiusInduction[0m  7.2-12
  [1m[34mLowerBoundCoveringRadiusSphereCovering[0m  7.2-6
  [1m[34mLowerBoundCoveringRadiusVanWee1[0m  7.2-7
  [1m[34mLowerBoundCoveringRadiusVanWee2[0m  7.2-8
  [1m[34mLowerBoundGilbertVarshamov[0m  7.1-10
  [1m[34mLowerBoundMinimumDistance[0m  7.1-9
  [1m[34mLowerBoundSpherePacking[0m  7.1-11
  MacWilliams transform  7.5-2
  [1m[34mMatrixRepresentationOfElement[0m  7.5-10
  [1m[34mMatrixRepresentationOnRiemannRochSpaceP1 [0m  5.7-21
  [1m[34mMatrixTransformationOnMultivariatePolynomial [0m  7.6-1
  maximum distance separable  7.1-1
  MDS  4.3-7
  minimum distance  4.
  [1m[34mMinimumDistance[0m  4.8-3
  [1m[34mMinimumDistanceLeon[0m  4.8-4
  [1m[34mMinimumDistanceRandom[0m  4.8-6
  [1m[34mMinimumWeightWords[0m  4.9-1
  [1m[34mMoebiusTransformation [0m  5.7-16
  [1m[34mMOLS[0m  7.3-11
  [1m[34mMOLSCode[0m  5.1-4
  [1m[34mMostCommonInList[0m  7.5-15
  [1m[34mMultiplicityInList[0m  7.5-14
  mutually orthogonal Latin squares  7.3-10
  [1m[34mNearestNeighborDecodewords[0m  4.10-7
  [1m[34mNearestNeighborGRSDecodewords[0m  4.10-6
  [1m[34mNordstromRobinsonCode[0m  5.1-6
  norm of a code  7.4-1
  normal code  7.4-4
  not =  3.2-1
  not =  4.1-1
  [1m[34mNrCyclicCodes[0m  5.5-14
  [1m[34mNullCode[0m  5.5-11
  [1m[34mNullWord[0m  3.6-1
  [1m[34mOnePointAGCode[0m  5.7-25
  [1m[34mOptimalityCode[0m  5.2-13
  order of polynomial  5.5-9
  [1m[34mOuterDistribution[0m  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
  [1m[34mPermutationAutomorphismGroup[0m  4.4-4
  [1m[34mPermutationDecode[0m  4.10-11
  [1m[34mPermutationDecodeNC[0m  4.10-12
  [1m[34mPermutedCode[0m  6.1-4
  [1m[34mPermutedCols[0m  7.3-8
  [1m[34mPiecewiseConstantCode[0m  6.1-19
  point  5.7-1
  [1m[34mPolyCodeword[0m  3.4-2
  primitive element  2.2
  [1m[34mPrimitivePolynomialsNr[0m  7.5-8
  [1m[34mPrimitiveUnityRoot[0m  7.5-7
  [1m[34mPrint[0m  4.6-1
  [1m[34mPuncturedCode[0m  6.1-2
  [1m[34mPutStandardForm[0m  7.3-6
  [1m[34mQQRCode[0m  5.5-8
  [1m[34mQQRCodeNC[0m  5.5-7
  [1m[34mQRCode[0m  5.5-6
  [1m[34mRandomCode[0m  5.1-5
  [1m[34mRandomLinearCode[0m  5.2-12
  [1m[34mRandomPrimitivePolynomial[0m  2.2-2
  reciprocal polynomial  7.5-10
  [1m[34mReciprocalPolynomial[0m  7.5-11
  [1m[34mRedundancy[0m  4.8-2
  [1m[34mReedMullerCode[0m  5.2-5
  [1m[34mReedSolomonCode[0m  5.5-5
  [1m[34mRemovedElementsCode[0m  6.1-7
  [1m[34mRepetitionCode[0m  5.5-12
  [1m[34mResidueCode[0m  6.1-11
  [1m[34mRiemannRochSpaceBasisFunctionP1 [0m  5.7-13
  [1m[34mRiemannRochSpaceBasisP1 [0m  5.7-15
  [1m[34mRootsCode[0m  5.5-3
  [1m[34mRootsOfCode[0m  4.7-5
  [1m[34mRotateList[0m  7.5-16
  self complementary code  4.3-9
  self-dual  6.1-13
  self-orthogonal  4.3-8
  [1m[34mSetCoveringRadius[0m  4.8-8
  [1m[34mShortenedCode[0m  6.1-9
  size  4.
  [1m[34mSize[0m  4.5-2
  [1m[34mSolveLinearSystem[0m  7.6-5
  [1m[34mSphereContent[0m  7.5-5
  [1m[34mSrivastavaCode[0m  5.2-9
  standard form  7.3-5
  [1m[34mStandardArray[0m  4.10-10
  [1m[34mStandardFormCode[0m  6.1-18
  strength  7.2-15
  [1m[34mString[0m  4.6-2
  [1m[34mSupport[0m  3.6-3
  support  5.7-4
  [1m[34mSylvesterMat[0m  7.3-3
  [1m[34mSyndrome[0m  4.10-8
  syndrome table  4.10-9
  [1m[34mSyndromeTable[0m  4.10-9
  t(n,k)  4.8-6
  [1m[34mTernaryGolayCode[0m  5.4-3
  [1m[34mTombakCode[0m  5.3-4
  [1m[34mToricCode[0m  5.6-5
  [1m[34mToricPoints[0m  5.6-4
  [1m[34mTraceCode[0m  6.1-15
  [1m[34mTreatAsPoly[0m  3.5-2
  [1m[34mTreatAsVector[0m  3.5-1
  [1m[34mUnionCode[0m  6.2-5
  [1m[34mUpperBound[0m  7.1-8
  [1m[34mUpperBoundCoveringRadiusCyclicCode[0m  7.2-17
  [1m[34mUpperBoundCoveringRadiusDelsarte[0m  7.2-14
  [1m[34mUpperBoundCoveringRadiusGriesmerLike[0m  7.2-16
  [1m[34mUpperBoundCoveringRadiusRedundancy[0m  7.2-13
  [1m[34mUpperBoundCoveringRadiusStrength[0m  7.2-15
  [1m[34mUpperBoundElias[0m  7.1-5
  [1m[34mUpperBoundGriesmer[0m  7.1-6
  [1m[34mUpperBoundHamming[0m  7.1-2
  [1m[34mUpperBoundJohnson[0m  7.1-3
  [1m[34mUpperBoundMinimumDistance[0m  7.1-12
  [1m[34mUpperBoundPlotkin[0m  7.1-4
  [1m[34mUpperBoundSingleton[0m  7.1-1
  [1m[34mUUVCode[0m  6.2-2
  [1m[34mVandermondeMat[0m  7.3-5
  [1m[34mVectorCodeword[0m  3.4-1
  [1m[34mVerticalConversionFieldMat[0m  7.3-9
  weight enumerator polynomial  7.5
  [1m[34mWeightCodeword[0m  3.6-4
  [1m[34mWeightDistribution[0m  4.9-2
  [1m[34mWeightHistogram[0m  7.5-13
  [1m[34mWeightVecFFE[0m  2.1-5
  [1m[34mWholeSpaceCode[0m  5.5-10
  [1m[34mWordLength[0m  4.8-1
  
  
  -------------------------------------------------------
