Classification of base sequences \(\text{BS}(n+1,n)\) (Q606431): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58651222 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1002.1414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Base and Turyn Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Composition of Four-Symbol δ-Codes and Hadamard Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence classes and representatives of Golay sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: CLASSIFICATION OF NEAR-NORMAL SEQUENCES / rank
 
Normal rank

Latest revision as of 11:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Classification of base sequences \(\text{BS}(n+1,n)\)
scientific article

    Statements

    Classification of base sequences \(\text{BS}(n+1,n)\) (English)
    0 references
    17 November 2010
    0 references
    Summary: Base sequences \(\text{BS}(n+1,n)\) are quadruples of \({\pm 1}\)-sequences \((A;B;C;D)\), with A and B of length \(n+1\) and C and D of length n, such that the sum of their nonperiodic autocor-relation functions is a \(\delta \)-function. The base sequence conjecture, asserting that BS\((n+1,n)\) exist for all n, is stronger than the famous Hadamard matrix conjecture. We introduce a new definition of equivalence for base sequences BS\((n+1,n)\) and construct a canonical form. By using this canonical form, we have enumerated the equivalence classes of \(\text{BS}(n+1,n)\) for \(n\leq 30\). As the number of equivalence classes grows rapidly (but not monotonically) with n, the tables in the paper cover only the cases \(n\leq 13\). [There is an erratum: ibid. 2010, Article ID 842636 (2010; Zbl 1238.05040).]
    0 references

    Identifiers