Singleton bounds for codes over finite rings
Let \(R\) be a finite commutative quasi-Froebenius (QF) ring and let \(V=R^n\) be the free module of rank \(n\) consisting of all \(n\)-tuples of elements of \(R\). A code \(C\) of length \(n\) over \(R\) is an \(R\)-submodule of \(V\). For every \(x=(x_1,x_2, \dots,x_n) \in V\) and \(r\in R\), the complete weight of \(x\) is defined by \(n_r(x)= |\{i \mid x_i=r\} |\). Let \(a_0=0\) and \(a_r\) be a positive real number for any nonzero \(r\in R\). A general weight function \(w(x)\) is defined by \[ w(x)= \sum_{r\in R}a_r n_r(x). \] For any linear \([n,k,d]\) code over a finite field, the Singleton bound says that \(d\leq n-k+1\). The main result here is the following generalization of the Singleton bound for a general weight function over \(R\). Theorem. Let \(C\) be a code with minimum distance \(d\) over a finite commutative QF ring \(R\). Let \(w(x)\) be a general weight function on \(C\). Then \[ \bigl[(d-1)/ A\bigr]\leq n-\log_{|R|} |C|, \] where \(A=\max\{a_r \mid r\in R\}\) and \([b]\) is the integer part of \(b\). Finally, the author presents some applications of his result to codes over \(\mathbb{Z}_l\) (and in particular \(\mathbb{Z}_4)\) for the special weight functions corresponding to the Hamming, Lee and Euclidean weights.
- Singleton bounds for R-additive codes
- Singleton's bound in Euclidean codes
- New bounds for codes over finite Frobenius rings
- A singleton bound for linear codes over \(\mathbb{Z}/l\mathbb{Z}\)
- On the equivalence of codes over finite rings
- Singleton-type bounds for blot-correcting codes
- The linear programming bound for codes over finite Frobenius rings
- On bounds for codes over Frobenius rings under homogeneous weights
- On constacyclic codes over finite chain rings
- A Griesmer bound for codes over finite quasi-Frobenius rings
- A new MacWilliams type identity for linear codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 474654 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Über die Identität von MacWilliams für die Gewichtsfunktion von Codes
- Induced weights on quotient modules and an application to error correction in coherent networks
- On bounds for codes over Frobenius rings under homogeneous weights
- Singleton bounds for R-additive codes
- Structure of linear codes over the ring \(B_k\)
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- Density of free modules over finite chain rings
- Codes over an infinite family of rings with a Gray map
- On maximum Lee distance codes
- Bounds in the Lee metric and optimal codes
- A singleton bound for linear codes over \(\mathbb{Z}/l\mathbb{Z}\)
- A Griesmer bound for codes over finite quasi-Frobenius rings
- Maximum distance codes over rings of order 4
- On the linear codes over the ring Z₄+v₁Z₄+...+v_{t}Z₄
- Some two-weight codes over chain rings and their strongly regular graphs
- MDS and self-dual codes over rings
- A class of locally recoverable codes over finite chain rings
- Better bounds on the minimum Lee distance
This page was built for publication: Singleton bounds for codes over finite rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5926296)
