ℤ4-codes and their Gray map images as orthogonal arrays
MetadataShow full item record
A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter.Since the paper of Hammons et al., there is a lot of interest in codes over rings, especially in codes over ℤ4 and their (usually non-linear) binary Gray map images.We show that Delsarte's observation extends to codes over arbitrary finite commutative rings with identity. Also, we show that the strength of the Gray map image of a ℤ4 code is one less than the minimum Lee weight of its Gray map image.
Cameron , P J , Kusuma , J & Solé , P 2017 , ' ℤ 4 -codes and their Gray map images as orthogonal arrays ' Designs, Codes and Cryptography , vol. 84 , no. 1-2 , pp. 109-114 . DOI: 10.1007/s10623-016-0225-4
Designs, Codes and Cryptography
© 2016, Springer Science+Business Media New York. This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at link.springer.com / https://dx.doi.org/10.1007/s10623-016-0225-4
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.