DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00007256
URN to cite this document: urn:nbn:de:bvb:703-epub-7256-9
URN to cite this document: urn:nbn:de:bvb:703-epub-7256-9
Title data
Kurz, Sascha:
Trifferent codes with small lengths.
Bayreuth
,
2023
. - 11 S.
![]() |
|
||||||||
Download (378kB)
|
Abstract
A code C over the alphabet {0,1,2} with length n is called trifferent if for any three distinct elements of C there exists a coordinate in which they all differ. By T(n) we denote the maximum cardinality of trifferent codes with length n. T(5)=10 and T(6)=13 were recently determined. Here we determine T(7)=16, T(8)=20, and T(9)=27. For the latter case n=9 there also exist linear codes attaining the maximum possible cardinality 27.
Further data
Item Type: | Preprint, postprint |
---|---|
Keywords: | trifferent codes; minimal ternary codes; perfect k-hashing |
Subject classification: | Mathematics Subject Classification Code: 68R05 (68Q17) |
DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties |
Language: | English |
Originates at UBT: | Yes |
URN: | urn:nbn:de:bvb:703-epub-7256-9 |
Date Deposited: | 23 Oct 2023 10:14 |
Last Modified: | 23 Oct 2023 10:14 |
URI: | https://epub.uni-bayreuth.de/id/eprint/7256 |