Details for entry \(A_4(10,5)\)

Lower bounds

• echelon_ferrers ( show
  optimal [(0, 1, 2, 3, 4), (0, 1, 2, 5, 8, 9), (0, 1, 5, 6, 7), (0, 2, 3, 6, 7, 8, 9), (0, 3, 4, 5, 7, 9), (1, 2, 4, 6, 7, 9), (1, 3, 7, 8), (2, 3, 5, 6), (4, 5, 8)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 1073754267 with optimal [(0, 1, 2, 3, 4), (0, 1, 2, 5, 8, 9), (0, 1, 5, 6, 7), (0, 2, 4, 6, 7, 9), (0, 3, 4, 5, 7, 8), (0, 3, 6, 8, 9), (1, 2, 3, 4, 5, 6, 7, 8, 9), (1, 3, 7, 9), (1, 4, 6, 8), (2, 3, 5, 6), (2, 7, 8), (4, 5, 9)])
  ) : 1073754129
• ef_computation ( show
  [(0, 1, 2, 3, 4), (0, 1, 2, 6, 7, 9), (1, 4, 5, 6), (0, 2, 5, 6, 8), (2, 3, 5, 7), (0, 1, 3, 5, 8, 9), (0, 3, 4, 6, 7, 8), (0, 4, 5, 7, 9), (3, 6, 9), (1, 7, 8), (1, 2, 3, 4, 5, 6, 7, 8, 9), (2, 4, 8, 9)]
  ) : 1073746980
• improved_cdc_lower_bound ( ) : 1073745962
• layer_construction ( ) : 1073745962
• cdc_lower_bound ( ) : 1073745960
• cdc_average_argument ( ) : 83853734
• gilbert_varshamov ( ) : 254516
• trivial_4 ( ) : 2
• trivial_2 ( ) : 0

Upper bounds

• heinlein_ihringer_semidefinite_programming ( ) : 1122729102
• improved_cdc_upper_bound ( ) : 1122731055
• cdc_upper_bound ( ) : 1122731059
• relax_d ( ) : 1194101275238
• trivial_3 ( ) : 2463333456292207

Do you have better bounds?