Plotkin bound
limit on the number of codewords in binary codes of given length and minimum distance
Press Enter · cited answer in seconds
0 sources
Plotkin bound
Summary
Plotkin bound is an inequation[1]. It draws 53 Wikipedia views per month (inequation category, ranking #7 of 14).[2]
Key Facts
- Plotkin bound's instance of is recorded as inequation[3].
- Plotkin bound's instance of is recorded as theorem[4].
- Plotkin bound's Freebase ID is recorded as /m/0b11mj[5].
- Plotkin bound's studied by is recorded as coding theory[6].
- Plotkin bound's maintained by WikiProject is recorded as WikiProject Mathematics[7].
- Plotkin bound's Microsoft Academic ID is recorded as 107339172[8].
Why It Matters
Plotkin bound draws 53 Wikipedia views per month (inequation category, ranking #7 of 14).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[9]