In applied mathematics, the Johnson bound (named after Selmer Martin Johnson) is a limit on the size of error-correcting codes, as used in coding theory for data transmission or communications. == Definition == Let C {\displaystyle C} be a q-ary code of length n {\displaystyle n} , i.e.
In applied mathematics, the Johnson bound (named after Selmer Martin Johnson) is a limit on the size of error-correcting codes, as used in coding theory for data transmission or communications. == Definition == Let C {\displaystyle C} be a q-ary code of length n {\displaystyle n} , i.e.
Source: Wikipedia "Johnson bound" · CC BY-SA 4.0
Share this article: X · Bluesky