Details for entry \(A_2(13,6;6)\)

Lower bounds

• ef_computation ( show
  [(0, 1, 2, 3, 4, 5), (0, 1, 2, 6, 7, 8), (0, 3, 4, 6, 7, 9), (1, 2, 3, 6, 9, 10), (1, 3, 5, 6, 7, 11), (0, 3, 5, 6, 8, 10), (1, 3, 4, 7, 8, 10), (1, 4, 5, 6, 8, 9), (2, 3, 4, 6, 8, 12), (2, 3, 5, 7, 8, 9), (0, 2, 5, 6, 9, 11), (0, 1, 3, 8, 9, 11), (0, 2, 4, 8, 9, 10), (0, 1, 5, 7, 9, 10), (1, 2, 4, 7, 9, 11), (0, 2, 3, 7, 10, 11), (0, 1, 4, 6, 10, 11), (2, 4, 5, 6, 7, 10), (0, 4, 5, 7, 8, 12), (1, 2, 5, 8, 10, 11), (3, 4, 5, 9, 10, 11), (7, 8, 9, 10, 11, 12)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 269090113)
  ) : 269057345
• greedy_multicomponent ( show
  q^28 + q^19 + q^15 + q^14 + 3*q^12 + 9*q^11 + q^9 + q^8 + q^5 + 1
  ) : 269040417
• two_pivot_block_construction ( ) : 268960768
• LiuChangFeng2019_Theo_2_6 ( ) : 268612622
• CKMP2019_Cor_45 ( show
  (7,),(3,),(1,)
  ) : 268525390
• CKMP2019_Cor_42 ( (6, 7) ) : 268523342
• CKMP2019_Lem_41 ( (6, 7) ) : 268523342
• generalized_linkage ( 6,0 ) : 268523342
• generalized_linkage_multipleblocks ( show
  [6, 7],[0, 0]
  ) : 268523342
• improved_linkage ( 6 ) : 268439629
• multicomponent ( ) : 268439553
• linkage_GLT ( 6 ) : 268435457
• LMRD ( ) : 268435456
• JohnsonLB ( ) : 267691800
• JohnsonLB_special ( ) : 267691800
• HKK_lemma_2_4_lower_bound ( ) : 33670248
• ChenHeWengXu2019_T31 ( ) : 16865101
• sphere_covering ( ) : 535253
• graham_sloane ( ) : 221721
• trivial_1 ( ) : 0

Upper bounds

• improved_johnson ( ) : 339800773
• Ahlswede_Aydinian ( 0, 12, o ) : 339800774
• ilp_1 ( 1 ) : 339800774
• johnson_1 ( ) : 339800774
• anticode ( ) : 342525387
• ilp_2 ( 4 ) : 342525387
• linear_programming_bound ( ) : 342525387
• singleton ( ) : 866251507
• sphere_packing ( ) : 929675073
• ilp_4 ( 11 ) : 1377743291
• johnson_2 ( ) : 1377743291
• ilp_3 ( 8 ) : 1378192700
• all_subs ( ) : 14877590196755

Bound for codes containing the lifted MRD code

Do you have better bounds?