Some optimal codes and strongly regular graphs from the linear group L 4(3)

Authors

  • Crnković, Dean
  • Crnković, Vedrana Mikulić
  • Rodrigues B.G.

Abstract

We construct self-orthogonal codes obtained from the row span over F 2 or F3 of the incidence (resp. adjacency) matrices of some selforthogonal designs (resp. strongly regular graphs) defined by the action of the simple linear group L4(3) on the conjugacy classes of several of its maximal subgroups. We use the geometry of the designs or graphs and give an account on the codewords of several weights. Further, we show that the codes with parameters [27, 23, 3)3, [27, 4, 18]3, [27, 17, 6]3, [40, 29, 6]3, [117, 91, 6]2, [117, 97, 6]3, and [130, 111, 4]3 are all optimal. In addition, we obtain a self-dual [80, 40, 12] code invariant under L4(3).

Published

2012-09-09

How to Cite

Crnković, Dean, Crnković, Vedrana Mikulić, & Rodrigues B.G. (2012). Some optimal codes and strongly regular graphs from the linear group L 4(3). Utilitas Mathematica, 89. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/849

Issue

Vol. 89 (2012): Volume 89, 2012

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.