Codes associated with triangular graphs and permutation decoding
From MaRDI portal
Publication:622793
DOI10.1504/IJICOT.2010.032547zbMath1204.94113MaRDI QIDQ622793
Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues
Publication date: 4 February 2011
Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)
Related Items
PD-sets for the codes from incidence matrices of triangular graphs ⋮ GHWs of codes arising from Cartesian product of graphs ⋮ GHWs of codes derived from the incidence matrices of some graphs ⋮ Permutation decoding of codes from generalized Paley graphs ⋮ Codes from lattice and related graphs, and permutation decoding ⋮ Designs and codes from involutions of An ⋮ Codes associated with the odd graphs ⋮ A characterization of graphs by codes from their incidence matrices ⋮ The weight distribution of hulls of binary codes from incidence matrices of complete graphs ⋮ Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1) ⋮ Codes from incidence matrices of graphs ⋮ Hulls of codes from incidence matrices of connected regular graphs ⋮ Codes and designs from triangular graphs and their line graphs ⋮ Codes from incidence matrices and line graphs of Hamming graphs ⋮ Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\) ⋮ Codes from the incidence matrices of graphs on 3-sets ⋮ On the existence of PD-sets: algorithms arising from automorphism groups of codes ⋮ 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
This page was built for publication: Codes associated with triangular graphs and permutation decoding