Balanced de Bruijn Sequences

The de Bruijn graph and its sequences have found many diverse applications in information theory as well as other areas of computer science and engineering such as interconnection networks, VLSI decomposition, and most recently in DNA storage. Binary balanced sequences have also been a subject to a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2021 IEEE International Symposium on Information Theory (ISIT) S. 1528 - 1533
Hauptverfasser: Marcovich, Sagi, Etzion, Tuvi, Yaakobi, Eitan
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 12.07.2021
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The de Bruijn graph and its sequences have found many diverse applications in information theory as well as other areas of computer science and engineering such as interconnection networks, VLSI decomposition, and most recently in DNA storage. Binary balanced sequences have also been a subject to a large research during the last forty years with various applications and a lot of interest in information theory. There have been some works on classification of balanced sequences mainly based on their spectral-null order. This work generalizes the concept of de Bruijn sequences, based on the de Bruijn graph of order \ell , where each edge is multiplied to a fixed number of multiple edges. This implies that in the sequences derived from the generalized graph each l-tuple has the same multiplicity. Using this generalization we form an interesting hierarchy between balanced sequences. Furthermore, another hierarchy is given by the derivatives of balanced sequences. Enumeration for each such family of sequences and efficient encoding and decoding algorithms are also provided.
AbstractList The de Bruijn graph and its sequences have found many diverse applications in information theory as well as other areas of computer science and engineering such as interconnection networks, VLSI decomposition, and most recently in DNA storage. Binary balanced sequences have also been a subject to a large research during the last forty years with various applications and a lot of interest in information theory. There have been some works on classification of balanced sequences mainly based on their spectral-null order. This work generalizes the concept of de Bruijn sequences, based on the de Bruijn graph of order \ell , where each edge is multiplied to a fixed number of multiple edges. This implies that in the sequences derived from the generalized graph each l-tuple has the same multiplicity. Using this generalization we form an interesting hierarchy between balanced sequences. Furthermore, another hierarchy is given by the derivatives of balanced sequences. Enumeration for each such family of sequences and efficient encoding and decoding algorithms are also provided.
Author Etzion, Tuvi
Yaakobi, Eitan
Marcovich, Sagi
Author_xml – sequence: 1
  givenname: Sagi
  surname: Marcovich
  fullname: Marcovich, Sagi
  email: sagimar@cs.technion.ac.il
  organization: Technion-Israel Institute of Technology,Dept. of Computer Science,Haifa,Israel,3200003
– sequence: 2
  givenname: Tuvi
  surname: Etzion
  fullname: Etzion, Tuvi
  email: etzion@cs.technion.ac.il
  organization: Technion-Israel Institute of Technology,Dept. of Computer Science,Haifa,Israel,3200003
– sequence: 3
  givenname: Eitan
  surname: Yaakobi
  fullname: Yaakobi, Eitan
  email: yaakobi@cs.technion.ac.il
  organization: Technion-Israel Institute of Technology,Dept. of Computer Science,Haifa,Israel,3200003
BookMark eNotjs1OwzAQhF0JDlD6BCCUF0jY9dre9ZFW_ESqxKHlXCX1WkpV0pLSA29PJHqZ-TSHT3NrrvpDr8Y8IlSIEJ_qVb12HtlVFixWcURhmphZZEFPEsRClBvzMG_2Tb_VVCQt5sO52_XFSr_POm6nO3Odm_1JZ5eems_Xl_XivVx-vNWL52XZWaCfUiixTzYpk2sjBAZrMfEYWbwPrmXJkgmZnTogr2GLtg2YwQUgTDQ19__eTlU3x6H7aobfzeUz_QFblThk
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ISIT45174.2021.9517873
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEL
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEL
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781538682098
1538682095
EndPage 1533
ExternalDocumentID 9517873
Genre orig-research
GrantInformation_xml – fundername: United States-Israel BSF
  grantid: 2018048
  funderid: 10.13039/501100001742
– fundername: ISF
  grantid: 222/19
  funderid: 10.13039/100012579
GroupedDBID 6IE
6IH
CBEJK
RIE
RIO
ID FETCH-LOGICAL-i203t-83d75d2de734b90670221d7221f85564b78f8f31774e4035e6c12b61f046031d3
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000701502201104&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Thu Jun 29 18:37:47 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-83d75d2de734b90670221d7221f85564b78f8f31774e4035e6c12b61f046031d3
PageCount 6
ParticipantIDs ieee_primary_9517873
PublicationCentury 2000
PublicationDate 2021-July-12
PublicationDateYYYYMMDD 2021-07-12
PublicationDate_xml – month: 07
  year: 2021
  text: 2021-July-12
  day: 12
PublicationDecade 2020
PublicationTitle 2021 IEEE International Symposium on Information Theory (ISIT)
PublicationTitleAbbrev ISIT
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.7986265
Snippet The de Bruijn graph and its sequences have found many diverse applications in information theory as well as other areas of computer science and engineering...
SourceID ieee
SourceType Publisher
StartPage 1528
SubjectTerms Computer science
Decoding
DNA
Encoding
Genetic communication
Multiprocessor interconnection
Very large scale integration
Title Balanced de Bruijn Sequences
URI https://ieeexplore.ieee.org/document/9517873
WOSCitedRecordID wos000701502201104&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB7a4sFT1VZ8VNmDR9PmucleFYsFKYVW6K2YZBbqYSt16-832d1WBC9eQgiBMJmEmcx8XwbgTqJCnrOMaO4pkbngxFpniTLBOXARa1MThV_0dGqWy2zWgvsDFwYRK_AZDmO3yuX7jdvFUNkoeAPhfIk2tLVOa65WQ_plNBtN5pOFjB8vh1cfZ8Nm8q-qKZXRGHf_t9wJ9H_Yd8nsYFdOoYXFGXT35ReS5jb2YPAQYYkOfeIxCTpavxfJfI-M7sPr-Gnx-EyaYgdkzakoiRFeK889aiFtFtkznDOvQ5MbpVJptclNHqy9liipUJg6xm3K8pjZFMyLc-gUmwIvIAlO2VtmaEq1p9JzagU65NJgcM8sc-oSelHY1Uf9n8WqkfPq7-FrOI77GeOZjA-gU253eANH7qtcf25vKyV8A7M4hh8
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFfRUtRUfVffg0W3z3GSviqWLtRRaobdiklmoh63U1t9vst1WBC9eQgiBMJmEmcx8XwbgTqBEltM0VsyRWOScxcZYE0vtnQMbsDYbovBADYd6Ok1HNbjfcWEQsQSfYSd0y1y-W9h1CJV1vTfgzxffg_1QOatia1W0X0rSbjbOJiJ8vezffYx2qum_6qaUZqPX-N-Cx9D64d9Fo51lOYEaFqfQ2BZgiKr72IT2QwAmWnSRw8hraf5eROMtNroFr72nyWM_rsodxHNG-CrW3CnpmEPFhUkDf4Yx6pRvci1lIozSuc69vVcCBeESE0uZSWgecpucOn4G9WJR4DlE3i17SzVJiHJEOEYMR4tMaPQOmqFWXkAzCDv72PxoMavkvPx7-BYO-5OXwWyQDZ-v4CjsbYhuUtaG-mq5xms4sF-r-efyplTIN-dtiWg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2021+IEEE+International+Symposium+on+Information+Theory+%28ISIT%29&rft.atitle=Balanced+de+Bruijn+Sequences&rft.au=Marcovich%2C+Sagi&rft.au=Etzion%2C+Tuvi&rft.au=Yaakobi%2C+Eitan&rft.date=2021-07-12&rft.pub=IEEE&rft.spage=1528&rft.epage=1533&rft_id=info:doi/10.1109%2FISIT45174.2021.9517873&rft.externalDocID=9517873