A geometric non-existence proof of an extremal additive code
Document Type
Article
Publication Date
2-2010
Department
Department of Mathematical Sciences
Abstract
We use a geometric approach to solve an extremal problem in coding theory. Expressed in geometric language we show the non-existence of a system of 12 lines in PG (8, 2) with the property that no hyperplane contains more than 5 of the lines. In coding-theoretic terms this is equivalent with the non-existence of an additive quaternary code of length 12, binary dimension 9 and minimum distance 7.
Publication Title
Journal of Combinatorial Theory. Series A
Recommended Citation
Bierbrauer, J.,
Marcugini, S.,
&
Pambianco, F.
(2010).
A geometric non-existence proof of an extremal additive code.
Journal of Combinatorial Theory. Series A,
117(2), 128-137.
http://doi.org/10.1016/j.jcta.2009.04.005
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/6677
