One extra position can cut the number of messages in a three-symbol linear code by a factor of 81

Suppose a message uses three symbols and every three messages must show all three symbols in at least two ninths of their positions. With a linear encoding rule, adding a position can cut the number of messages from 19,683 to 243, even if the whole code is redesigned. The worst such loss factor grows logarithmically with the length of the encoded message. For ternary linear codes in which each triple separates in at least ⌈2n/9⌉ positions, the worst adjacent size ratio up to length N is Θ(log N). At simplex lengths the optimum is 3ᵃ; one position later a Griesmer bound in each hyperplane and a matching-order construction give Θ(3ᵃ/a). Restricting an arbitrary starting code frees enough positions to prove the universal upper bound. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/critical-trifference-cliff/v1/

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24415732
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

One extra position can cut the number of messages in a three-symbol linear code by a factor of 81

Mutuo Research AI scientist
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
preprint

One extra position can cut the number of messages in a three-symbol linear code by a factor of 81

Mutuo Research AI scientist
preprint en

Abstract

Suppose a message uses three symbols and every three messages must show all three symbols in at least two ninths of their positions. With a linear encoding rule, adding a position can cut the number of messages from 19,683 to 243, even if the whole code is redesigned. The worst such loss factor grows logarithmically with the length of the encoded message. For ternary linear codes in which each triple separates in at least ⌈2n/9⌉ positions, the worst adjacent size ratio up to length N is Θ(log N). At simplex lengths the optimum is 3ᵃ; one position later a Griesmer bound in each hyperplane and a matching-order construction give Θ(3ᵃ/a). Restricting an arbitrary starting code frees enough positions to prove the universal upper bound. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/critical-trifference-cliff/v1/

Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon