Cover Image

The Labeled Coupon Collector Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tan, Andrew, Limor, Oriel, Bar-Lev, Daniella, Gabrys, Ryan, Yakhini, Zohar, Siegel, Paul H.
Format:	Preprint
Published:	2025
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

The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
by: Berrebi, Shoham Shimon, et al.
Published: (2025)

The Careless Coupon Collector's Problem
by: Cruciani, Emilio, et al.
Published: (2026)

Multivariate Analytic Combinatorics for Cost Constrained Channels
by: Lenz, Andreas, et al.
Published: (2021)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, 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)

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

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

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)

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

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

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

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)

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)

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

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

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

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

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

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

Representing Information on DNA using Patterns Induced by Enzymatic Labeling
by: Bar-Lev, Daniella, et al.
Published: (2024)

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

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

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

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

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

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
by: Bar-Lev, Daniella
Published: (2026)

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

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

Constructing MRD codes by switching
by: Shi, Minjia, et al.
Published: (2022)

Average Case Analysis of Leaf-Centric Binary Tree Sources
by: Benkner, Louisa Seelbach, et al.
Published: (2018)

Improved Constructions of Skew-Tolerant Gray Codes
by: Himelfarb, Gabriel Sac, et al.
Published: (2024)

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

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)

On the Identity and Group Problems for Complex Heisenberg Matrices
by: Bell, Paul C., et al.
Published: (2023)

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

Labeling and folding multi-labeled trees
by: Moulton, Vincent, et al.
Published: (2025)