Matches in SemOpenAlex for { <https://semopenalex.org/work/W2007142772> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2007142772 endingPage "850" @default.
- W2007142772 startingPage "843" @default.
- W2007142772 abstract "This paper is concerned with the construction of de Bruijn sequences of span <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</tex> --binary sequences of period <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2^{n}</tex> in which every binary <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</tex> -tuple appears as some <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</tex> consecutive terms in one period of the sequence. Constructions in the literature are based on maximum length linear sequences, algorithms which start from scratch, and recursive methods which start with a single de Bruijn sequence of span <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</tex> and produce one of span <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n+1</tex> . We give a more general recursive construction which takes two de Brnijn sequences of span <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</tex> and produces a de Bruijn sequence of span <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n+1</tex> . In addition, for a special case of the construction, the complexity (shortest linear recursion that generates the sequence) of the resulting sequence is determined in terms of the complexities of the ingredient sequences. In particular, de Bruijn sequences of span <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n+1</tex> with maximum complexity <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2^{(n+1)}-1</tex> are obtained from maximum complexity sequences of span <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</tex> . Reverse-complementary de Bruijn sequences are also considered." @default.
- W2007142772 created "2016-06-24" @default.
- W2007142772 creator A5001573568 @default.
- W2007142772 date "1983-11-01" @default.
- W2007142772 modified "2023-10-18" @default.
- W2007142772 title "A generalized recursive construction for de Bruijn sequences" @default.
- W2007142772 cites W2007453203 @default.
- W2007142772 cites W2018168377 @default.
- W2007142772 cites W2018332397 @default.
- W2007142772 cites W2026523378 @default.
- W2007142772 cites W2031881875 @default.
- W2007142772 cites W2035511639 @default.
- W2007142772 cites W2041749201 @default.
- W2007142772 cites W2059514976 @default.
- W2007142772 cites W2093684372 @default.
- W2007142772 cites W2540770813 @default.
- W2007142772 doi "https://doi.org/10.1109/tit.1983.1056764" @default.
- W2007142772 hasPublicationYear "1983" @default.
- W2007142772 type Work @default.
- W2007142772 sameAs 2007142772 @default.
- W2007142772 citedByCount "26" @default.
- W2007142772 countsByYear W20071427722012 @default.
- W2007142772 countsByYear W20071427722013 @default.
- W2007142772 countsByYear W20071427722014 @default.
- W2007142772 countsByYear W20071427722015 @default.
- W2007142772 countsByYear W20071427722016 @default.
- W2007142772 countsByYear W20071427722018 @default.
- W2007142772 countsByYear W20071427722019 @default.
- W2007142772 countsByYear W20071427722021 @default.
- W2007142772 countsByYear W20071427722023 @default.
- W2007142772 crossrefType "journal-article" @default.
- W2007142772 hasAuthorship W2007142772A5001573568 @default.
- W2007142772 hasConcept C114614502 @default.
- W2007142772 hasConcept C118615104 @default.
- W2007142772 hasConcept C118930307 @default.
- W2007142772 hasConcept C154945302 @default.
- W2007142772 hasConcept C170320093 @default.
- W2007142772 hasConcept C20218877 @default.
- W2007142772 hasConcept C2778112365 @default.
- W2007142772 hasConcept C33923547 @default.
- W2007142772 hasConcept C41008148 @default.
- W2007142772 hasConcept C54355233 @default.
- W2007142772 hasConcept C86803240 @default.
- W2007142772 hasConceptScore W2007142772C114614502 @default.
- W2007142772 hasConceptScore W2007142772C118615104 @default.
- W2007142772 hasConceptScore W2007142772C118930307 @default.
- W2007142772 hasConceptScore W2007142772C154945302 @default.
- W2007142772 hasConceptScore W2007142772C170320093 @default.
- W2007142772 hasConceptScore W2007142772C20218877 @default.
- W2007142772 hasConceptScore W2007142772C2778112365 @default.
- W2007142772 hasConceptScore W2007142772C33923547 @default.
- W2007142772 hasConceptScore W2007142772C41008148 @default.
- W2007142772 hasConceptScore W2007142772C54355233 @default.
- W2007142772 hasConceptScore W2007142772C86803240 @default.
- W2007142772 hasIssue "6" @default.
- W2007142772 hasLocation W20071427721 @default.
- W2007142772 hasOpenAccess W2007142772 @default.
- W2007142772 hasPrimaryLocation W20071427721 @default.
- W2007142772 hasRelatedWork W1908987670 @default.
- W2007142772 hasRelatedWork W2025111520 @default.
- W2007142772 hasRelatedWork W2354744388 @default.
- W2007142772 hasRelatedWork W2735897904 @default.
- W2007142772 hasRelatedWork W2756186577 @default.
- W2007142772 hasRelatedWork W2949121831 @default.
- W2007142772 hasRelatedWork W3021341025 @default.
- W2007142772 hasRelatedWork W3087469195 @default.
- W2007142772 hasRelatedWork W3125399386 @default.
- W2007142772 hasRelatedWork W3215786367 @default.
- W2007142772 hasVolume "29" @default.
- W2007142772 isParatext "false" @default.
- W2007142772 isRetracted "false" @default.
- W2007142772 magId "2007142772" @default.
- W2007142772 workType "article" @default.