Maximum distance separable codes over Z4 and Z2×Z4

M. Bilal, J. Borges, S. T. Dougherty, C. Fernández-Córdoba

Producció científica: Contribució a revistaArticleRecercaAvaluat per experts

24 Cites (Scopus)

Resum

Known upper bounds on the minimum distance of codes over rings are applied to the case of ℤ2 ℤ4 -additive codes, that is subgroups of ℤ2α × ℤ4β. Two kinds of maximum distance separable codes are studied. We determine all possible parameters of these codes and characterize the codes in certain cases. The main results are also valid when α = 0, namely for quaternary linear codes. © 2010 Springer Science+Business Media, LLC.
Idioma originalAnglès
Pàgines (de-a)31-40
RevistaDesigns, Codes, and Cryptography
Volum61
Número1
DOIs
Estat de la publicacióPublicada - 1 d’oct. 2011

Fingerprint

Navegar pels temes de recerca de 'Maximum distance separable codes over Z4 and Z2×Z4'. Junts formen un fingerprint únic.

Com citar-ho