Construction of infinite de Bruijn arrays
From MaRDI portal
Publication:1114658
DOI10.1016/0166-218X(88)90101-1zbMATH Open0662.94011OpenAlexW2046487067MaRDI QIDQ1114658FDOQ1114658
Authors: Antal Iványi
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(88)90101-1
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on binary arrays with a certain window property (Corresp.)
- Title not available (Why is that?)
- Constructions for perfect maps and pseudorandom arrays
- An algorithm for constructing m-ary de Bruijn sequences
- Notes on de Bruijn sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- De Bruijn arrays for L-fillings
- Toroidal tilings from de Bruijn-Good cyclic sequences
- New constructions for De Bruijn tori
- Title not available (Why is that?)
- Universal cycles for combinatorial structures
- A note on binary arrays with a certain window property (Corresp.)
- On effective computation of expectations in large or infinite dimension
- Title not available (Why is that?)
- On a construction of easily decodable sub-de Bruijn arrays
- Title not available (Why is that?)
This page was built for publication: Construction of infinite de Bruijn arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114658)