The maximum cardinality of trifferent codes with lengths 5 and 6
Authors:
- Stefano Della FioreSFStefano Della Fiore
- Alessandro GnuttiAGAlessandro Gnutti
- Sven PolakSPSven Polak
Open Access
- 2 February 2022
- journal article
- research article
- Published by Elsevier in Examples and Counterexamples
- Vol. 2
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- New upper bounds for (b, k)-hashing2021
- New bounds for perfect k-hashingDiscrete Applied Mathematics, 2021
- A gap in the slice rank of k-tensorsJournal of Combinatorial Theory, Series A, 2021
- An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 ChannelIEEE Transactions on Information Theory, 2019
- Semidefinite bounds for nonbinary codes based on quadruplesDesigns, Codes and Cryptography, 2016
- An upper bound on the zero-error list-coding capacityIEEE Transactions on Information Theory, 1994
- New Bounds for Perfect Hashing via Information TheoryEuropean Journal of Combinatorics, 1988
- On the Size of Separating Systems and Families of Perfect Hash FunctionsSIAM Journal on Algebraic Discrete Methods, 1984