Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (Q2200304)

From MaRDI portal
Revision as of 03:11, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    19 September 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complex Golay pairs
    0 references
    Boolean satisfiability
    0 references
    SAT solvers
    0 references
    exhaustive search
    0 references
    autocorrelation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references