Skip to main content
Log in

Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

The homogeneous weight (metric) is useful in the construction of codes over a ring of integers \(\mathbb {Z}_{p^l}\) (p prime and \(l \ge 1\) an integer). It becomes Hamming weight when the ring is taken to be a finite field and becomes Lee weight when the ring is taken to be \(\mathbb {Z}_{4}\). This paper presents homogeneous weight distribution and total homogeneous weight of burst and repeated burst errors in the code space of n-tuples over \(\mathbb {Z}_{p^l}\). Necessary and sufficient conditions for existence of an (nk) linear code over \(\mathbb {Z}_{p^l}\) correcting the error patterns with respect to the homogeneous weight are derived.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Calderbank, A.R., Sloane, N.J.A.: Modular and p-adic cyclic codes. Des. Codes Cryptogr. 6, 21–35 (1995)

    Article  MathSciNet  Google Scholar 

  2. Constantinescu, I., Heise, W.: A metric for codes over residue class rings of integers. Problemy Peredachi Informatsii 33(3), 22–28 (1997)

    MathSciNet  Google Scholar 

  3. Berardi, L., Dass, B.K., Verma, R.: On 2-repeated burst error detecting codes. J. Stat. Theory Pract. 3(2), 381–391 (2009)

    Article  MathSciNet  Google Scholar 

  4. Dass, B.K., Verma, R.: Repeated burst error correcting linear codes. Asian-Eur. J. Math. 1(4), 303–335 (2008)

    Article  MathSciNet  Google Scholar 

  5. Fire, P.: A class of multiple-error-correcting binary codes for non-independent errors, Sylvania Report, RSL-E-2, Sylvania Reconnaissance Systems Laboratory. Calif, Mountain View (1959)

    Google Scholar 

  6. Greferath, M., Schmidt, S.E.: Gray isometries for finite chain rings and a nonlinear ternary (36,312,15) code. IEEE Trans. Inf. Theory 45, 2522–2524 (1999)

  7. Greferath, M., Schmidt, S.E.: Finite-ring combinatorics and MacWilliams equivalence theorem. J. Comb. Theory(A) 92(1), 17–28 (2000)

  8. Greferath, M., Nechaev, A., Wisbauer, R.: Finite quasi-Frobenius modules and linear codes. J. Algebra its Appl. 3(3), 247–272 (2004)

    Article  MathSciNet  Google Scholar 

  9. Hamming, R.W.: Error-detecting and error-correcting codes. Bell Syst. Tech. J. 29(2), 147–160 (1950)

    Article  MathSciNet  Google Scholar 

  10. Lee, C.Y.: Some properties of non-binary error correcting codes. IEEE Trans. Inf. Theory IT–4, 77–82 (1958)

    Article  Google Scholar 

  11. Li, W.S., Wan, L.Y., Yue, M.T., Chen, W., Zhang, X.D.: Linear codes over the finite ring \(Z_{15}\). Adv. Linear Algebra Matrix Theory 10, 1–5 (2020)

  12. Moeini, M., Rezaei, R., Samei, K.: MacWilliams identity for linear codes over finite chain rings with respect to homogeneous weight. J. Korean Math. Soc. 58(5), 1163–1173 (2021)

    MathSciNet  Google Scholar 

  13. Peterson, W.W., Weldon, E.J.: Error correcting codes, 2nd edn. MIT Press, Cambridge, Massachusetts (1972)

  14. Sharma, B.D., Dass, B.K.: On weight of burst, Indian Journal of. Pure Appl. Math. 8(12), 1519–1524 (1977)

    Google Scholar 

  15. Sharma, B.D., Rohtagi, B.: Some results on weights of vectors having \(m\)-repeated bursts. Cybern. Inf. Technol. 11(3), 3–11 (2011)

    MathSciNet  Google Scholar 

  16. Srinivas, K.V., Jain, R., Saurav, S., Sikdar, S.K.: Small-world network topology of hippocampal neuronal network is lost, in an in vitro glutamate injury modelof epilepsy. Eur. J. Neurosci. 25, 3276–3286 (2007)

    Article  PubMed  Google Scholar 

  17. Temiz, F., Siap, V.: Linear block and array codes correcting repeated CT-burst errors. Albanian J. Math. 7(2), 77–92 (2013)

    Article  MathSciNet  Google Scholar 

  18. Yildiz, B., Abdljabbar, M.A.: On \(p\)-ary local Frobenius rings and their homogeneous weights. Appl. Math. Inf. Sci. 10(6), 2109–2116 (2016)

    Article  MathSciNet  Google Scholar 

  19. Yildiz, B., Ozger, Z.O.: A generalization of the Lee weight \(\mathbb{Z} _{p^k}\). TWMS J. Appl. Eng. Math. 2(2), 145–153 (2012)

    MathSciNet  Google Scholar 

  20. Yildiz, B., Tufekci, N.: Optimal divisible binary codes from Gray-Homogeneous images of codes over \(R_{k, m}\). Eur. J. Pure Appl. Math. 10(5), 1112–1123 (2017)

Download references

Acknowledgements

This paper is a part of Ph.D. thesis submitted by the second author to the University of Delhi, 2021.

Funding

None.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pankaj Kumar Das.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Das, P.K., Kumar, S. Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance. Theory Comput Syst (2024). https://doi.org/10.1007/s00224-024-10166-y

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00224-024-10166-y

Keywords

Navigation