Cover Image

Steiner Systems over Mixed Alphabet and Related Designs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Etzion, Tuvi
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

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

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

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

One-factorizations of complete multipartite graphs with distance constraints
by: Tan, Yuli, 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)

Constructions of Covering Sequences and Arrays
by: Chee, Yeow Meng, et al.
Published: (2025)

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

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

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

Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet
by: Lapointe, Mélodie, et al.
Published: (2024)

Steiner Quadruple Systems with Minimum Colorable Derived Designs: Constructions and Applications
by: Tan, Yuli, et al.
Published: (2025)

Oriented Steiner Triple Systems, Steiner Products, and Dynamics
by: Kettinger, Jake, et al.
Published: (2025)

On the Steiner $k$-diameter and Steiner ($k,k^{\prime}$)-radius of trees
by: Zhang, Qingnan, et al.
Published: (2025)

High-Girth Steiner Triple Systems
by: Kwan, Matthew, et al.
Published: (2022)

On Ramsey number of Steiner systems
by: Basu, Ayush, et al.
Published: (2026)

Steiner triple systems with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2025)

Enumerations of 1-rotational Steiner systems
by: Hetman, Ivan, et al.
Published: (2025)

Arc-disjoint Steiner Cycles in Digraphs
by: Bai, Jie, et al.
Published: (2026)

Internally-disjoint Pendant Steiner Trees in Digraphs
by: Yu, Shanshan, et al.
Published: (2025)

Codegree conditions for (fractional) Steiner triple systems
by: Zheng, Michael
Published: (2024)

On eigenfunctions of the block graphs of geometric Steiner systems
by: Goryainov, Sergey, et al.
Published: (2023)

Unclustered BWTs of any Length over Non-Binary Alphabets
by: Fici, Gabriele, et al.
Published: (2025)

An Optimal Sauer Lemma Over $k$-ary Alphabets
by: Hanneke, Steve, et al.
Published: (2026)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

The existence of pyramidal Steiner triple systems over abelian groups
by: Chang, Yanxun, et al.
Published: (2025)

Completely independent Steiner trees and corresponding tree connectivity
by: Yuan, Jun, et al.
Published: (2025)

$\mathrm{ EA}(q)$-additive Steiner 2-designs
by: Buratti, Marco, et al.
Published: (2025)

Steiner Type Packing Problems in Digraphs: A Survey
by: Sun, Yuefang
Published: (2022)

The Coverage Depth Problem in DNA Storage Over Small Alphabets
by: Bertuzzo, Matteo, et al.
Published: (2025)

Extensions of Steiner Triple Systems
by: Falcone, Giovanni, et al.
Published: (2024)

On the Extension Theorem for Packing Steiner Forests
by: Zeng, Jinghan A
Published: (2026)

Steiner 3-designs as extensions
by: Kiermaier, Michael, et al.
Published: (2025)

Constructing edge-disjoint Steiner trees in Cartesian product networks
by: Li, Rui, et al.
Published: (2023)

Packing internally disjoint Steiner paths of data center networks
by: Zhu, Wen-Han, et al.
Published: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

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

Minimal Graph Embeddings via Point Deletions in Steiner triple systems
by: Huggan, Melissa A., et al.
Published: (2025)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

Enumeration of Factor Occurrences in $k$-Bonacci Words over an Infinite Alphabet
by: Ghareghani, Narges, et al.
Published: (2026)