Trifferent codes with small lengths
From MaRDI portal
Cites work
- A geometric characterization of minimal codes and their asymptotic performance
- 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 mixed binary/ternary codes
- Codes and projective multisets
- Computer Classification of Linear Codes
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- Explicit constructions of separating hash families from algebraic curves over finite fields
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Improved Bounds for (b, k)-Hashing
- Minimal vectors in linear codes
- 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
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
- Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
- The maximum cardinality of trifferent codes with lengths 5 and 6
- Three combinatorial perspectives on minimal codes
Cited in
(2)
This page was built for publication: Trifferent codes with small lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933216)
