Key | Value |
---|---|
FileName | ./usr/share/gap/pkg/guava/tst/hadamard.tst |
FileSize | 1387 |
MD5 | 9B3A4779E103DC07160DF765A514ED0F |
SHA-1 | 00090F8B0EEC7B0BA03A4B08962728ABBB62A9F5 |
SHA-256 | CA51227C3DA1663D0D3850ABA8249B7BBCFF4736993FDCF3F64B441D2E984246 |
SSDEEP | 12:4cPJ/pWE7N2IP8nfLJnfLZnfLRnfL1nfLdfLVnfLdfLJnfL5nfLJnfLhnfLhnfLV:XP9pWEgn9t1h5B59N9ll15V |
TLSH | T1B0219D5D35B1B770B64250A58DDE181D0055BEA43E674FCD241D41372AF8313ACEEB66 |
tar:gname | root |
tar:uname | root |
hashlookup:parent-total | 26 |
hashlookup:trust | 100 |
The searched file hash is included in 26 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 |
---|---|
FileSize | 1402388 |
MD5 | E1C4859FBAC340F55F23DA003229B17C |
PackageDescription | coding 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. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | gap-guava |
PackageSection | math |
PackageVersion | 3.15+ds-1 |
SHA-1 | 1041CF361C990EF9B60ADFF770B4C38FF398440B |
SHA-256 | 6E9766CFC7804513672F0756C63200B5D81335B6FC943D76B80B59F2B28D82A9 |
Key | Value |
---|---|
FileSize | 1410444 |
MD5 | 3C18BFE97FD6AF72B8C039102D75BFDE |
PackageDescription | coding 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. |
PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
PackageName | gap-guava |
PackageSection | math |
PackageVersion | 3.15+ds-3 |
SHA-1 | 246A9E6ABC063681A1D93172F8E0850B4A04DF6C |
SHA-256 | 29E58AD3B2108C55113E953B2558FA3A3052D6329E1A739A88CE0CD5BCB91AFD |
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 | 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 |
---|---|
FileSize | 1402464 |
MD5 | B9FB011AD88612E1870DB5E00C2C244B |
PackageDescription | coding 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. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | gap-guava |
PackageSection | math |
PackageVersion | 3.14+ds-2 |
SHA-1 | 4AFD6C4539337B401D34DB5BF35BFE4E53DF7568 |
SHA-256 | 11C953717E93956E75787500409B74FEB4A30D9F7A21B0B15641012407E73436 |
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 | BB9BD0D08FF02C40D53DB9E5151C67AC |
PackageArch | x86_64 |
PackageDescription | GUAVA 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. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | gap-guava |
PackageRelease | lp150.1.2 |
PackageVersion | 3.13 |
SHA-1 | 542A2A517049224011424AC33D04CDB68A62270B |
SHA-256 | 13C555DC5F89DC67600FA5DFE97B6ED86CDCB815E5FE06F8B5D1FE4F5D953054 |
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 | EC9D97D214CC688648C29F808475BD96 |
PackageArch | x86_64 |
PackageDescription | GUAVA 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. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | gap-guava |
PackageRelease | bp153.1.14 |
PackageVersion | 3.13 |
SHA-1 | 6D860B041DA8AACF6EE65564065B5093130E429D |
SHA-256 | 24BA9C7DE734AA7FC1DF3B64D28A855ED5449A3BBCE896A70AB6AA2B719964B5 |