Calhoun
metadata only
Double Eulerian cycles on de Bruijn digraphs
A binary de Bruijn sequence has the property that every n-tuple is distinct on a given period of length 2". An efficient algorithm to generate a class of classical de Bruijn sequences is given based upon the distance between cycles within the Good - de Bruijn digraph. The de Bruijn property on binar
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A simple classification of the special matchings in the symmetric group#1357302
- New Quaternary codes with small Plotkin-defects from two-generator simplicial complexes#1248443
- A run-length-compressed skiplist data structure for dynamic GBWTs supports time and space efficient pangenome operations over syncmers#1252739
- Linear complementary dual quasi-cyclic codes of index 2#1355893
- A hybrid blowfish-based cryptography and chaotic quantization steganography framework with genetic key generation.#258333
Record · ID 1361677
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive