Parents (Total: 9)

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

Key	Value
MD5	46A7CE3E027BF8A46941DF02EAACE299
PackageArch	armv7hl
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	0A6636D9EEAB27EA74885F1288F9A915C6049FFD
SHA-256	7C34439F76F18EEDAEB1A1104AE931174B1D1973E7AD44DD238A643E95BBE9BC

Key	Value
MD5	1968D38BBCBFAFA25A50F45056589839
PackageArch	x86_64
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	9CAFD7849F6E486495A02221D478482BE22DC751
SHA-256	F6C7037BD562218D66E28F87E21AD9C5E57847FCC56D7B30CE947714E5FDECD9

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	D4A9F6B042763CF01874D75BCE659A36
PackageArch	x86_64
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	3064C3DBF1CE9148C9F1D15CB37C7716860B0E5C
SHA-256	96B27CC87BCD7AAF6C62CBA89A043F107C27F7B2AC273B0287C21ED5ACB3B06F

Key	Value
MD5	97545A6052C1CCF86C76B37E6F9D293C
PackageArch	armv7hl
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	25165D3F66C094BAFBCD8A5C0F9BBE09B108D485
SHA-256	49000B0FDAB3C9A010DD0B8BE4170F9BE5F232543D29D34694A798A58065E6DB

Key	Value
MD5	0BACA280CC9F250DABA39EE28180CFE5
PackageArch	armv7hl
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	629F329EF9E635E46622D5744C45B3A2FA00AF91
SHA-256	EE825F5EC5A6E25AD923B7C097C169578005C5F2CB40B0EB1DC5EA8662C80DA6

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	09C2543DFEF3D0E1E12AFCECF8FA5057
PackageArch	x86_64
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	5213D508BDE4A05C8F142E0107B01F793F93ABD4
SHA-256	5F50BAD38531571D63264E6CAC8E26535D4B8BD6438DF40C88CE8C47DB788E94

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