Improved Upper Bound for the Size of a Trifferent Code
- 18 December 2024
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 45 (1) , 1-14
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Trifferent codes with small lengthsExamples and Counterexamples, 2024
- Beating the Probabilistic Lower Bound on q-Perfect HashingCombinatorica, 2023
- The maximum cardinality of trifferent codes with lengths 5 and 6Examples and Counterexamples, 2022
- Beating Fredman-Komlós for perfect k-hashingJournal of Combinatorial Theory, Series A, 2022
- 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
- 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
- Zero error capacity under list decodingIEEE Transactions on Information Theory, 1988