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

Lower bounds

• echelon_ferrers ( show
  not optimal [(0, 1, 2, 3, 4), (0, 1, 2, 5, 8, 9), (0, 1, 5, 6, 7), (0, 3, 4, 5, 6, 7, 8, 9), (1, 2, 4, 6, 7, 8), (1, 3, 6, 8, 9), (2, 3, 5, 6), (4, 5, 8), (7, 9)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 33004 with not optimal [(0, 1, 2, 3, 4), (0, 1, 2, 6, 7, 9), (0, 1, 3, 5, 8, 9), (0, 2, 5, 6, 8), (0, 3, 4, 5, 6, 7, 9), (0, 4, 7, 8), (1, 2, 4, 5, 7, 8, 9), (1, 3, 6, 7, 8), (1, 4, 5, 6), (2, 3, 4, 6, 8, 9), (2, 3, 5, 7), (9,)])
  ) : 32966
• 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)] (if conjecture about Ferrers Diagram Rank-Metric Codes is true: 33004)
  ) : 32940
• improved_cdc_lower_bound ( ) : 32925
• layer_construction ( ) : 32925
• cdc_lower_bound ( ) : 32923
• cdc_average_argument ( ) : 12100
• gilbert_varshamov ( ) : 397
• trivial_4 ( ) : 2
• trivial_2 ( ) : 0

Upper bounds

• johnson_MDC_Lemma_2 ( ) : 48104
• heinlein_ihringer_semidefinite_programming ( ) : 48255
• Etzion_Vardy_ilp ( ) : 48336
• Ahlswede_Aydinian_ilp ( ) : 48394
• improved_cdc_upper_bound ( ) : 48394
• cdc_upper_bound ( ) : 48398
• semidefinite_programming ( ) : 49394
• relax_d ( ) : 1705394
• trivial_3 ( ) : 229755605

Do you have better bounds?