Details for entry \(A_3(18,10;9)\)

Lower bounds

• ef_computation ( show
  [(0, 1, 2, 3, 4, 5, 6, 7, 8), (0, 1, 2, 3, 9, 10, 11, 12, 13), (2, 3, 4, 6, 9, 10, 14, 15, 16), (1, 4, 5, 6, 9, 11, 13, 15, 17), (0, 4, 5, 7, 9, 10, 12, 14, 17), (1, 3, 5, 8, 10, 11, 14, 16, 17), (0, 2, 7, 8, 9, 11, 15, 16, 17), (2, 5, 6, 7, 11, 12, 13, 14, 16), (1, 4, 7, 8, 10, 12, 13, 15, 16), (0, 3, 6, 8, 12, 13, 14, 15, 17)]
  ) : 2954312706554320686732
• two_pivot_block_construction ( ) : 2954312706554320650240
• generalized_linkage ( 9,0 ) : 2954312706550833757720
• generalized_linkage_multipleblocks ( show
  [9, 9],[0, 0]
  ) : 2954312706550833757720
• LiuChangFeng2019_Theo_2_6 ( ) : 2954312706550833733112
• CKMP2019_Cor_42 ( (9, 9) ) : 2954312706550833698644
• CKMP2019_Lem_41 ( (9, 9) ) : 2954312706550833698644
• improved_linkage ( 9 ) : 2954312706550833698644
• linkage_GLT ( 9 ) : 2954312706550833698644
• multicomponent ( ) : 2954312706550833698644
• LMRD ( ) : 2954312706550833698643
• HKK_lemma_2_4_lower_bound ( ) : 36472996377558747975
• JohnsonLB ( ) : 36472378735198084355
• sphere_covering ( ) : 482423804995
• graham_sloane ( ) : 70278
• trivial_1 ( ) : 0

Upper bounds

• Ahlswede_Aydinian ( 0, 17 ) : 2966943004430536320980
• ilp_4 ( 17 ) : 2966943004430536320980
• johnson_2 ( ) : 2966943004430536320980
• ilp_1 ( 1 ) : 2966943004430536399716
• improved_johnson ( ) : 2966943004430536399716
• johnson_1 ( ) : 2966943004430536399716
• anticode ( ) : 2972557554642946938088
• ilp_2 ( 5 ) : 2972557554642946938088
• ilp_3 ( 13 ) : 2972557554642946938088
• linear_programming_bound ( ) : 2972557554642946938088
• singleton ( ) : 5263390747480701708292
• sphere_packing ( ) : 150079911311086523507369
• all_subs ( ) : 791614563787525746761491781638123230424

Bound for codes containing the lifted MRD code

Do you have better bounds?