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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q126998645, #quickstatements; #temporary_batch_1723807531120
 
(10 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SMT-LIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FFTW / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Maple / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MathCheck / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Lynx / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: nsoks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2966446838 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.11981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building Bridges between Symbolic Computation and Satisfiability Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Complex Golay Pairs via Programmatic SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex Golay sequences: Structure and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Golay sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for the Construction ofGolay Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-dimensional approach to the construction and enumeration of Golay complementary sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient Inaccuracy in Transversal Filtering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quaternary Golay sequence pairs. I: Even length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighing matrices and string sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadriphase sequences for spread- spectrum multiple-access communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Golay Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical study of branching heuristics through the lens of global learning rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiphase Complementary Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining SAT solvers with computer algebra systems to verify combinatorial conjectures / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126998645 / rank
 
Normal rank

Latest revision as of 12:41, 16 August 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
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references