Maximum distance separable codes over Z4 and Z2×Z4

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

doi:10.1007/s10623-010-9437-1

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 revista › Article › Recerca › Avaluat per experts

30 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 original	Anglès
Pàgines (de-a)	31-40
Revista	Designs, Codes, and Cryptography
Volum	61
Número	1
DOIs	https://doi.org/10.1007/s10623-010-9437-1
Estat de la publicació	Publicada - 1 d’oct. 2011

Accés al document

10.1007/s10623-010-9437-1

Altres arxius i enllaços

https://www.scopus.com/pages/publications/79959377702

Com citar-ho

@article{3191982bf43d40bc8e2906ec83e19b6e,

title = "Maximum distance separable codes over Z4 and Z2×Z4",

abstract = "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. {\textcopyright} 2010 Springer Science+Business Media, LLC.",

keywords = "Additive codes, Maximum distance separable codes, Minimum distance bounds",

author = "M. Bilal and J. Borges and Dougherty, \{S. T.\} and C. Fern{\'a}ndez-C{\'o}rdoba",

year = "2011",

month = oct,

day = "1",

doi = "10.1007/s10623-010-9437-1",

language = "English",

volume = "61",

pages = "31--40",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Maximum distance separable codes over Z4 and Z2×Z4

AU - Bilal, M.

AU - Borges, J.

AU - Dougherty, S. T.

AU - Fernández-Córdoba, C.

PY - 2011/10/1

Y1 - 2011/10/1

N2 - 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.

AB - 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.

KW - Additive codes

KW - Maximum distance separable codes

KW - Minimum distance bounds

UR - https://www.scopus.com/pages/publications/79959377702

U2 - 10.1007/s10623-010-9437-1

DO - 10.1007/s10623-010-9437-1

M3 - Article

SN - 0925-1022

VL - 61

SP - 31

EP - 40

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 1

ER -

Maximum distance separable codes over Z4 and Z2×Z4

Resum

Accés al document

Altres arxius i enllaços

Fingerprint

Com citar-ho