Let the triple $(n,k,d)$ be length and dimension and minimum distance of a code, respectively. For a fixed given numbers $n$, $k$ and $d$, what relations there are between BKLC$($GF(2)$,n,k)$ ,BLLC$($GF(2)$,k,d)$ and BDLC$($GF(2),$n,d)$? $$ BKLC(K, n, k)= BestKnownLinearCode(K, n, k)$$

(Given a finite field $K$, a positive integer $n$, and a non-negative integer $k$ such that $k\leq n$, return an $[n; k]$ linear code over $K$ which has the largest minimum weight among all known $[n; k]$ linear codes.)

$$BDLC(K, n, d)= BestDimensionLinearCode(K, n, d)$$

(Given a finite field $K$, a positive integer $n$, and a positive integer $d$ such that $d\leq n$, return a linear code over $K$ with length $n$ and minimum weight $> d$ which has the largest dimension among known codes.) $$BLLC(K, k, d)= BestLengthLinearCode(K, k, d)$$

(Given a finite field $K$, and positive integers $k$ and $d$, return a linear code over $K$ with dimension $k$ and minimum weight at least $d$ which has the shortest length among known codes.)

The definitions of BDLC$(K, n, d)$, BLLC$(K, k, d)$ and BKLC$(K, n, k)$ are from HANDBOOK OF MAGMA FUNCTIONS part 115.13, page 3582.

Answer to quid:

One of the reason that I asked this question, It is, In which conditions if $d$=BKLC$($GF(2),$n,k)$ then we have $n$=BLLC$($GF(2),$k,d)$ and $k$=BDLC$($GF(2),$n,d)$(there are three cases and I just assumed one case). For example we have $3$=BKLC$($GF(2),$15,11)$ and so we can see $15$=BLLC$($GF(2),$11,3)$ and $11$=BDLC$($GF(2),$15,3)$. In the next example we have $4$=BKLC$($GF(2),$15,9)$ but we can see $14$=BLLC$($GF(2),$9,4)$ and $10$=BDLC$($GF(2),$15,4)$.

In fact, at first I worked in this problem , If the generator matrix of a code be the form of $G=(I_n,A_{k_n})$ ,where $I_n$ is the identity matrix of order n and $A_{k_n}$ is the adjacency matrix of a complete graph of order n, do we have the mentioned condition for this code? For example for $n=5$, the generator of the matrix is in this form: $$ G:= \left[ \begin {array}{cccccccccc} 1&0&0&0&0&0&1&1&1&1 \\ 0&1&0&0&0&1&0&1&1&1\\ 0&0&1&0&0 &1&1&0&1&1\\0&0&0&1&0&1&1&1&0&1 \\ 0&0&0&0&1&1&1&1&1&0\end {array} \right] $$

With using $LinearCode(G)$ command in the MAGMA we see it is $[10,5,4]$ code that is accepts the above condition at the first paragraph. I mean we have $4$=BKLC$($GF(2),$10,5)$ and we can see $10$=BLLC$($GF(2),$5,4)$ and $5$=BDLC$($GF(2),$10,4)$.

In the last I want to thanks for your comments.

oneof the three parameters of a binary linear code given the two others, and gives an example for the optimum. I do not think there is any relation as such between these codes. $\endgroup$