Parents (Total: 3)

The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
MD5	9F76C11CF1B58448F09C279269CF89B0
PackageArch	aarch64
PackageDescription	GUAVA is a package that implements coding theory algorithms in GAP. Codes can be created and manipulated and information about codes can be calculated. GUAVA consists of various files written in the GAP language, and an external program from J. S. Leon for dealing with automorphism groups of codes and isomorphism testing functions. Several algorithms that need the speed are integrated in the GAP kernel. The functions within GUAVA can be divided into four categories: - Construction of codes. GUAVA can construct non-linear, linear and cyclic codes over an arbitrary finite field. Examples are HadamardCode, ReedMullerCode, BestKnownLinearCode, QRCode and GoppaCode. - Manipulation of codes. These functions allow the user to transform one code into another or to construct a new code from two codes. Examples are PuncturedCode, DualCode, DirectProductCode and UUVCode. - Computation of information about codes. This information is stored in the code record. Examples are MinimumDistance, OuterDistribution, IsSelfDualCode and AutomorphismGroup. - Generation of bounds on linear codes. The table by Brouwer and Verhoeff (as it existed in the mid-1990s) is incorporated into GUAVA. For example, BoundsMinimumDistance.
PackageMaintainer	Fedora Project
PackageName	gap-pkg-guava
PackageRelease	5.fc33
PackageVersion	3.15
SHA-1	C74C6E00116D76A4B065EBE64742A6A78EC0C98B
SHA-256	79C22FD2C6C242F244FBEE81BED918DEB7EE58A2F01158CE190439A7A67DC5FE

Key	Value
MD5	ECD62F9F718B9F3BF0008479565FF2CD
PackageArch	aarch64
PackageDescription	GUAVA is a package that implements coding theory algorithms in GAP. Codes can be created and manipulated and information about codes can be calculated. GUAVA consists of various files written in the GAP language, and an external program from J. S. Leon for dealing with automorphism groups of codes and isomorphism testing functions. Several algorithms that need the speed are integrated in the GAP kernel. The functions within GUAVA can be divided into four categories: - Construction of codes. GUAVA can construct non-linear, linear and cyclic codes over an arbitrary finite field. Examples are HadamardCode, ReedMullerCode, BestKnownLinearCode, QRCode and GoppaCode. - Manipulation of codes. These functions allow the user to transform one code into another or to construct a new code from two codes. Examples are PuncturedCode, DualCode, DirectProductCode and UUVCode. - Computation of information about codes. This information is stored in the code record. Examples are MinimumDistance, OuterDistribution, IsSelfDualCode and AutomorphismGroup. - Generation of bounds on linear codes. The table by Brouwer and Verhoeff (as it existed in the mid-1990s) is incorporated into GUAVA. For example, BoundsMinimumDistance.
PackageMaintainer	Fedora Project
PackageName	gap-pkg-guava
PackageRelease	6.fc34
PackageVersion	3.15
SHA-1	AA98A562DFDFC015B98CDC84C3B24360B035721E
SHA-256	E466D68E3D7892D0371193A307CBB6DCA1BE28B718C783F465434E7B15DCA21E

Key	Value
MD5	FF9937955FD1BDD885AFD6FD891AFE05
PackageArch	aarch64
PackageDescription	GUAVA is a package that implements coding theory algorithms in GAP. Codes can be created and manipulated and information about codes can be calculated. GUAVA consists of various files written in the GAP language, and an external program from J. S. Leon for dealing with automorphism groups of codes and isomorphism testing functions. Several algorithms that need the speed are integrated in the GAP kernel. The functions within GUAVA can be divided into four categories: - Construction of codes. GUAVA can construct non-linear, linear and cyclic codes over an arbitrary finite field. Examples are HadamardCode, ReedMullerCode, BestKnownLinearCode, QRCode and GoppaCode. - Manipulation of codes. These functions allow the user to transform one code into another or to construct a new code from two codes. Examples are PuncturedCode, DualCode, DirectProductCode and UUVCode. - Computation of information about codes. This information is stored in the code record. Examples are MinimumDistance, OuterDistribution, IsSelfDualCode and AutomorphismGroup. - Generation of bounds on linear codes. The table by Brouwer and Verhoeff (as it existed in the mid-1990s) is incorporated into GUAVA. For example, BoundsMinimumDistance.
PackageMaintainer	Fedora Project
PackageName	gap-pkg-guava
PackageRelease	3.fc32
PackageVersion	3.15
SHA-1	ECB5F0E0C71DCFBF1C5BFA8E52F59F7DA174C2EF
SHA-256	AE9405BFB8E2F287E3E443B5584B24BBEEDAE9CC1E9FC36B3646EDB672F4AAAB