Cover Image

Trifferent codes with small lengths

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kurz, Sascha
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics 68R05, 68Q17
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

Polygonal corona limit on multigrid dual tilings
by: Lutfalla, Victor, et al.
Published: (2024)

Edge open packing: complexity, algorithmic aspects, and bounds
by: Brešar, Boštjan, et al.
Published: (2024)

Homomorphically Full Oriented Graphs
by: Bellitto, Thomas, et al.
Published: (2022)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

String attractors of some simple-Parry automatic sequences
by: Gheeraert, France, et al.
Published: (2023)

Linear extensions of finite posets
by: Chan, Swee Hong, et al.
Published: (2023)

Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets
by: Simon, Hans U.
Published: (2024)

Trail Trap: a variant of Partizan Edge Geography
by: Buchanan, Calum, et al.
Published: (2024)

Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)

Complexity of chess domination problems
by: Langlois-Rémillard, Alexis, et al.
Published: (2022)

Introducing q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)

An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
by: Cicerone, Serafino, et al.
Published: (2025)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
by: Edwards, Darren J.
Published: (2025)

Circularity and repetitiveness in non-injective DF0L systems
by: Goulet-Ouellet, Herman, et al.
Published: (2025)

WalkSAT is linear on random 2-SAT
by: Berenbrink, Petra, et al.
Published: (2024)

On solving basic equations over the semiring of functional digraphs
by: Dennunzio, Alberto, et al.
Published: (2024)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Extremal Results on Conflict-free Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2023)

The damage number of the Cartesian product of graphs
by: Huggan, Melissa A., et al.
Published: (2023)

Symmetric properties and two variants of shuffle-cubes
by: Lü, Huazhong, et al.
Published: (2021)

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation
by: Bright, Curtis, et al.
Published: (2025)

Universal partial tori
by: Carey, William D., et al.
Published: (2024)

The Hierarchy of Saturating Matching Numbers
by: Simon, Hans U., et al.
Published: (2025)

Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)

Paired many-to-many 2-disjoint path cover of Johnson graphs
by: Liu, Jinhao, et al.
Published: (2025)

Degree Realization by Bipartite Multigraphs
by: Bar-Noy, Amotz, et al.
Published: (2025)

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation
by: Bright, Curtis, et al.
Published: (2025)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)

Complexity of learning matchings and half graphs via edge queries
by: Mande, Nikhil S., et al.
Published: (2025)

Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)

Harmonious Colorings: bounds, heuristics and integer-linear formulations
by: Araújo, Júlio, et al.
Published: (2026)

Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)

Recovery of cyclic words by their subwords
by: Luchinin, Sergey, et al.
Published: (2024)

Subexponential upper bound on the number of rich words
by: Rukavicka, Josef
Published: (2025)