Improved upper bound for the size of a trifferent code

DOI10.1007/S00493-024-00130-2MaRDI QIDQ6999754zbMATH OpenFDO

Authors Siddharth Bhandari, Abhishek Khetan

Publication date 8 April 2025

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00493-024-00130-2

zbMATH Keywords

perfect hash codetrifferent codeupper bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites work

• A gap in the slice rank of \(k\)-tensors
• An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel
• An upper bound on the zero-error list-coding capacity
• Beating Fredman-Komlós for perfect \(k\)-hashing
• Beating the probabilistic lower bound on \(q\)-perfect hashing
• Bounds on the Zero-Error List-Decoding Capacity of the q/(q – 1) Channel
• scientific article; zbMATH DE number 3140515 (Why is no real title available?)
• New bounds for perfect \(k\)-hashing
• New bounds for perfect hashing via information theory
• On the Size of Separating Systems and Families of Perfect Hash Functions
• On the Trifference Problem for Linear Codes
• The maximum cardinality of trifferent codes with lengths 5 and 6
• Trifferent codes with small lengths
• Zero error capacity under list decoding

Cited in

(1)

• Separating hash families with large universe

This page was built for publication: Improved upper bound for the size of a trifferent code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6999754)