New nonbinary code bounds based on divisibility arguments

作者：Polak Sven C^*

来源：Designs, Codes and Cryptography, 2018, 86(4): 861-874.

DOI：10.1007/s10623-017-0366-0

• Code
• Nonbinary code
• Upper bounds
• Kirkman system
• Divisibility
• Symmetric net

For , let be the maximum size of a code with minimum distance at least d. We give a divisibility argument resulting in the new upper bounds , and . These in turn imply the new upper bounds , , and . Furthermore, we prove that for , there is a 1-1-correspondence between symmetric -nets (which are certain designs) and codes of size with minimum distance at least . We derive the new upper bounds and from these 'symmetric net' codes.

• 出版日期2018-4