Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

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

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Crnković, Dean ; Mikulić Crnković, Vedrana ; Rodrigues, Bernardo G. Some optimal codes and strongly regular graphs from the linear group L(4, 3) // Utilitas mathematica, 89 (2012), 237-255

Podaci o odgovornosti

Crnković, Dean ; Mikulić Crnković, Vedrana ; Rodrigues, Bernardo G.

engleski

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

We construct self-orthogonal codes obtained from the row span over GF(2) or GF(3) of the incidence (resp. adjacency) matrices of some self-orthogonal designs (resp. strongly regular graphs) defined by the action of the simple linear group L(4, 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 L(4, 3).

strongly regular graph; symmetric design; self-orthogonal design; self-orthogonal code; automorphism group

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

89

2012.

237-255

objavljeno

0315-3681

Povezanost rada

Matematika

Indeksiranost