Result for 17C12F4A10FFC17D8863B02BB2B7FC7D75E23D35

Query result

Key Value
FileName./usr/share/gap/pkg/guava/lib/codemisc.gi
FileSize24929
MD5C8DF5A4E9D7FB450FCA5E2C726A5AE98
SHA-117C12F4A10FFC17D8863B02BB2B7FC7D75E23D35
SHA-256BFE81D122C45EE6774239D7D246210819D0FCA71652B51679D3A742ED1B217E6
SSDEEP384:LasTJbuzHozS/w8TAYRGrA7IejYtbnz8CKzOzWaiFm8w4dNwG02dLzD3skV1hMcl:LasMo+DTAYrjybYCVinw4dh02d3fVu+v
TLSHT11CB2924A5583267CA3A381B98BC77444671D60238E83D82C7B9FD2943F92E34D3B678D
tar:gnameroot
tar:unameroot
hashlookup:parent-total25
hashlookup:trust100

Network graph view

Parents (Total: 25)

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

Key Value
MD546A7CE3E027BF8A46941DF02EAACE299
PackageArcharmv7hl
PackageDescriptionGUAVA 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.
PackageMaintainerFedora Project
PackageNamegap-pkg-guava
PackageRelease6.fc34
PackageVersion3.15
SHA-10A6636D9EEAB27EA74885F1288F9A915C6049FFD
SHA-2567C34439F76F18EEDAEB1A1104AE931174B1D1973E7AD44DD238A643E95BBE9BC
Key Value
FileSize1402388
MD5E1C4859FBAC340F55F23DA003229B17C
PackageDescriptioncoding theory library for GAP GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas. . This GAP package brings to GAP computing with error-correcting codes.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamegap-guava
PackageSectionmath
PackageVersion3.15+ds-1
SHA-11041CF361C990EF9B60ADFF770B4C38FF398440B
SHA-2566E9766CFC7804513672F0756C63200B5D81335B6FC943D76B80B59F2B28D82A9
Key Value
FileSize1410444
MD53C18BFE97FD6AF72B8C039102D75BFDE
PackageDescriptioncoding theory library for GAP GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas. . This GAP package brings to GAP computing with error-correcting codes.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net>
PackageNamegap-guava
PackageSectionmath
PackageVersion3.15+ds-3
SHA-1246A9E6ABC063681A1D93172F8E0850B4A04DF6C
SHA-25629E58AD3B2108C55113E953B2558FA3A3052D6329E1A739A88CE0CD5BCB91AFD
Key Value
MD597545A6052C1CCF86C76B37E6F9D293C
PackageArcharmv7hl
PackageDescriptionGUAVA 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.
PackageMaintainerFedora Project
PackageNamegap-pkg-guava
PackageRelease3.fc32
PackageVersion3.15
SHA-125165D3F66C094BAFBCD8A5C0F9BBE09B108D485
SHA-25649000B0FDAB3C9A010DD0B8BE4170F9BE5F232543D29D34694A798A58065E6DB
Key Value
MD5D4A9F6B042763CF01874D75BCE659A36
PackageArchx86_64
PackageDescriptionGUAVA 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.
PackageMaintainerFedora Project
PackageNamegap-pkg-guava
PackageRelease5.fc33
PackageVersion3.15
SHA-13064C3DBF1CE9148C9F1D15CB37C7716860B0E5C
SHA-25696B27CC87BCD7AAF6C62CBA89A043F107C27F7B2AC273B0287C21ED5ACB3B06F
Key Value
FileSize1402464
MD5B9FB011AD88612E1870DB5E00C2C244B
PackageDescriptioncoding theory library for GAP GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas. . This GAP package brings to GAP computing with error-correcting codes.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamegap-guava
PackageSectionmath
PackageVersion3.14+ds-2
SHA-14AFD6C4539337B401D34DB5BF35BFE4E53DF7568
SHA-25611C953717E93956E75787500409B74FEB4A30D9F7A21B0B15641012407E73436
Key Value
MD509C2543DFEF3D0E1E12AFCECF8FA5057
PackageArchx86_64
PackageDescriptionGUAVA 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.
PackageMaintainerFedora Project
PackageNamegap-pkg-guava
PackageRelease3.fc32
PackageVersion3.15
SHA-15213D508BDE4A05C8F142E0107B01F793F93ABD4
SHA-2565F50BAD38531571D63264E6CAC8E26535D4B8BD6438DF40C88CE8C47DB788E94
Key Value
MD5BB9BD0D08FF02C40D53DB9E5151C67AC
PackageArchx86_64
PackageDescriptionGUAVA is a package that implements coding theory algorithms in GAP. With GUAVA, 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 for dealing with automorphism groups of codes and isomorphism testing functions. Several algorithms that need the speed are integrated in the GAP kernel.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamegap-guava
PackageReleaselp150.1.2
PackageVersion3.13
SHA-1542A2A517049224011424AC33D04CDB68A62270B
SHA-25613C555DC5F89DC67600FA5DFE97B6ED86CDCB815E5FE06F8B5D1FE4F5D953054
Key Value
MD50BACA280CC9F250DABA39EE28180CFE5
PackageArcharmv7hl
PackageDescriptionGUAVA 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.
PackageMaintainerFedora Project
PackageNamegap-pkg-guava
PackageRelease5.fc33
PackageVersion3.15
SHA-1629F329EF9E635E46622D5744C45B3A2FA00AF91
SHA-256EE825F5EC5A6E25AD923B7C097C169578005C5F2CB40B0EB1DC5EA8662C80DA6
Key Value
MD5EC9D97D214CC688648C29F808475BD96
PackageArchx86_64
PackageDescriptionGUAVA is a package that implements coding theory algorithms in GAP. With GUAVA, 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 for dealing with automorphism groups of codes and isomorphism testing functions. Several algorithms that need the speed are integrated in the GAP kernel.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamegap-guava
PackageReleasebp153.1.14
PackageVersion3.13
SHA-16D860B041DA8AACF6EE65564065B5093130E429D
SHA-25624BA9C7DE734AA7FC1DF3B64D28A855ED5449A3BBCE896A70AB6AA2B719964B5