The linear programming bound for codes over finite Frobenius rings (Q2384000)

In traditional algebraic coding theory the linear-programming bound on \(A_q(n,d)\) (based on linear programming techniques) is one of the most powerful and restrictive bounds for both linear and nonlinear codes. The authors develop a linear-programming bound for block codes on finite Frobenius rings. They derive a MacWilliams transform for symmetrization of complete weight enumerators and the linear-programming bound on \(A_R(n,d)\) (where \(R\) is a Frobenius ring). Some examples are also shown to illustrate its application to codes over \({\mathbb Z}_4, {\mathbb Z}_8\) and \({\mathbb Z}_9.\) From the text of the errata: The authors discovered some mistakes in their original article. The validity of its results is not affected, nor is that of the examples since their computation did not involve the dual version of the LP bound. In any case, we feel the errors need to be rectified here.