Details for entry \(A_2(15,8;7)\)

Lower bounds

• greedy_multicomponent ( show
  q^32 + q^16 + q^10 + q^8 + q^7 + 2*q^6 + 2*q^5 + 4*q^4 + q^3 + 1
  ) : 4295034505
• two_pivot_block_construction ( ) : 4295032833
• ef_computation ( show
  [(0, 1, 2, 3, 4, 5, 6), (0, 2, 4, 7, 8, 9, 10), (1, 2, 5, 7, 8, 11, 12), (1, 3, 6, 7, 8, 9, 14), (0, 3, 5, 7, 9, 11, 13), (1, 3, 4, 9, 10, 11, 12), (0, 1, 6, 8, 10, 11, 13), (2, 3, 6, 7, 10, 12, 13), (1, 4, 5, 7, 10, 13, 14), (0, 3, 5, 8, 10, 12, 14), (0, 4, 6, 7, 11, 12, 14), (2, 3, 4, 8, 11, 13, 14), (2, 5, 6, 9, 10, 11, 14), (4, 5, 6, 8, 9, 12, 13), (0, 1, 2, 9, 12, 13, 14)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 4295040748)
  ) : 4295003084
• generalized_linkage ( 7,0 ) : 4294967629
• generalized_linkage_multipleblocks ( show
  [7, 8],[0, 0]
  ) : 4294967629
• improved_linkage ( 7 ) : 4294967425
• multicomponent ( ) : 4294967425
• LiuChangFeng2019_Theo_2_6 ( ) : 4294967307
• CKMP2019_Cor_42 ( (7, 8) ) : 4294967297
• CKMP2019_Lem_41 ( (7, 8) ) : 4294967297
• linkage_GLT ( 7 ) : 4294967297
• LMRD ( ) : 4294967296
• JohnsonLB ( ) : 4278454841
• JohnsonLB_special ( ) : 4278454841
• HKK_lemma_2_4_lower_bound ( ) : 268471378
• sphere_covering ( ) : 419428
• graham_sloane ( ) : 7010
• trivial_1 ( ) : 0

Upper bounds

• improved_johnson ( ) : 4839580371
• Ahlswede_Aydinian ( 0, 14, o ) : 4839580374
• ilp_1 ( 1 ) : 4839580374
• johnson_1 ( ) : 4839580374
• anticode ( ) : 4839758833
• ilp_2 ( 4 ) : 4839758833
• linear_programming_bound ( ) : 4839758833
• singleton ( ) : 13910980083
• ilp_4 ( 13 ) : 37577622727
• johnson_2 ( ) : 37577622727
• ilp_3 ( 10 ) : 38850926788
• sphere_packing ( ) : 3807484997010
• all_subs ( ) : 246614610741341843

Bound for codes containing the lifted MRD code

Do you have better bounds?