The maximum cardinality of trifferent codes with lengths 5 and 6

01/18/2022
βˆ™
by   Stefano Della Fiore, et al.
βˆ™
0
βˆ™

A code π’žβŠ†{0, 1, 2}^n is said to be trifferent with length n when for any three distinct elements of π’ž there exists a coordinate in which they all differ. Defining 𝒯(n) as the maximum cardinality of trifferent codes with length n, 𝒯(n) is unknown for n β‰₯ 5. In this note, we use an optimized search algorithm to show that 𝒯(5) = 10 and 𝒯(6) = 13.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 03/30/2023

Lengths of divisible codes with restricted column multiplicities

We determine the minimum possible column multiplicity of even, doubly-, ...
research
βˆ™ 06/29/2011

A Comparison of Lex Bounds for Multiset Variables in Constraint Programming

Set and multiset variables in constraint programming have typically been...
research
βˆ™ 07/24/2023

In search of maximum non-overlapping codes

Non-overlapping codes are block codes that have arisen in diverse contex...
research
βˆ™ 05/15/2018

A class of repeated-root constacyclic codes over F_p^m[u]/γ€ˆ u^e〉 of Type 2

Let F_p^m be a finite field of cardinality p^m where p is an odd prime, ...
research
βˆ™ 08/31/2021

Gray Cycles of Maximum Length Related to k-Character Substitutions

Given a word binary relation Ο„ we define a Ο„-Gray cycle over a finite la...
research
βˆ™ 10/16/2012

Fast Exact Inference for Recursive Cardinality Models

Cardinality potentials are a generally useful class of high order potent...
research
βˆ™ 01/03/2021

Symmetry Implies Isomorphism for Certain Maximum Length Circuit Codes

A classic result due to Douglas establishes that, for odd spread k and d...

Please sign up or login with your details

Forgot password? Click here to reset