\(LCD\) codes from adjacency matrices of graphs
type: Item
instance of: scholarly article
title: \(LCD\) codes from adjacency matrices of graphs
zbMATH Open document ID: 1391.94846
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2018-06-26T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 6894788
zbMATH Keywords: \(LCD\) codes
zbMATH Keywords: uniform subset graphs
zbMATH Keywords: strongly regular graphs
author: J. D. Key
author: B. G. Rodrigues
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: s00200-017-0339-6
OpenAlex ID: W2748466041
cites work: Q5283721
cites work: Q4004114
cites work: The Magma algebra system. I: The user language
cites work: On the \(p\)-rank of the adjacency matrices of strongly regular graphs
cites work: Q4871763
cites work: Q4000288
cites work: Permutation decoding for the binary codes from triangular graphs.
cites work: Q5707657
cites work: Association schemes and coding theory
cites work: Binary codes and partial permutation decoding sets from the odd graphs
cites work: Codes from adjacency matrices of uniform subset graphs
cites work: Q5327069
cites work: Graphs, designs and codes related to the \(n\)-cube
cites work: Ternary codes from some reflexive uniform subset graphs
cites work: Codes from incidence matrices and line graphs of Hamming graphs
cites work: Binary codes from reflexive uniform subset graphs on 3-sets
cites work: Hulls of codes from incidence matrices of connected regular graphs
cites work: Binary codes of strongly regular graphs
cites work: Q4242024
cites work: Binary codes from graphs on triples
cites work: Ternary codes from graphs on triples
cites work: Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
cites work: On the spectra of Johnson graphs
cites work: Q2951854
cites work: Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
cites work: Linear codes with complementary duals
cites work: Permutation decoding of codes from generalized Paley graphs
DOI: 10.1007/S00200-017-0339-6
description: scientific article; zbMATH DE number 6894788