Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

De Bruijn sequences with efficient decoding algorithms

From MaRDI portal
Publication:1841913
Jump to:navigation, search

DOI10.1016/S0012-365X(00)00117-5zbMath1017.94010WikidataQ56706383 ScholiaQ56706383MaRDI QIDQ1841913

Jonathan Tuliani

Publication date: 28 August 2003

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

decodingde Bruijn sequenceshybrid constructionposition sensing


Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)


Related Items (3)

Computing generalized de Bruijn sequences ⋮ On a Construction of Easily Decodable Sub-de Bruijn Arrays ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence







This page was built for publication: De Bruijn sequences with efficient decoding algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1841913&oldid=14217676"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki