The linear programming bound for codes over finite Frobenius rings
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.
- New bounds for codes over finite Frobenius rings
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- On bounds for codes over Frobenius rings under homogeneous weights
- On linear codes over finite rings and modules
- ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS
- Gilbert-Varshamov type bounds for linear codes over finite chain rings
- Linear programming bounds for codes in grassmannian spaces
- On the linear codes over the ring R_p
- The linear programming bound for binary linear codes
- scientific article; zbMATH DE number 1166238
- F-partitions of cyclic groups
- A metric for codes over residue class rings
- A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code
- Characterization of finite Frobenius rings
- Duality for modules over finite rings and applications to coding theory
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
- scientific article; zbMATH DE number 1594299 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1498809 (Why is no real title available?)
- Kerdock code in a cyclic form
- On bounds for codes over Frobenius rings under homogeneous weights
- On Fourier-invariant partitions of finite Abelian groups and the MacWilliams identity for group codes
- On the isometries between Z(p/sup k/) and Z/sub p//sup k/
- On the optimal Z₄ codes of type II and length 16
- The Magma algebra system. I: The user language
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Weighted modules and representations of codes
- Z/sub 2/k-linear codes
- Duality of codes supported on regular lattices, with an application to enumerative combinatorics
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- Partitions of matrix spaces with an application to \(q\)-rook polynomials
- Fourier-reflexive partitions and MacWilliams identities for additive codes
- New bounds for codes over finite Frobenius rings
- The homogeneous weight partition and its character-theoretic dual
- Homogeneous bounds for the image of linear block codes over Galois ring extensions
- On the ℤq-Simplex codes and its weight distribution for dimension 2
- scientific article; zbMATH DE number 5360805 (Why is no real title available?)
- Partitions of Frobenius rings induced by the homogeneous weight
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- Bounds on the \(p^r\)-ary image of linear block codes over finite semi-local Frobenius ring \(\mathbb F_{p^r} + v \mathbb F_{p^r}\)
- Singleton bounds for codes over finite rings
- One more proof of the first linear programming bound for binary codes and two conjectures
- Two new families of linear codes with five Lee-weights over \(\mathbb{F}_q + u \mathbb{F}_q\) and their Gray images
- Five-Lee-weight linear codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Linear codes with few weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
This page was built for publication: The linear programming bound for codes over finite Frobenius rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384000)
