Name
Abstract | ||
|---|---|---|
We construct new binary and ternary self-orthogonal linear codes. In order to do this we use an equivalence between the existence of a self-orthogonal linear code with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetry given by matrix groups. Using this method we found at least six new distance-optimal codes, which are all self-orthogonal. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.dam.2007.10.030 | Discrete Applied Mathematics |
Keywords | Field | DocType |
new distance-optimal code,self-orthogonal linear code,lattice point enumeration,prescribed minimum distance,ternary self-orthogonal linear code,group of automorphisms,new binary,incidence matrix,matrix group,diophantine linear equation,certain system,special symmetry,system of equations,linear equations,linear code,lattice points | Linear equation,Discrete mathematics,Combinatorics,Coefficient matrix,Linear system,System of linear equations,Ternary Golay code,Ternary operation,Linear code,Diophantine equation,Mathematics | Journal |
Volume | Issue | ISSN |
157 | 9 | Discrete Applied Mathematics |
Citations | PageRank | References |
1 | 0.35 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Axel Kohnert | 1 | 114 | 12.60 |
| Alfred Wassermann | 2 | 125 | 23.33 |