login
a(n) = minimum L such that a ternary linear code of length L, dimension 6, and minimum distance n exists.
0

%I #10 May 22 2022 16:40:15

%S 6,7,9,10,11,12,15,17,18,20,21,22,24,25,26,29,30,31

%N a(n) = minimum L such that a ternary linear code of length L, dimension 6, and minimum distance n exists.

%C In other words, such that an [L,6,n]_3 code exists. In coding theory n usually denotes the length of the code, but OEIS conventions force us to use this nonstandard notation.

%C Sawashima-Maruta give a table for n <= 360 with only a few gaps, the first being at n = 19. It is known that a(19) is 33 or 34.

%D Sawashima, Toshiharu, and Tatsuya Maruta. "Nonexistence of some ternary linear codes." Discrete Mathematics 344.11 (2021): #112572.

%K nonn,more

%O 1,1

%A _N. J. A. Sloane_, Oct 31 2021