Details for entry \(A_5(19,6;4)\)

Lower bounds

• construction_1 ( ) : 931382754516919449056
• CKMP2019_Cor_42 ( (15, 4) ) : 931382754516916406251
• CKMP2019_Lem_41 ( (15, 4) ) : 931382754516916406251
• generalized_linkage ( 15,0 ) : 931382754516916406251
• generalized_linkage_multipleblocks ( show
  [15, 4],[0, 0]
  ) : 931382754516916406251
• improved_linkage ( 15 ) : 931382754516916406251
• linkage_GLT ( 15 ) : 931382754516916406251
• construction_ST_A_1 ( ) : 931382303436594136556
• ef_computation ( show
  [(0, 1, 2, 3), (2, 4, 5, 6), (3, 5, 7, 8), (0, 4, 7, 9), (1, 6, 7, 10), (0, 6, 8, 11), (2, 8, 9, 10), (1, 5, 9, 11), (1, 4, 8, 12), (3, 4, 10, 11), (3, 6, 9, 12), (0, 5, 10, 12), (2, 7, 11, 12), (8, 13, 14, 15), (2, 13, 16, 17), (12, 14, 16, 18), (5, 15, 17, 18)]
  ) : 931382297895751968781
• multicomponent ( ) : 931382183075195313126
• LMRD ( ) : 931322574615478515625
• LiuChangFeng2019_Theo_2_6 ( ) : 931322574615478515625
• sphere_covering ( ) : 1166672185063078977
• graham_sloane ( ) : 12537837079756511
• HKK_lemma_2_4_lower_bound ( ) : 769092190630
• trivial_1 ( ) : 0

Upper bounds

• improved_johnson ( ) : 940337780989084093891
• Ahlswede_Aydinian ( 2, 2 ) : 940337780989084093900
• anticode ( ) : 940337780989084093900
• ilp_1 ( 1 ) : 940337780989084093900
• ilp_2 ( 2 ) : 940337780989084093900
• johnson_1 ( ) : 940337780989084093900
• linear_programming_bound ( ) : 940337780989084093900
• singleton ( ) : 1212659602354367574056
• ilp_4 ( 18 ) : 23508444478877375591024
• johnson_2 ( ) : 23508444478877375591024
• HKK_lemma_2_4_upper_bound ( ) : 45929628102295568336440211952
• sphere_packing ( ) : 191618801388443830637911574709
• ilp_3 ( 6 ) : 2242801165886838335773497751173033537
• all_subs ( ) : 1140309639573011101895655235126656614303556

Bound for codes containing the lifted MRD code

Do you have better bounds?