 Research
 Open Access
 Published:
On the linear programming bound for linear Lee codes
SpringerPlus volume 5, Article number: 246 (2016)
Abstract
Based on an invariancetype property of the Leecompositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field \({\mathbb {F}}_{q}\) on the set of Leecompositions. We show some useful properties of certain sums of Leenumbers, which are the eigenvalues of the Lee association scheme, appearing in the linear programming problem of linear Lee codes. Using the additional equality constraints, we formulate the linear programming problem of linear Lee codes in a very compact form, leading to a fast execution, which allows to efficiently compute the bounds for large parameter values of the linear codes.
Background
Finding the largest code (in cardinality) with a given length and minimum distance is one of the most fundamental problems in coding theory. The most wellknown upper bounds for the Hamming metric are the Hamming bound, Plotkin bound, Singleton bound and Elias bound, and these bounds have been formulated for the Lee metric also, although the expressions are slightly more complicated. Delsarte (1973) introduced association schemes to coding theory to deal with topics involving the inner distribution of a code. An important approach arises from association schemes to the problem of determining the upper bound for the size of a code, namely the linear programming approach. The asymptotically best upper bound in the Hamming metric is the McEliece–Rodemich–Rumsey–Welch bound, see McEliece et al. (1977), which is based on the linear programming approach, and gives a substantial improvement to the earlier best upper bound, which is the Elias bound. In the Hamming metric, the distance relations between codewords directly define an association scheme, but in the Lee metric, the distance relations between the Leecompositions define the association scheme. The Lee association scheme and linear programming bounds for Lee codes have been discussed by Astola (1982a), Solé (1988), and Tarnanen (1982). Generalizing to finite Frobenius rings, the linear programming bound for codes equipped with homogeneous weight, including the Lee weight on \({{\mathbb {Z}}}_{4}\), has been studied by Byrne et al. (2007).
We denote \({\mathbb {Z}}_q^n = \{{\mathbf {x}} = [x_1,\ldots ,x_n] x_i\in \{0,1,\ldots ,q1\}\}\) the set of length n vectors having \(q\)ary elements. The Hamming distance between two vectors \({\mathbf {x}}, {\mathbf {y}}\in {\mathbb {Z}}_q^n\) is \(d_H({\mathbf {x}}, {\mathbf {y}}) = \{i \mid x_{i}\ne y_{i}\}\), and penalizes equally any nonzero error between the components of \(\mathbf {x}\) and \(\mathbf {y}\), being a natural measure for errors in many communication channels. However, in communication channels with phase modulation, where the symbols \(0,1,\ldots ,q1\) are transmitted as phases \(0,{2\pi \over q},\ldots ,(q1){2\pi \over q}\), the errors are measured as the shortest distance between the symbols along the unit circle and hence we consider in the following the error between two symbols \(i,j\in {\mathbb {Z}}_q\) to be defined as the Lee distance \(d_L(i,j) = \min (ij,qij)\), which was introduced by Lee (1958). The Lee distance between two vectors \({\mathbf {x}}, {\mathbf {y}}\in {\mathbb {Z}}_q^n\) is defined as
The Lee weight of one symbol \(j\in {\mathbb {Z}}_q\) is \(w_L(j) = \min (j,qj)\) and that of one vector \({\mathbf {x}}\in {\mathbb {Z}}_q^n\) is \(w_L({\mathbf {x}}) = d_L({\mathbf {0}},{\mathbf {x}})\). The number of components of the vector \({\mathbf {x}}\in {{\mathbb {Z}}}_q^n\) having the Lee weight equal to i is denoted \(l_i(\mathbf {x})\) and, since \(l_i({\mathbf {x}}) = l_{qi}({\mathbf {x}})\), only \(s= \lfloor {q\over 2}\rfloor\) such numbers describe completely the distribution of the Lee weights of the elements of \(\mathbf {x}\). This distribution, denoted \(l(\mathbf {x})\), is called the Leecomposition of \(\mathbf {x}\), defined as:
We denote \({\mathcal{L}}_q^n = \{{\mathbf {t}}_0,\ldots ,{\mathbf {t}}_{\alpha }\} = \{l({\mathbf {x}}) {\mathbf {x}} \in {\mathbb {Z}}_q^n \}\) the set of distinct Leecompositions, where \((\alpha +1)\) is their number, and we reserve the notation \({\mathbf {t}}_0\) for \(l({\mathbf {0}})=[n,0,\ldots ,0]\).
A code is defined as a subset of vectors of \({\mathbb {Z}}_q^n\). Keeping with the communication scenario, only the codewords belonging to the code C are sent as messages over the communication channel, say the codeword \({\mathbf {x}}\in C\) is sent and is corrupted due to communication errors, being received as a different vector, \({\mathbf {z}} \in {\mathbb {Z}}_q^n\). If the minimum distance d between all codewords of C is \(2e+1\), then all the spheres \(\{{\mathbf {y}} d_L({\mathbf {x}},{\mathbf {y}}) \le e, {\mathbf {x}} \in C\}\) around each codeword \({\mathbf {x}} \in C\) are nonintersecting, and the received vector \({\mathbf {z}}\) can be correctly decoded if \(d_L({\mathbf {z}},{\mathbf {x}}) \le e\). When designing codes C, the minimum distance d of the code is imposed as an initial requirement. The goal is then to design a code having the largest number of codewords, so that one can send reliably as many messages as possible, with the guarantee of correcting errors of Lee weight smaller than or equal to e. Since the problem of designing the largest codes is not solved yet in general, finding upper bounds on the size of the code C for a given d is considered one of the major problems in information theory. For example when new codes are proposed, comparing their size against the known upper bounds allows to prove their optimality if they achieve the upper bounds.
In the case of Lee distance, the constraints that need to be satisfied by an error correcting code with a given distance d can be conveniently analyzed using the association scheme introduced by Delsarte (1973). The scheme has \(\alpha +1\) relations denoted \(K_{{\mathbf {t}}_0}, \ldots , K_{{\mathbf {t}}_\alpha }\), where \(({\mathbf {x}}, {\mathbf {y}})\) belongs to \(K_{{\mathbf {t}}_i}\) if \(l({\mathbf {x}} {\mathbf {y}}) = {\mathbf {t}}_i\), with \({\mathbf {x}}, {\mathbf {y}}\in {{\mathbb {Z}}}_q^n\) and \({\mathbf {t}}_i\in {\mathcal{L}}_q^n\).
Introduce the inner distribution of the code C as
where C denotes the cardinality of the set C, and in particular \(B_{{\mathbf {t}}_0}=1\). Hence the desired quantity to be optimized for a code, its cardinality C, can be simply expressed in terms of the variables \(B_{{\mathbf {t}}_i}\) as
The fundamental result of the association scheme introduced by Delsarte (1973) is the formulation of the linear constraints between the variables \(B_{{\mathbf {t}}_i}\), using as coefficients the socalled Leenumbers, which are the eigenvalues of the Lee association scheme. Let \(\xi = exp(2\pi \sqrt{1}/q)\). The Leenumber \(L_{\mathbf {t}}(\mathbf {u})\) with \({\mathbf {t}},{\mathbf {u}}\in {\mathcal{L}}_q^n\) can be computed as follows: take any vector \(\mathbf {v}\) having the Leecomposition \({\mathbf {u}} = l({\mathbf {v}})\) and compute (see Astola 1982b)
The linear inequality constraints between the variables \(B_{{\mathbf {t}}_i}\) are then expressed as (see Astola 1982b):
where \(\genfrac[]{0.0pt}{}{n}{\mathbf {k}}={n \atopwithdelims (){\mathbf {k}}}2^{nk_{0}}\) for \(q=2s+1\), and \({n \atopwithdelims ()\mathbf {k}}\) is the multinomial coefficient \({n\atopwithdelims ()k_{0},\ldots ,k_{s}}\).
With these constraints, the cardinality \(\sum _{{\mathbf {t}}_i \in {\mathcal{L}}_q^n} B_{{{\mathbf {t}}}_i} = C\) of any code can be upper bounded by solving a linear programming problem, as stated in the following (see Astola 1982b). Let \(B_{\mathbf {t}}^{*}, \ {\mathbf {t}}\in \left\{ {\mathbf {t}}_{1}, \ldots ,{\mathbf {t}}_{\alpha }\right\}\) be an optimal solution of the linear programming problem
where \(I = \{i\mid l({\mathbf {x}})={\mathbf {t}}_{i} \Rightarrow w_{L}({\mathbf {x}})\ge d\}\). Then \(1+\sum _{i=1}^{\alpha } B_{{\mathbf {t}}_{i}}^{*}\) is an upper bound to the size of the code C with the minimum distance d.
We have previously shown that in the case of linear Lee codes we can use the following sharpening of the linear programming problem (see Astola and Tabus 2015). Let \(B_{\mathbf {t}}^{*}, \ {\mathbf {t}}\in \left\{ {\mathbf {t}}_{1}, \ldots ,{\mathbf {t}}_{\alpha }\right\}\) be an optimal solution of the linear programming problem
where \(\tau ({\mathbf {t}}_{i})\) is the set of Leecompositions that are obtained when the vectors \(\mathbf {x}\) having the Leecomposition \({\mathbf {t}}_{i}\) are multiplied by all \(r\in {\mathbb {F}}_{q}\backslash \{0\}\), and \(I = \{i\mid l({\mathbf {x}})={\mathbf {t}}_{i} \Rightarrow w_{L}({\mathbf {x}})\ge d\}\), i.e., the indices of those Leecompositions corresponding to vectors of Lee weight \(\ge d\). Then \(1+\sum _{i=1}^{\alpha } B_{{\mathbf {t}}_{i}}^{*}\) is an upper bound to the size of the code C with the minimum distance d.
The above sharpening is based on an invariancetype property of the Leecompositions of a linear code. In the Hamming metric, multiplying codewords by a constant does not change the weight of the codewords. However, in the Lee metric, multiplication typically changes the Leecomposition of the codeword and so also usually the Lee weight. With linear codes, since they are linear subspaces of vector spaces, all the multiplied versions of any codeword also belong to the code. The authors have previously shown that there are as many codewords having the Leecomposition of a given codeword \(\mathbf {x}\) as there are codewords having the Leecomposition of \(r\mathbf {x}\) that is obtained by multiplication of the given codeword \(\mathbf {x}\) by some constant r (see Astola and Tabus 2015).
In this paper, we formulate this property of Leecompositions of a linear Lee code in terms of an action of the multiplicative group of the field \({\mathbb {F}}_{q}\) on the set of Leecompositions. This formulation gives theoretical tools for studying the Leecompositions and linear Leecodes. For simplicity, we let q be prime, \({\mathbb {F}}_{q}^{n}=\{{\mathbf {x}}\mid x_{i}\in {\mathbb {F}}_{q},i=1,\ldots ,n\}\). In addition, we show some useful properties of certain sums of Leenumbers. Using the equality constraints introduced by Astola and Tabus (2015) and the properties of certain sums of Leenumbers, we may compact the set of variables and linear constraints in the linear programming problem, and perform all computations with rational numbers. Compacting the problem leads to a faster execution, which allows to efficiently compute the bounds for large parameter values.
The group action
In the paper by Astola and Tabus (2015), a mapping \(\tau (\mathbf {t})\) that maps the Leecomposition \(\mathbf {t}\) into the set of Leecompositions, which are obtained from \(\mathbf {t}\) by multiplication of vectors having the Leecomposition \(\mathbf {t}\) by all \(r\in \{1,\ldots ,q1\}\), was defined in the following way:
where
The mapping of the Leecompositions can be formulated in terms of a group action.
Definition 1
If G is a group and X is a set, then a group action \(\varphi\) of G on X is a function
that satisfies the following conditions for all \(x\in X\):

1.
\(\varphi (e,x) = x\), where e is the identity element of G (identity).

2.
\(\varphi (g,\varphi (h,x))=\varphi (gh,x)\) for all \(g,h\in G\) (compatibility).
For notational reasons, denote in the following the set of Leecompositions \({\mathcal{L}}_q^n\) as \(\{\rho ^{(0)},\ldots ,\rho ^{(\alpha )}\}\). Now, let us define the function \(\varphi\) as follows. Denote by \({\mathbb {F}}_{q}^{*}\) the multiplicative group of the field \({\mathbb {F}}_{q}\).
where
where
Lemma 1
The function \(\varphi\) is a group action of \({\mathbb {F}}_{q}^{*}\), where q is prime, on the set \(\{\rho ^{(0)},\ldots ,\rho ^{(\alpha )}\}\) of Leecompositions.
Let us show that the above function \(\varphi\) is in fact a group action. Clearly the identity property is satisfied as
The compatibility property requires that \(\varphi (r_{1},\varphi (r_{2},\rho ^{(i)})) = \varphi (r_{1}\cdot r_{2}, \rho ^{(i)})\), where \(r_{1},r_{2}\in {\mathbb {F}}_{q}^{*}\). Let us write
Then,
Now,
Therefore, we need to show that \(\pi _{r_{1}(\pi _{r_{2}(l)})}= \pi _{r_{1}\cdot r_{2}(l)}\).
Now,
We need to prove that \(k_{2}=k_{3}\).
Proof
We have two cases. If \(1\le k_{1} \le s\) we have
and since q is prime and \(s\le k_{2},k_{3}\le s\) it must be that \(k_{2}=k_{3}\).
If \(s\le k_{1} <0\) we have
and since q is prime and \(s\le k_{2},k_{3}\le s\) it must be that \(k_{2}=k_{3}\). \(\square\)
The action of \({\mathbb {F}}_{q}^{*}\) on the set of Leecompositions partitions the set into equivalence classes, which are called orbits. So, the orbit of an element \(\rho ^{(i)}\) is
Clearly there is a correspondence between \(\tau ({\mathbf {t}}_{i})\) and the orbits \(Orb(\rho ^{(i)})\), i.e., the sets \(\tau ({\mathbf {t}})\) are the orbits of the above group action. Therefore, the theory of group actions can be used for studying the Leecompositions and the linear programming problem, e.g., for the compact problem that we introduce in this paper, the orbitcounting theorem (see, for instance, Burnside 1897) can be used for determining the complexity of the problem as the number of orbits equals the number of variables in the compact problem.
Properties of certain sums of Leenumbers
In this section we study certain sums of Leenumbers, where the Leenumbers are taken over Leecompositions belonging to a given orbit. We show that this type of a sum is rational as opposed to the Leenumbers, which in many cases are irrational numbers, and that it satisfies certain equality constraints.
Since the values of the coefficients of the inner distribution are equal for all compositions in \(\tau ({\mathbf {t}}_{i})\), we will have in (5) sums of the form
Therefore, for each coefficient \(B_{{\mathbf {t}}_{i}}\) we are computing a sum of Leenumbers, where the Leenumbers are taken over the Leecompositions belonging to \(\tau ({\mathbf {t}}_{i})\).
Let us introduce the following lemma.
Lemma 2
Let \(\tau ({\mathbf {t}}_{i})= \{{\mathbf {t}}_{i_{1}}, \ldots ,{\mathbf {t}}_{i_{u}}\}\). Then the sum
is a rational number.
Proof
First, we want to change each term \(L_{\mathbf {k}}({\mathbf {t}}_{i})\) into \(L_{{\mathbf {t}}_{i}}({\mathbf {k}})\). There is the following relationship between the Leenumbers \(L_{\mathbf {k}}(\mathbf {t})\) and \(L_{\mathbf {t}}(\mathbf {k})\) (see Astola 1982b):
where the coefficient \(\genfrac[]{0.0pt}{}{n}{\mathbf {t}}\) corresponds to the number of vectors in \({\mathbb {F}}_{q}^{n}\) for which the Leecomposition is \(\mathbf {t}\) (see Astola 1982b). Hence, we can write (6) as
Now, we notice that since all \({\mathbf {t}}_{i}\) belong to the same \(\tau\), they are permutations of each other. This means that the coefficients \(\genfrac[]{0.0pt}{}{n}{{\mathbf {t}}_{i}}\) are all equal and (6) takes the form
where \(\genfrac[]{0.0pt}{}{n}{{\mathbf {k}}}/\genfrac[]{0.0pt}{}{n}{{\mathbf {t}}_{i_{1}}}= 1\) if \({\mathbf {k}}\in \tau ({\mathbf {t}}_{i})\), and a rational number otherwise.
Now, using Eq. (1), we can write the sum in parentheses above as
where u is the cardinality of \(\tau ({\mathbf {t}}_{i})\) and \(l({\mathbf {v}})={\mathbf {k}}\).
Since the Leenumbers \(L_{{\mathbf {t}}_{i}}({\mathbf {k}})\) correspond to compositions according to \(\tau\), then for each vector \({\mathbf {x}}\), the sum in (8) includes all the vectors \(r{\mathbf {x}}\), where \(r\in \{1,\ldots ,q1\}\). Also, each vector can only have one Leecomposition and thus can appear in only one of the sums in (8).
We may now rearrange and group the terms in (8) as
This forms a partition of the set of vectors having a Leecomposition in \(\tau ({\mathbf {t}}_{i})\), since the relation \({\mathcal {R}}\) defined as \(({\mathbf {x}},{\mathbf {y}})\in {\mathcal {R}}_{x}\) iff \({\mathbf {x}}=r{\mathbf {y}}\), \(r\in \{1,\ldots ,q1\}\) is clearly an equivalence relation.
Therefore, we can group the sum into m parts, each having \(q1\) terms. We now take one such part:
and write it as
If \({\mathbf {v}}\cdot {\mathbf {x}}_{i}=0\) it equals \(q1\), otherwise, we have a sum of the form
So (8) is a sum of the form \(m_{1}(q1)+m_{2}(1)\), where \(m_{1}\) and \(m_{2}\) are integers \(\ge 0\) such that \(m=m_{1}+m_{2}\). \(\square\)
Furthermore, we notice that when we look at the sums
where u is the cardinality of \(\tau ({\mathbf {t}}_{i})\) and \(u'\) is the cardinality of \(\tau ({\mathbf {k}}_{i})\), they all turn out be equal.
Lemma 3
For \({\mathbf {t}}_{i_{1}},\ldots ,{\mathbf {t}}_{i_{u}}\in \tau ({\mathbf {t}}_{i})\) and \({\mathbf {k}}_{i},{\mathbf {k}}_{i'}\in \tau ({\mathbf {k}}_{i})\),
Proof
First, we transform these sums using (7) into sums of the following form
Now we notice that since the Leecompositions \({\mathbf {k}}_{i}\) and \({\mathbf {k}}_{i'}\) both belong to \(\tau ({\mathbf {k}}_{i})\), the coefficients in front of the sums are all equal. What remains to show is that the sums \((L_{{\mathbf {t}}_{i_{1}}} ({\mathbf {k}}_{i})+L_{{\mathbf {t}}_{i_{2}}}({\mathbf {k}}_{i})+\cdots +L_{{\mathbf {t}}_{i_{u}}} ({\mathbf {k}}_{i}))\) and \((L_{{\mathbf {t}}_{i_{1}}}({\mathbf {k}}_{i'}) + L_{{\mathbf {t}}_{i_{2}}}({\mathbf {k}}_{i'})+\cdots +L_{{\mathbf {t}}_{i_{u}}}({\mathbf {k}}_{i'}))\) are equal. To show this, we rearrange both sums as we did in the previous proof to obtain sums of the following form. For the first sum we have
where \(l({\mathbf {v}})={\mathbf {k}}_{i}\) and \(l({\mathbf {x}}_{i}) = {\mathbf {t}}_{i}\).
Now, since the Leecompositions \({\mathbf {k}}_{i}\) and \({\mathbf {k}}_{i'}\) belong to \(\tau ({\mathbf {k}}_{i})\), we obtain the vectors having the Leecomposition \({\mathbf {k}}_{i'}\) from the vectors having the Leecomposition \({\mathbf {k}}_{i}\) by multiplication by some r. Therefore, for the second sum we have
Now
since if \({\mathbf {v}}\cdot {\mathbf {x}}_{i}=0\), they are both equal to \(q1\), and otherwise each exponent is distinct. Therefore, the sums are equal. \(\square\)
The compact linear programming problem
The additional equalities for linear Lee codes in (4) can be used for compacting the set of linear constraints in the linear programming problem of linear Lee codes. We enforce (3) by replacing all variables \(B_{{\mathbf {t}}_{j}}\) for \({\mathbf {t}}_{j}\in \tau ({\mathbf {t}}_{i})\) with a single variable \(\gamma _{i}\), so that \(\gamma _{i}=B_{{\mathbf {t}}_{j}}\) for all \({\mathbf {t}}_{j}\in \tau ({\mathbf {t}}_{i})\).
We notice that by replacing the \(\alpha\) variables \(B_{{\mathbf {t}}_1},\ldots ,B_{{\mathbf {t}}_\alpha }\) of the linear programming problem with the set of variables \(\gamma _1,\ldots ,\gamma _{\kappa }\), where \(\kappa\) is the number of orbits, i.e., the number of different sets \(\tau _{i}\), we are eliminating the equality constraints from the sharpened linear programming problem. Let us denote by \(\Upsilon\) a matrix, where we have listed all the Leenumbers as
Let \(\mathbf {A}\) be an \(\alpha \times \kappa\) matrix of the form
where the number of rows inside each partition corresponds to the cardinalities of the sets \(\tau _{i}\).
We introduce the vector \(\varvec{\gamma } =(\gamma _0,\gamma _1,\ldots ,\gamma _\kappa )\) and formulate the linear programming problem equivalent to (3):
where \(I = \{i\mid \forall {\mathbf {t}}\in \tau _{i} : l({\mathbf {x}})={\mathbf {t}} \Rightarrow w_{L}({\mathbf {x}})\ge d\}\), i.e., the indices of those sets \(\tau _{i}\), where all Leecompositions correspond to vectors of Lee weight \(\ge d\).
The cardinalities \(\tau _i \) appear in the criterion of the problem since the initial criterion expressed in terms of the variables \(B_{{\mathbf {t}}_1},\ldots ,B_{{\mathbf {t}}_\alpha }\) is \({\mathbf {1}}^T {\mathbf {B}}\), where \(\mathbf {1}\) is the all one vector and \({\mathbf {B}}=[B_{{\mathbf {t}}_1},\ldots ,B_{{\mathbf {t}}_\alpha }]^{T}\), and the criterion in the new variables is \({\mathbf {1}}^T {\mathbf {A}} \varvec{\gamma }\), where the new vector of coefficients, \({\mathbf {1}}^T {\mathbf {A}}\), will have as elements the size of the partitions of \({\mathbf {A}}\), which are equal to the cardinalities of the sets \(\tau _i\).
Additionally we notice that the matrix \({\mathcal{U}} = \Upsilon {\mathbf {A}}\) can be seen to have the partition structure similar to that of A,
where the matrix \(\Phi =[\Phi ]_{i,j}\) is \(\kappa \times \kappa\) and the rows in a partition correspond to the Leecompositions belonging to the same set \(\tau _i\). Inside a partition the rows of the matrix \(\mathcal{U}\) are identical, due to Lemma 3, since the columns of \(\mathcal{U}\) inside a partition have the following elements
where \(\tau _{{\mathbf {k}}_{i}}=u'\) and \(\tau _{{\mathbf {t}}_{i}}=u\). This leads to a repeated inequality constraint. In order to remove this redundancy, we select from the matrix \(\mathcal{U}\) only one row per partition block, keeping thus only the nonredundant inequalities. This is just the matrix \(\Phi\), and we may replace the inequality constraints \(\Upsilon {\mathbf {A}} \varvec{\gamma } \ge 0\) with \(\Phi \varvec{\gamma } \ge 0\). In addition, due to Lemma 2, each element of \(\Phi\) is a rational number, and the Leenumbers can be computed recursively with integers using the recursive formula given by Astola and Tabus (2013). Hence, we can perform all computations using integers instead of irrationals.
In Tables 1, 2, 3 and 4 there are numerical results for the linear programming bounds for linear Lee codes with \(q=5,7,13,17\). The bounds were computed using the above compact linear programming bound for linear Lee codes and compared to the general linear programming bound given by (2). Italics indicates an improvement and * indicates a tight bound.
In Tables 1, 2, 3 and 4, the computation time is also shown for each n. When computing the sharpened linear programming bound by giving additional equality constraints to the linear programming solver, more computation time is required for given parameters than with the general linear programming problem given by (2), since the linear programming solver is given a larger set of overall constraints. However, using the compact problem introduced in this paper reduces the computation time significantly, since there are less variables and constraints and all computations can be performed with rational numbers. For example, on an Apple iMac 5K (late 2014) with Intel Core i7 (I74790K), 32 gigabytes of memory, and a 64bit operating system OS X Yosemite, and using the linprog linear programming solver of Matlab, for \(q=17\) and \(n=5\), computing the regular linear programming bounds took approximately 17 min and computing the sharpened bounds by using additional equality constraints took over 5 h. When using the compact problem, the computation time was less than 20 s, including computation of the new sets of constraints from the Leenumbers according to the sets \(\tau ({\mathbf {t}})\), which is a significant improvement and makes it possible to compute the bounds for larger parameter values in a reasonable time. The Leenumbers were computed separately, and computing them recursively for \(q=17\) and \(n=2,\ldots ,6\) took approximately 1 min.
The obtained bounds can be used for identifying optimal codes. Consider the bound for k given in Table 4 with \(q=17\), \(n=5\) and \(d=7\), which is 2. This means that the maximum number of codewords in a linear code with these parameters is at most 289. The code having the generator matrix
is a [5, 2]code with the minimum distance 7 and has \(17^2=289\) codewords, therefore, it is an optimal linear code for the above parameters.
Conclusions
In this paper, we formulated the invariancetype property of Leecompositions introduced by Astola and Tabus (2015) in terms of an action of the multiplicative group of the field \({\mathbb {F}}_{q}\) on the set of Leecompositions. This formulation is useful in the theoretical study of Leecompositions and linear Lee codes. In addition, we have shown some useful properties of certain sums of Leenumbers that appear in the constraints of the linear programming problem of linear Lee codes. Based on the equality constraints and these properties, we constructed a more compact linear programming problem for linear Lee codes, leading to a fast execution and allowing all computations to be performed using integers. This leads in practice to having available upper bounds for codes with parameters higher than available up to now.
References
Astola H, Tabus I (2013) Bounds on the size of Leecodes. In: 8thInternational symposium on image and signal processing and analysis,Trieste, Italy, pp 464–469
Astola H, Tabus I (2015) Sharpening the linear programming bound for linear Leecodes. Electron Lett 51(6):492–494. doi:10.1049/el.2014.4300
Astola J (1982a) The Leescheme and bounds for Leecodes. Cybern Syst 13(4):331–343. doi:10.1080/01969728208927711
Astola J (1982b) The theory of Leecodes. Lappeenranta University of Technology, Department of Physics and Mathematics, Research Report 1/1982
Burnside W (1897) Theory of groups of finite order. Cambridge University Press, Cambridge
Byrne E, Greferath M, O’Sullivan ME (2007) The linear programming bound for codes over finite Frobenius rings. Des Codes Cryptogr 42(3):289–301
Delsarte P (1973) An algebraic approach to the association schemes of coding theory. Philips research reports: Supplements 10
Lee CY (1958) Some properties of nonbinary errorcorrecting codes. IRE Trans Inf Theory 4(2):77–82
McEliece R, Rodemich E, Rumsey H, Welch L (1977) New upper bounds on the rate of a code via the Delsarte–MacWilliams inequalities. IEEE Trans Inf Theory 23(2):157–166
Solé P (1988) The Lee association scheme. In: Cohen G, Godlewski P (eds) Coding theory and applications. Lecture notes in Computer science, vol 311. Springer, Berlin, pp 45–55. doi:10.1007/3540193685_5
Tarnanen H (1982) An approach to constant weight and Lee codes by using the methods of association schemes. Publications of University of Turku: Annales universitatis turkuensis. Series A I: Astronomicachemicaphysicamathematica. University of Turku, Turku
Authors’ contributions
Both authors read and approved the final manuscript.
Competing interests
The authors declare that they have no competing interests.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Astola, H., Tabus, I. On the linear programming bound for linear Lee codes. SpringerPlus 5, 246 (2016). https://doi.org/10.1186/s4006401618638
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s4006401618638
Keywords
 Lee codes
 Linear codes
 Linear programming bound
 Leecompositions
 Leenumbers