Goto Chapter: | Top | 1 | 2 | 3 | 4 | 5 | 6 | 7 | Bib | Ind

### Index

< > 2.2-1
< > 3.1-1
`*` 3.2-2
`*` 3.2-3
`+` 2.3-1
`+` 2.3-3
`+` 3.2-1
`-` 2.3-2
`=` 2.2-1
`=` 3.1-1
A(n,d) 7.1-6
acceptable coordinate 7.4-2
acceptable coordinate 7.4-3
`AClosestVectorComb..MatFFEVecFFECoords` 4.1-2
`AClosestVectorCombinationsMatFFEVecFFE` 4.1-1
`AddedElementsCode` 6.1-8
affine code 7.5-4
`AffinePointsOnCurve` 5.6-4
`AlternantCode` 5.2-6
`AmalgamatedDirectSumCode` 6.2-7
`AreMOLS` 7.3-13
`AsSSortedList` 3.5-5
`AugmentedCode` 6.1-6
`AutomorphismGroup` 3.4-3
`BCHCode` 5.5-4
`BestKnownLinearCode` 5.2-13
`BinaryGolayCode` 5.4-1
`BlockwiseDirectSumCode` 6.2-8
Bose distance 5.5-4
bound, Gilbert-Varshamov lower 7.1-8
bound, sphere packing lower 7.1-9
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
`BoundsCoveringRadius` 7.2-1
`BoundsMinimumDistance` 7.1-12
check polynomial 3.
check polynomial 5.5
`CheckMat` 3.7-2
`CheckMatCode` 5.2-3
`CheckPol` 3.7-4
`CheckPolCode` 5.5-2
code 3.
code, (n,M,d) 3.
code, [n, k, d]r 3.
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 3.
code, Davydov 5.3-2
code, element test 3.3-1
code, elements of 3.
code, evaluation 5.6
code, Fire 5.5-6
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 3.
code, maximum distance separable 3.3-7
code, Nordstrom-Robinson 5.1-5
code, perfect 3.3-6
code, Reed-Muller 5.2-4
code, Reed-Solomon 5.5-4
code, self-dual 3.3-8
code, self-orthogonal 3.3-9
code, Srivastava 5.2-7
code, subcode 3.3-2
code, Tombak 5.3-3
code, toric 5.6-6
code, unrestricted 3.
`CodeDensity` 7.5-8
`CodeDistanceEnumerator` 7.5-2
`CodeIsomorphism` 3.4-2
`CodeMacWilliamsTransform` 7.5-3
`CodeNorm` 7.4-2
codes, addition 3.2-1
codes, decoding 3.2-4
codes, direct sum 3.2-1
codes, encoding 3.2-3
codes, product 3.2-2
`CodeWeightEnumerator` 7.5-1
`Codeword` 2.1-1
`CodewordNr` 2.1-2
codewords, addition 2.3-1
codewords, cosets 2.3-3
codewords, subtraction 2.3-2
`CoefficientToPolynomial` 7.5-15
conference matrix 5.1-3
`ConferenceCode` 5.1-3
`ConstantWeightSubcode` 6.1-16
`ConstructionBCode` 6.1-12
`ConversionFieldCode` 6.1-14
`CoordinateNorm` 7.4-1
`CordaroWagnerCode` 5.2-10
coset 2.3-3
`CosetCode` 6.1-15
covering code 3.8-6
`CoveringRadius` 3.8-7
`CyclicCodes` 5.5-11
`CyclotomicCosets` 7.5-13
`DavydovCode` 5.3-3
`Decode` 3.10-1
`Decodeword` 3.10-2
`DecreaseMinimumDistanceUpperBound` 3.8-5
`DegreesMonomialTerm` 7.5-16
density of a code 7.5-7
`Dimension` 3.5-4
`DirectProductCode` 6.2-3
`DirectSumCode` 6.2-1
`Display` 3.6-3
distance 3.9-2
`DistanceCodeword` 2.6-2
`DistancesDistribution` 3.9-3
`DistancesDistributionMatFFEVecFFE` 4.1-3
`DistancesDistributionVecFFEsVecFFE` 4.1-4
`DistanceVecFFE` 4.2-2
`DivisorsMultivariatePolynomial` 7.5-17
`DualCode` 6.1-13
`ElementsCode` 5.1-1
encoder map 3.2-3
`EnlargedGabidulinCode` 5.3-2
`EnlargedTombakCode` 5.3-5
equivalent codes 3.4
`EvaluationCode` 5.6-1
`EvenWeightSubcode` 6.1-3
`ExhaustiveSearchCoveringRadius` 7.2-3
`ExpurgatedCode` 6.1-5
`ExtendedBinaryGolayCode` 5.4-2
`ExtendedCode` 6.1-1
`ExtendedDirectSumCode` 6.2-6
`ExtendedTernaryGolayCode` 5.4-4
external distance 7.2-13
`FireCode` 5.5-7
`GabidulinCode` 5.3-1
Gary code 7.3-1
`GeneralizedCodeNorm` 7.4-4
`GeneralizedReedMullerCode` 5.6-3
`GeneralizedReedSolomonCode` 5.6-2
`GeneralizedReedSolomonDecoderGao` 3.10-3
`GeneralizedReedSolomonListDecoder` 3.10-4
`GeneralizedSrivastavaCode` 5.2-8
`GeneralLowerBoundCoveringRadius` 7.2-4
`GeneralUpperBoundCoveringRadius` 7.2-5
generator polynomial 3.
generator polynomial 5.5
`GeneratorMat` 3.7-1
`GeneratorMatCode` 5.2-1
`GeneratorMatCodeNC` 5.2-2
`GeneratorPol` 3.7-3
`GeneratorPolCode` 5.5-1
`GoppaCode` 5.2-7
`GrayMat` 7.3-2
`GreedyCode` 5.1-7
Griesmer code 7.5-6
Hadamard matrix 5.1-2
Hadamard matrix 7.3-3
`HadamardCode` 5.1-2
`HadamardMat` 7.3-4
Hamming metric 4.2-1
`HammingCode` 5.2-4
`HorizontalConversionFieldMat` 7.3-10
hull 6.2-4
`in` 3.3-1
`IncreaseCoveringRadiusLowerBound` 7.2-2
information bits 3.2-4
`InformationWord` 3.2-4
`InnerDistribution` 3.9-2
`IntersectionCode` 6.2-4
`IsAffineCode` 7.5-5
`IsAlmostAffineCode` 7.5-6
`IsCode` 3.3-3
`IsCodeword` 2.1-3
`IsCoordinateAcceptable` 7.4-3
`IsCyclicCode` 3.3-5
`IsEquivalent` 3.4-1
`IsFinite` 3.5-1
`IsGriesmerCode` 7.5-7
`IsInStandardForm` 7.3-7
`IsLatinSquare` 7.3-12
`IsLinearCode` 3.3-4
`IsMDSCode` 3.3-7
`IsNormalCode` 7.4-5
`IsPerfectCode` 3.3-6
`IsSelfComplementaryCode` 7.5-4
`IsSelfDualCode` 3.3-8
`IsSelfOrthogonalCode` 3.3-9
`IsSubset` 3.3-2
`Krawtchouk` 7.5-10
`KrawtchoukMat` 7.3-1
Latin square 7.3-10
`LeftActingDomain` 3.5-3
length 3.
`LengthenedCode` 6.1-10
`LexiCode` 5.1-8
linear code 2.
`LowerBoundCoveringRadiusCountingExcess` 7.2-9
`LowerBoundCoveringRadiusEmbedded1` 7.2-10
`LowerBoundCoveringRadiusEmbedded2` 7.2-11
`LowerBoundCoveringRadiusInduction` 7.2-12
`LowerBoundCoveringRadiusSphereCovering` 7.2-6
`LowerBoundCoveringRadiusVanWee1` 7.2-7
`LowerBoundCoveringRadiusVanWee2` 7.2-8
`LowerBoundGilbertVarshamov` 7.1-9
`LowerBoundMinimumDistance` 7.1-8
`LowerBoundSpherePacking` 7.1-10
MacWilliams transform 7.5-2
maximum distance separable 7.1-1
MDS 3.3-7
minimum distance 3.
`MinimumDistance` 3.8-3
`MinimumDistanceLeon` 3.8-4
`MinimumDistanceRandom` 3.8-6
`MOLS` 7.3-11
`MOLSCode` 5.1-4
mutually orthogonal Latin squares 7.3-10
`NearestNeighborDecodewords` 3.10-6
`NearestNeighborGRSDecodewords` 3.10-5
`NordstromRobinsonCode` 5.1-6
norm of a code 7.4-1
normal code 7.4-4
not = 2.2-1
not = 3.1-1
`NrCyclicCodes` 5.5-12
`NullCode` 5.5-9
`NullWord` 2.6-1
`OnePointAGCode` 5.6-5
`OptimalityCode` 5.2-12
order of polynomial 5.5-7
`OuterDistribution` 3.9-4
Parity check 6.1
parity check matrix 3.
perfect 7.1-1
perfect 7.5-8
permutation equivalent codes 3.4
`PermutationAutomorphismGroup` 3.4-4
`PermutationDecode` 3.10-10
PermutationGroup 3.4-3
`PermutedCode` 6.1-4
`PermutedCols` 7.3-8
`PiecewiseConstantCode` 6.1-18
`PolyCodeword` 2.4-2
`PrimitiveUnityRoot` 7.5-11
`Print` 3.6-1
`PuncturedCode` 6.1-2
`PutStandardForm` 7.3-6
`QRCode` 5.5-6
`RandomCode` 5.1-5
`RandomLinearCode` 5.2-11
reciprocal polynomial 7.5-11
`ReciprocalPolynomial` 7.5-12
`Redundancy` 3.8-2
`ReedMullerCode` 5.2-5
`ReedSolomonCode` 5.5-5
`RemovedElementsCode` 6.1-7
`RepetitionCode` 5.5-10
`ResidueCode` 6.1-11
`RootsCode` 5.5-3
`RootsOfCode` 3.7-5
self-dual 6.1-13
self-orthogonal 3.3-8
`SetCoveringRadius` 3.8-8
`ShortenedCode` 6.1-9
size 3.
`Size` 3.5-2
`SphereContent` 7.5-9
`SrivastavaCode` 5.2-9
standard form 7.3-5
`StandardArray` 3.10-9
`StandardFormCode` 6.1-17
strength 7.2-15
`String` 3.6-2
`Support` 2.6-3
`SylvesterMat` 7.3-3
`Syndrome` 3.10-7
syndrome table 3.10-8
`SyndromeTable` 3.10-8
t(n,k) 3.8-6
`TernaryGolayCode` 5.4-3
`TombakCode` 5.3-4
`ToricCode` 5.6-7
`ToricPoints` 5.6-6
`TreatAsPoly` 2.5-2
`TreatAsVector` 2.5-1
`UnionCode` 6.2-5
`UpperBound` 7.1-7
`UpperBoundCoveringRadiusCyclicCode` 7.2-17
`UpperBoundCoveringRadiusDelsarte` 7.2-14
`UpperBoundCoveringRadiusGriesmerLike` 7.2-16
`UpperBoundCoveringRadiusRedundancy` 7.2-13
`UpperBoundCoveringRadiusStrength` 7.2-15
`UpperBoundElias` 7.1-5
`UpperBoundGriesmer` 7.1-6
`UpperBoundHamming` 7.1-2
`UpperBoundJohnson` 7.1-3
`UpperBoundMinimumDistance` 7.1-11
`UpperBoundPlotkin` 7.1-4
`UpperBoundSingleton` 7.1-1
`UUVCode` 6.2-2
`VandermondeMat` 7.3-5
`VectorCodeword` 2.4-1
`VerticalConversionFieldMat` 7.3-9
ViewObj 5.2-1
weight enumerator polynomial 7.5
`WeightCodeword` 2.6-4
`WeightDistribution` 3.9-1
`WeightHistogram` 7.5-14
`WeightVecFFE` 4.2-1
`WholeSpaceCode` 5.5-8
`WordLength` 3.8-1

Top of Book | Previous Chapter

Goto Chapter: | Top | 1 | 2 | 3 | 4 | 5 | 6 | 7 | Bib | Ind

generated by GAPDoc2HTML