Codes and designs from triangular graphs and their line graphs

DOI10.2478/s11533-011-0072-5zbMath1229.05200OpenAlexW2045278719MaRDI QIDQ651292

Eric Mwambene, Khumbo Kumwenda, Washiela Fish

Publication date: 12 December 2011

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-011-0072-5

zbMATH Keywords

Line graphLinear codeAutomorphism groupIncidence designIncidence matrixPermutation decodingTriangular graph

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Decoding (94B35) Graph operations (line graphs, products, etc.) (05C76)

Related Items

PD-sets for the codes from incidence matrices of triangular graphs, Unnamed Item, The weight distribution of hulls of binary codes from incidence matrices of complete graphs, Codes from the incidence matrices of graphs on 3-sets, Codes from incidence matrices of some Bouwer graphs, Codes from incidence matrices of some regular graphs, Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs

Uses Software

• Magma
• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes associated with triangular graphs and permutation decoding
• On defect-d matchings in graphs
• The Magma algebra system. I: The user language
• Permutation decoding for the binary codes from triangular graphs.
• Binary codes of strongly regular graphs
• Codes from the incidence matrices of graphs on 3-sets
• Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
• Information sets and partial permutation decoding for codes from finite geometries
• Searching for linear codes with large minimum distance
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes
• On the groups of repeated graphs