Photo by heftiba from unsplash
Bilal et al. (Maximum distance separable codes over ℤ4 and ℤ2 × ℤ4 Des. Codes Cryptogr. 61 (2011) 31–40) obtained two upper bounds on minimum distance of codes over rings… Click to show full abstract
Bilal et al. (Maximum distance separable codes over ℤ4 and ℤ2 × ℤ4 Des. Codes Cryptogr. 61 (2011) 31–40) obtained two upper bounds on minimum distance of codes over rings to the case of ℤ2ℤ4-additive codes and through these bounds, they introduced two kinds of maximum distance separable codes (MDSS and MDSR), the minimum distance of which meets any of those bounds. Also, they completely determined these two types of codes. In this paper, we generalize these facts on ℤ2ℤ2s-additive codes and determine all possible parameters of the MDSS and MDSR codes over ℤ2 × ℤ2s.
Journal Title: Journal of Algebra and Its Applications
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!