Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (Q2200304): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: nsoks / rank | |||
Normal rank | |||
Revision as of 23:12, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT |
scientific article |
Statements
Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (English)
0 references
19 September 2020
0 references
complex Golay pairs
0 references
Boolean satisfiability
0 references
SAT solvers
0 references
exhaustive search
0 references
autocorrelation
0 references
