Cover Image

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gabric, Daniel, Imam, Wazed, Jones, Lukas Janik, Sawada, Joe
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)

Construction of orientable sequences in $O(1)$-amortized time per bit
by: Gabric, Daniel, et al.
Published: (2024)

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
by: Sawada, J., et al.
Published: (2023)

Asymptotic bounds for the number of closed and privileged words
by: Gabric, Daniel
Published: (2022)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
by: Liang, Xue-Bin
Published: (2024)

On de Bruijn Rings and Families of Almost Perfect Maps
by: Stelldinger, Peer
Published: (2024)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
by: Mizunuma, Yuto, et al.
Published: (2026)

Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
by: Wu, Huawei
Published: (2026)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)

Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)

Threshold rates for properties of random codes
by: Guruswami, Venkatesan, et al.
Published: (2020)

The Labeled Coupon Collector Problem
by: Tan, Andrew, et al.
Published: (2025)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
by: Yu, Lei
Published: (2025)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
by: Goyal, Keshav, et al.
Published: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)

Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024)

On the Codebook Design for NOMA Schemes from Bent Functions
by: Li, Chunlei, et al.
Published: (2025)

Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
by: Genosar, Dor, et al.
Published: (2019)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
by: Beaudou, Laurent, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Local obstructions in sequences revisited
by: Rosenfeld, Matthieu, et al.
Published: (2025)

Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $τ$-Metric
by: Nguyen, The
Published: (2024)

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018)

Automated Discovery of Improved Constant Weight Binary Codes
by: Rosin, Christopher D.
Published: (2026)

When does a bent concatenation not belong to the completed Maiorana-McFarland class?
by: Kudin, Sadmir, et al.
Published: (2024)

Millions of inequivalent quadratic APN functions in eight variables
by: Beierle, Christof, et al.
Published: (2025)

Nearly Orthogonal Sets over Finite Fields
by: Chawin, Dror, et al.
Published: (2024)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

A comprehensive generalization of the Friendship Paradox to weights and attributes
by: Evtushenko, Anna, et al.
Published: (2024)

Strongly k-recursive sequences
by: Krenn, Daniel, et al.
Published: (2024)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)

The capacity of a finite field matrix channel
by: Blackburn, Simon R., et al.
Published: (2022)