Imagen de Portada

Maximum Size $t$-Intersecting Families and Anticodes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Xuan, Etzion, Tuvi, Krotov, Denis, Shi, Minjia
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Mixed Steiner Triples Systems with Shortest Length
por: Etzion, Tuvi
Publicado: (2025)

Steiner Systems over Mixed Alphabet and Related Designs
por: Etzion, Tuvi
Publicado: (2025)

Triangle decompositions of PG(n-1,2)
por: Shi, Minjia, et al.
Publicado: (2024)

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

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

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

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

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

Completely regular codes in graphs covered by a Hamming graph
por: Goryainov, Sergey, et al.
Publicado: (2024)

Do K33-Free Latin Squares Exist?
por: Krotov, Aleksandr D., et al.
Publicado: (2023)

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

Equitable [[2,10],[6,6]]-partitions of the 12-cube
por: Krotov, Denis S.
Publicado: (2020)

Projective tilings and full-rank perfect codes
por: Krotov, Denis S.
Publicado: (2022)

The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes
por: Krotov, Denis S.
Publicado: (2023)

Low-degree functions without non-essential arguments
por: Krotov, Denis S.
Publicado: (2024)

On de Bruijn Arrays Codes, Part I: Nonlinear Codes
por: Etzion, Tuvi
Publicado: (2024)

Pseduo-Random and de Bruijn Array Codes
por: Etzion, Tuvi
Publicado: (2023)

Multifold 1-perfect codes
por: Krotov, Denis S.
Publicado: (2022)

An upper bound on the number of frequency hypercubes
por: Krotov, Denis S., et al.
Publicado: (2022)

Generalized ovals, 2.5-dimensional additive codes, and multispreads
por: Krotov, Denis S., et al.
Publicado: (2025)

Intersecting Families of Spanning Trees
por: Frankl, Peter, et al.
Publicado: (2025)

Log-Concave Sequences in Coding Theory
por: Shi, Minjia, et al.
Publicado: (2024)

Structure of $t$-Intersecting Families of Vector Spaces
por: Ihringer, Ferdinand, et al.
Publicado: (2026)

Complete Characterization on Maximum Pairwise Cross Intersecting Families (I)
por: Huang, Yang, et al.
Publicado: (2026)

On extended 1-perfect bitrades
por: Bespalov, Evgeny A., et al.
Publicado: (2020)

The spectral Turán problem: Characterizing spectral-consistent graphs
por: Fang, Longfei, et al.
Publicado: (2025)

The log concavity of two graphical sequences
por: Shi, Minjia, et al.
Publicado: (2025)

Constructing MRD codes by switching
por: Minjia Shi, et al.
Publicado: (2024)

On degree-$3$ and $(n-4)$-correlation-immune perfect colorings of $n$-cubes
por: Krotov, Denis S., et al.
Publicado: (2023)

Multispreads
por: Krotov, Denis S., et al.
Publicado: (2023)

On H-Intersecting Graph Families and Counting of Homomorphisms
por: Sason, Igal
Publicado: (2025)

The punctured dodecacode is unique
por: Grassl, Markus, et al.
Publicado: (2026)

Lower Bounds on Intersection Families for Certain Graphs
por: Hamrick, Paul, et al.
Publicado: (2025)

On Maximal Left-Compressed Intersecting Families Generated by a Collection of Subsets of [$n$]
por: Nguyen, Tuan
Publicado: (2025)

A further study on the mass formula for linear codes with prescribed hull dimension
por: Li, Shitao, et al.
Publicado: (2024)

Maxmum Size of a Uniform Family with Bounded VC-dimension
por: Yang, Tianchi, et al.
Publicado: (2025)

Intersecting families with large shadow degree
por: Frankl, Peter, et al.
Publicado: (2024)

Intersecting families with covering number three
por: Frankl, Peter, et al.
Publicado: (2022)

Efficient Enumeration of Cliques in Graphs with Bounded Maximum Degree
por: Gong, Shi-Cai, et al.
Publicado: (2026)