Burst Error Enumeration of m-Array Codes over Rings and Its Applications
Keywords:
Matrix Array Codes, Non Hamming Metric, Burst Errors, Burst Weight enumerator.Abstract
Enumerating burst errors enables to obtain bounds on parameters of codes. Recently, Jain in
[5] established a Reiger’s type bound for burst error correcting matrix codes over finite fields with respect to a non Hamming metric. Here, we extend these results to array codes over finite rings. Further, we also introduce a new constructive method for counting burst errors that avoids solving Diophantine inequalities in order to compute burst errors for each given weight. Finally, we apply our results on establishing some bounds for array codes over finite rings.Downloads
Issue
Section
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.