Formally self-dual LCD codes from two-class association schemes
| Autor: | Andrea Švob, Ana Grbac, Dean Crnković |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: |
Discrete mathematics
Strongly regular graph Algebra and Number Theory Finite field Association scheme Intersection (set theory) LCD code association scheme strongly regular graph doubly regular tournament formally self-dual code Applied Mathematics Theory of computation Dual polyhedron Adjacency matrix Decoding methods Mathematics |
| Popis: | Linear codes with complementary duals, shortly named LCD codes, are linear codes whose intersection with their duals is trivial. In this paper, we outline a construction for LCD codes over finite fields from the adjacency matrices of two-class association schemes. These schemes consist of either strongly regular graphs (SRGs) or doubly regular tournaments (DRTs). Under certain conditions, the method yields formally self-dual codes. Further, we propose a decoding algorithm that can be feasible for the LCD codes obtained using one of the given methods. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|