GeistHaus
log in · sign up

Trifferent codes with small lengths

sciencedirect.com

A code C⊆{0,1,2}n of 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)…

2 pages link to this URL
Anurag's Math Blog
Anurag's Math Blog

Mostly mathematical

0 inbound links website en Extremal CombinatoricsFinite GeometryCombinatoricsJob openingsIncidence GeometryRamsey TheoryNumber TheoryCoding TheorySpectral Graph Theory affine capscap setcombinatoricscomplete capsDion Gijswijtextremal problemsfinite fieldsfinite geometrymathematicsprojective capsblocking setFurstenberg–Sárközyinduced matchingsminimal blocking setsNikodym setsPaley Graphssquare-difference-free setsTamas SzonyiJob openingsPhDpostdoccapschromatic numbermathramseyramsey numberssum-free setsvector spacescircular sortingorthomorphismspolynomialsstrong complete mappingswreath productsaffine blocking setsexpandersGraph TheoryIstvan TomonSpectral Graph Theorystrong blocking setsananth raviFerdinand IhringerJohn BambergdaisiesDavid EllishypercubeImre LeaderMaria-Romina IvanNoga AlonBCH codescayley graphslog-rank conjecturem-ovoidsnearly orthogonal setsoddtownovoidspolar spacesRank-RamseyBhandariKhetanresearchtrifferencetrifferenttrifferent codes
A new upper bound on the trifference problem
Anurag's Math Blog

In a recent preprint, Siddharth Bhandari and Abhishek Khetan have improved the decades old upper bound on the trifference problem by using a clever combinatorial argument involving extremal graph t…

0 inbound links article en Coding TheoryExtremal Combinatorics Bhandaricombinatoricsextremal problemsKhetanmathematicsresearchtrifferencetrifferenttrifferent codes