Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\). (English) Zbl 1428.94115
Summary: In this paper, we give some lower and upper bounds on the covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\), where \(v^2=v\). We determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over this ring.
MSC:
| 94B75 | Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory |
| 94B05 | Linear codes (general theory) |
Software:
MapleReferences:
| [1] | Betsumiya, K.; Harada, M., Optimal self-dual codes over \(\mathbb{F}_2 \times \mathbb{F}_2\) with respect to the Hamming weight, IEEE Trans. Inf. Theory, 50, 356-358, (2004) · Zbl 1285.94118 |
| [2] | Cohen, G. D.; Karpovsky, M. G.; Mattson, H. F.; Schatz, J. R., Covering radius survey and recent results, IEEE Trans. Inf. Theory, 31, 3, 328-343, (1985) · Zbl 0586.94014 |
| [3] | Durairajan, C., On covering codes and covering radius of some modular codes, (1996), Department of Mathematics, IIT Kanpur, Ph.D. Thesis |
| [4] | Aoki, T.; Gaborit, P.; Harada, M.; Ozeki, M.; Solè, P., On the covering radius of \(Z_4\) codes and their lattices, IEEE Trans. Inf. Theory, 45, 6, 2162-2168, (1999) · Zbl 0959.94036 |
| [5] | Pandian, P. C.; Durairajan, C., On the covering radius of some code over \(R = Z_2 + u Z_2\), where \(u^2 = 0\), Int. J. Res. Appl., 2, 1, 61-70, (2014) |
| [6] | Pandian, P. C.; Durairajan, C., On the covering radius of codes over \(Z_4\) with Chinese Euclidean weight, Int. J. Inform. Theory, 4, 4, 1-8, (2015) |
| [7] | Pandian, P. C., On covering radius of codes over \(R = Z_2 + u Z_2\), where \(u^2 = 0\) using Chinese Euclidean distance, Discrete Math. Algorithms Appl., 9, 2, (2017) · Zbl 1418.94089 |
| [8] | Zhu, S.; Wang, Y.; Shi, M., Some results on cyclic codes over \(\mathbb{F}_2 + v \mathbb{F}_2\), IEEE Trans. Inf. Theory, 56, 1680-1684, (2010) · Zbl 1366.94651 |
| [9] | Dertli, A.; Cengellenmis, Y., Macdonald codes over the ring \(\mathbb{F}_2 + v \mathbb{F}_2\), Int. J. Algebra, 5, 20, 985-991, (2011) · Zbl 1256.94075 |
| [10] | Huang, D., Covering radius of codes over ring \(\mathbb{F}_2 + v \mathbb{F}_2\), Coll. Math., 31, 2, 93-96, (2015) |
| [11] | Gupta, M. K.; David, G. G.; Aaron, G. T., On senary simplex codes, (International Symposium on Applied Algebra, (2001)), 112-121 · Zbl 1057.94028 |
| [12] | Bhandari, M. C.; Gupta, M. K.; Lal, A. K., On \(Z_4\) simplex codes and their gray images, (Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-13, Lect. Notes Comput. Sci., vol. 1719, (1999)), 170-180 · Zbl 0991.94052 |
| [13] | Li, J., Maple 9.0 symbol processing and application, (2004), Science Press, (in Chinese) |
| [14] | Wang, X.; Gao, J.; Fu, F., Secret sharing schemes from linear codes over \(F_p + v F_p\), Int. J. Found. Comput. Sci., 27, 5, 595-605, (2016) · Zbl 1358.94082 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
