Details for entry \(A_4(18,10;8)\)

Lower bounds

• ef_computation ( show
  [(0, 1, 2, 3, 4, 5, 6, 7), (0, 2, 4, 8, 9, 10, 11, 12), (1, 3, 5, 8, 9, 10, 13, 15), (1, 3, 6, 8, 11, 12, 14, 16), (2, 6, 7, 8, 9, 13, 14, 17), (4, 5, 6, 10, 11, 13, 16, 17), (0, 5, 7, 9, 11, 14, 15, 16), (3, 4, 7, 10, 12, 14, 15, 17), (0, 1, 2, 12, 13, 15, 16, 17)]
  ) : 1208925819614646358791297
• generalized_linkage ( 8,3 ) : 1208925819614629174771713
• generalized_linkage_multipleblocks ( show
  [8, 10],[0, 3]
  ) : 1208925819614629174771713
• improved_linkage ( 8 ) : 1208925819614629174771713
• multicomponent ( ) : 1208925819614629174771713
• CKMP2019_Cor_42 ( (8, 10) ) : 1208925819614629174706177
• CKMP2019_Lem_41 ( (8, 10) ) : 1208925819614629174706177
• LiuChangFeng2019_Theo_2_6 ( ) : 1208925819614629174706177
• linkage_GLT ( 8 ) : 1208925819614629174706177
• LMRD ( ) : 1208925819614629174706176
• JohnsonLB ( ) : 1208921207933009850789905
• HKK_lemma_2_4_lower_bound ( ) : 295147905196532715780
• sphere_covering ( ) : 194578605478103
• graham_sloane ( ) : 285543
• trivial_1 ( ) : 0

Upper bounds

• improved_johnson ( ) : 1210495424682168633823373
• Ahlswede_Aydinian ( 0, 17, o ) : 1210495424682168633823381
• ilp_1 ( 1 ) : 1210495424682168633823381
• johnson_1 ( ) : 1210495424682168633823381
• anticode ( ) : 1210495424694010438389461
• ilp_2 ( 4 ) : 1210495424694010438389461
• linear_programming_bound ( ) : 1210495424694010438389461
• singleton ( ) : 1753501675591663698472421
• ilp_4 ( 17 ) : 309746293109832168366994687
• johnson_2 ( ) : 309746293109832168366994687
• HKK_lemma_2_4_upper_bound ( ) : 309747179304465755279963087
• sphere_packing ( ) : 56891829523972188330216248978
• ilp_3 ( 12 ) : 79331404956419475605581855892
• all_subs ( ) : 2122605755496989866141807971203282490337105187301

Bound for codes containing the lifted MRD code

Do you have better bounds?