Cover Image

Constructions of Covering Sequences and Arrays

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chee, Yeow Meng, Etzion, Tuvi, Ta, Hoang, Vu, Van Khu
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On de Bruijn Covering Sequences and Arrays
by: Chee, Yeow Meng, et al.
Published: (2024)

Sequence Reconstruction for Sticky Insertion/Deletion Channels
by: Pham, Van Long Phuoc, et al.
Published: (2025)

Maximum Length RLL Sequences in de Bruijn Graph
by: Chee, Yeow Meng, et al.
Published: (2024)

Pairs in Nested Steiner Quadruple Systems
by: Chee, Yeow Meng, et al.
Published: (2024)

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

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
by: Chee, Yeow Meng, et al.
Published: (2023)

Mixed Steiner Triples Systems with Shortest Length
by: Etzion, Tuvi
Published: (2025)

Steiner Systems over Mixed Alphabet and Related Designs
by: Etzion, Tuvi
Published: (2025)

On de Bruijn Array Codes Part II: Linear Codes
by: Blackburn, Simon, et al.
Published: (2025)

On $t$-edge-balanced graphs
by: Chee, Yeow Meng
Published: (2026)

New Nonuniform Group Divisible Designs and Mixed Steiner Systems
by: Etzion, Tuvi, et al.
Published: (2025)

One-factorizations of complete multipartite graphs with distance constraints
by: Tan, Yuli, et al.
Published: (2026)

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
by: Schaller, Michael, et al.
Published: (2025)

A Mixture of Experts Vision Transformer for High-Fidelity Surface Code Decoding
by: Nguyen, Hoang Viet, et al.
Published: (2026)

Maximum Size $t$-Intersecting Families and Anticodes
by: Wang, Xuan, et al.
Published: (2025)

Closed Expressions for the Weight Distributions of Codes Associated with Perfect Codes
by: Etzion, Tuvi, et al.
Published: (2026)

Pseduo-Random and de Bruijn Array Codes
by: Etzion, Tuvi
Published: (2023)

On de Bruijn Arrays Codes, Part I: Nonlinear Codes
by: Etzion, Tuvi
Published: (2024)

Efficient designs for threshold group testing without gap
by: Bui, Thach V., et al.
Published: (2024)

Recovery Sets of Subspaces from a Simplex Code
by: Chee, Yeow Meng, et al.
Published: (2024)

Binary and Non-Binary Self-Dual Sequences and Maximum Period Single-Track Gray Codes
by: Etzion, Tuvi
Published: (2025)

List Reconstruction Problem with List Size Two
by: Vu, Binh, et al.
Published: (2026)

Repairing with Zero Skip Cost
by: Zhang, Wenqin, et al.
Published: (2024)

On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory
by: Chee, Yeow Meng, et al.
Published: (2023)

On Nearly Perfect Covering Codes
by: Boruchovsky, Avital, et al.
Published: (2024)

Odd Covers of Complete Graphs and Hypergraphs
by: Leader, Imre, et al.
Published: (2024)

Sequence Characterization of Multiple Almost-Riordan Arrays and Their Compressions
by: He, Tian-Xiao
Published: (2025)

The Double Almost-Riordan Arrays and Their Sequence Characterization, Compression, and Total Positivity
by: He, Tian-Xiao
Published: (2024)

The number of cut-edges and conflict-free connection number in planar graphs
by: Ha, Pham Hoang, et al.
Published: (2026)

Repairing Reed-Solomon Codes with Side Information
by: Dinh, Thi Xinh, et al.
Published: (2024)

Determining Covering Array Numbers via Balanced Covering Arrays
by: Hiess, Irene, et al.
Published: (2025)

The Capacity of the Weighted Read Channel
by: Yerushalmi, Omer, et al.
Published: (2024)

Mahonian Statistics and Vincular Patterns on Permutations over Multisets
by: Ta, Lien T. P., et al.
Published: (2024)

Universal Costas Matrices: Towards a General Framework for Costas Array Construction
by: Gulec, Fatih, et al.
Published: (2026)

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

A short proof of Kahn-Kalai conjecture
by: Tran, P., et al.
Published: (2023)

Constructions of local antimagic 3-colorable graphs of fixed odd size | matrix approach
by: Lau, Gee-Choon, et al.
Published: (2024)

Construction of local antimagic 3-colorable graphs of fixed even size -- matrix approach
by: Lau, Gee-Choon, et al.
Published: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
by: Le, Hoang-Oanh, et al.
Published: (2023)

Sequence saturation
by: Anand, et al.
Published: (2024)