Details for entry \(A_9(7,4;3)\)

Lower bounds

• construction_HK15 ( ) : 43112403
• construction_honold ( ) : 43112321
• construction_1 ( ) : 43054183
• pending_dots ( show
  optimal [(0, 1, 2), (0, 3, 4), (0, 3, 5), (0, 5, 6), (1, 3, 6), (1, 4, 5), (2, 4, 6)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 43054183 with optimal [(0, 1, 2), (0, 3, 4), (0, 3, 5), (0, 5, 6), (1, 3, 6), (1, 4, 5), (2, 4, 6)])
  ) : 43054183
• echelon_ferrers ( show
  optimal [(0, 1, 2), (0, 3, 4), (0, 5, 6), (1, 3, 5), (1, 4, 6), (2, 3, 6), (2, 4, 5)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 43054111 with optimal [(0, 1, 2), (0, 3, 4), (0, 5, 6), (1, 3, 5), (1, 4, 6), (2, 3, 6), (2, 4, 5)])
  ) : 43054111
• ef_computation ( show
  [(0, 1, 2), (0, 3, 4), (1, 3, 5), (2, 3, 6), (2, 4, 5), (1, 4, 6), (0, 5, 6)]
  ) : 43054111
• two_pivot_block_construction ( ) : 43053283
• JohnsonLB ( ) : 43047714
• JohnsonLB_special ( ) : 43047714
• generalized_linkage ( 3,1 ) : 43047451
• generalized_linkage_multipleblocks ( show
  [3, 4],[0, 1]
  ) : 43047451
• improved_linkage ( 3 ) : 43047451
• multicomponent ( ) : 43047451
• CKMP2019_Cor_42 ( (3, 4) ) : 43046722
• CKMP2019_Lem_41 ( (3, 4) ) : 43046722
• linkage_GLT ( 3 ) : 43046722
• LMRD ( ) : 43046721
• LiuChangFeng2019_Theo_2_6 ( ) : 43046721
• graham_sloane ( ) : 538813
• HKK_lemma_2_4_lower_bound ( ) : 538011
• sphere_covering ( ) : 479676
• trivial_1 ( ) : 0

Upper bounds

• Ahlswede_Aydinian ( 1, 2 ) : 43644583
• anticode ( ) : 43644583
• ilp_1 ( 1 ) : 43644583
• ilp_2 ( 2 ) : 43644583
• improved_johnson ( ) : 43644583
• johnson_1 ( ) : 43644583
• linear_programming_bound ( ) : 43644583
• singleton ( ) : 49031983
• ilp_4 ( 5 ) : 388543238
• johnson_2 ( ) : 388543238
• ilp_3 ( 4 ) : 392854472
• all_subs ( ) : 322140667123
• sphere_packing ( ) : 322140667123

Bound for codes containing the lifted MRD code

Do you have better bounds?