In this paper, we classify all optimal linear n, n/2 codes over Z(4) up to length n = 8, and determine the number of optimal codes which are self-dual and formally self-dual. Optimal codes with linear binary images are identified. In particular, we show that for length 8, there are nine optimal codes for the Hamming distance, one optimal code for the Lee distance, and two optimal codes for the Euclidean distance.
%0 Journal Article
%1 ISI:000250733900025
%A Gulliver, T. Aaron
%A Wong, John N. C.
%C PO BOX 272 ST NORBERT POSTAL STATION, WINNIPEG, MB R3T 2N2, CANADA
%D 2007
%I CHARLES BABBAGE RES CTR
%J Ars Combinatoria^
%K optimale_lineare_codes Lee-Metriken
%P 287-306
%T Classification of optimal linear Z(4) rate 1/2 codes of length <= 8
%V 85
%X In this paper, we classify all optimal linear n, n/2 codes over Z(4) up to length n = 8, and determine the number of optimal codes which are self-dual and formally self-dual. Optimal codes with linear binary images are identified. In particular, we show that for length 8, there are nine optimal codes for the Hamming distance, one optimal code for the Lee distance, and two optimal codes for the Euclidean distance.
@article{ISI:000250733900025,
abstract = {{In this paper, we classify all optimal linear {[}n, n/2] codes over Z(4) up to length n = 8, and determine the number of optimal codes which are self-dual and formally self-dual. Optimal codes with linear binary images are identified. In particular, we show that for length 8, there are nine optimal codes for the Hamming distance, one optimal code for the Lee distance, and two optimal codes for the Euclidean distance.}},
added-at = {2013-02-02T14:43:24.000+0100},
address = {{PO BOX 272 ST NORBERT POSTAL STATION, WINNIPEG, MB R3T 2N2, CANADA}},
affiliation = {{Gulliver, TA (Reprint Author), Univ Victoria, Dept Elect \& Comp Engn, POB 3055,STN CSC, Victoria, BC V8W 3P6, Canada. Univ Victoria, Dept Elect \& Comp Engn, Victoria, BC V8W 3P6, Canada.}},
author = {Gulliver, T. Aaron and Wong, John N. C.},
author-email = {{agullive@ece.uvic.ca jwong@ece.uvic.ca}},
biburl = {https://www.bibsonomy.org/bibtex/2c9e92a3d43837d95c8514af051b73454/ks-plugin-devel},
date-added = {2008-04-24 16:50:41 +0200},
date-modified = {2009-01-29 15:51:25 +0100},
doc-delivery-number = {{228ML}},
groups = {public},
interhash = {3f5f318d92484e0a83b33ede003cff31},
intrahash = {c9e92a3d43837d95c8514af051b73454},
issn = {{0381-7032}},
journal = {Ars Combinatoria^},
journal-iso = {{ARS Comb.}},
keywords = {optimale_lineare_codes Lee-Metriken},
language = {{English}},
month = {October},
number-of-cited-references = {{13}},
pages = {287-306},
publisher = {{CHARLES BABBAGE RES CTR}},
subject-category = {{Mathematics}},
times-cited = {{0}},
timestamp = {2013-02-02T14:43:24.000+0100},
title = {Classification of optimal linear Z(4) rate 1/2 codes of length <= 8},
type = {{Article}},
unique-id = {{ISI:000250733900025}},
username = {keinstein},
volume = 85,
year = 2007
}