Details for entry \(A_7(10,4;5)\)

Lower bounds

• CKMP2019_Cor_45 ( show
  (5,),(3,),(2,)
  ) : 79831695190351209
• CossidentePavese14_theorem311 ( ) : 79831695150255644
• CKMP2019_Cor_42 ( (5, 5) ) : 79831695149997602
• CKMP2019_Lem_41 ( (5, 5) ) : 79831695149997602
• LiuChangFeng2019_Theo_2_6 ( ) : 79831695149997602
• generalized_linkage ( 5,0 ) : 79831695149997602
• generalized_linkage_multipleblocks ( show
  [5, 5],[0, 0]
  ) : 79831695149997602
• ChenHeWengXu2019_T31 ( ) : 79831695149997601
• ChenHeWengXu2019_T41 ( ) : 79831695149997601
• XuChen2018 ( ) : 79831695149997601
• echelon_ferrers ( show
  optimal [(0, 1, 2, 3, 4), (0, 1, 2, 5, 6), (0, 1, 2, 7, 8), (0, 1, 3, 5, 7), (0, 1, 3, 6, 8), (0, 1, 4, 5, 8), (0, 1, 4, 6, 7), (0, 2, 3, 5, 8), (0, 2, 3, 6, 7), (0, 2, 4, 5, 7), (0, 2, 4, 6, 8), (0, 3, 4, 5, 6), (0, 3, 4, 7, 8), (0, 5, 6, 7, 8), (1, 2, 3, 5, 9), (1, 2, 4, 6, 9), (1, 3, 4, 7, 9), (1, 5, 6, 7, 9), (2, 3, 4, 8, 9), (2, 5, 6, 8, 9), (3, 5, 7, 8, 9), (4, 6, 7, 8, 9)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 79826290488416432 with optimal [(0, 1, 2, 3, 4), (0, 1, 2, 5, 6), (0, 1, 2, 7, 8), (0, 1, 3, 5, 7), (0, 1, 3, 6, 8), (0, 1, 4, 5, 8), (0, 1, 4, 6, 7), (0, 2, 3, 5, 8), (0, 2, 3, 6, 7), (0, 2, 4, 5, 7), (0, 2, 4, 6, 8), (0, 3, 4, 5, 6), (0, 3, 4, 7, 8), (0, 5, 6, 7, 8), (1, 2, 3, 5, 9), (1, 2, 4, 6, 9), (1, 3, 4, 7, 9), (1, 5, 6, 7, 9), (2, 3, 4, 8, 9), (2, 5, 6, 8, 9), (3, 5, 7, 8, 9), (4, 6, 7, 8, 9)])
  ) : 79826290488416432
• pending_dots ( show
  optimal [(0, 1, 2, 3, 4), (0, 1, 2, 5, 6), (0, 1, 2, 7, 8), (0, 1, 3, 5, 7), (0, 1, 3, 6, 8), (0, 1, 4, 5, 8), (0, 1, 4, 6, 7), (0, 2, 3, 5, 8), (0, 2, 3, 6, 7), (0, 2, 4, 5, 7), (0, 2, 4, 6, 8), (0, 3, 4, 5, 6), (0, 3, 4, 7, 8), (0, 5, 6, 7, 8), (1, 2, 3, 5, 9), (1, 2, 4, 6, 9), (1, 3, 4, 7, 9), (1, 5, 6, 7, 9), (2, 3, 4, 8, 9), (2, 5, 6, 8, 9), (3, 5, 7, 8, 9), (4, 6, 7, 8, 9)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 79826290488416432 with optimal [(0, 1, 2, 3, 4), (0, 1, 2, 5, 6), (0, 1, 2, 7, 8), (0, 1, 3, 5, 7), (0, 1, 3, 6, 8), (0, 1, 4, 5, 8), (0, 1, 4, 6, 7), (0, 2, 3, 5, 8), (0, 2, 3, 6, 7), (0, 2, 4, 5, 7), (0, 2, 4, 6, 8), (0, 3, 4, 5, 6), (0, 3, 4, 7, 8), (0, 5, 6, 7, 8), (1, 2, 3, 5, 9), (1, 2, 4, 6, 9), (1, 3, 4, 7, 9), (1, 5, 6, 7, 9), (2, 3, 4, 8, 9), (2, 5, 6, 8, 9), (3, 5, 7, 8, 9), (4, 6, 7, 8, 9)])
  ) : 79826290488416432
• ef_computation ( show
  [(0, 1, 2, 3, 4), (0, 1, 2, 5, 6), (0, 1, 3, 5, 7), (0, 1, 3, 6, 8), (0, 3, 4, 5, 6), (0, 2, 4, 5, 7), (0, 1, 4, 6, 7), (0, 1, 4, 5, 8), (0, 1, 2, 7, 8), (0, 2, 3, 6, 7), (0, 2, 3, 5, 8), (1, 2, 3, 5, 9), (0, 2, 4, 6, 8), (1, 2, 4, 6, 9), (0, 3, 4, 7, 8), (2, 3, 4, 7, 9), (1, 3, 4, 8, 9), (1, 3, 6, 7, 9), (1, 4, 5, 7, 9), (2, 4, 5, 8, 9), (2, 3, 6, 8, 9), (0, 5, 6, 7, 8), (1, 5, 6, 8, 9), (2, 5, 6, 7, 9), (3, 5, 7, 8, 9), (4, 6, 7, 8, 9)]
  ) : 79826290487748680
• two_pivot_block_construction ( ) : 79825513069468800
• improved_linkage ( 5 ) : 79792266580227300
• multicomponent ( ) : 79792266580087251
• linkage_GLT ( 5 ) : 79792266297612002
• LMRD ( ) : 79792266297612001
• JohnsonLB ( ) : 11404336270905502
• HKK_lemma_2_4_lower_bound ( ) : 11403889293979007
• graham_sloane ( ) : 34040344854902
• sphere_covering ( ) : 29180910180199
• trivial_1 ( ) : 0

Upper bounds

• Ahlswede_Aydinian ( 0, 9 ) : 81702383234559648
• ilp_1 ( 1 ) : 81702383234559648
• ilp_4 ( 9 ) : 81702383234559648
• improved_johnson ( ) : 81702383234559648
• johnson_1 ( ) : 81702383234559648
• johnson_2 ( ) : 81702383234559648
• anticode ( ) : 81731562414097002
• ilp_2 ( 4 ) : 81731562414097002
• ilp_3 ( 6 ) : 81731562414097002
• linear_programming_bound ( ) : 81731562414097002
• singleton ( ) : 95347005938577702
• all_subs ( ) : 1602592475815614015216
• sphere_packing ( ) : 1602592475815614015216

Bound for codes containing the lifted MRD code

Do you have better bounds?