Article
Maximal ternary codes and Plotkin's bound
Faculty of Informatics - Papers (Archive)
Publication Date
1-1-1984
Abstract
The analogue of Plotkin's bound is developed for ternary codes with high distance relative to length. Generalized Hadamard matrices are used to obtain codes which meet these bounds. The ternary analogue of Levenshtein's construction is discussed and maximal codes constructed.
Disciplines
Citation Information
Conrad Mackenzie and Jennifer Seberry. "Maximal ternary codes and Plotkin's bound" (1984) Available at: http://works.bepress.com/jseberry/334/
Mackenzie, C and Seberry, J, Maximal ternary codes and Plotkin's bound, Ars Combinatoria, 17A, 1984, 251-270.