Binary codes and partial permutation decoding sets from the odd graphs

DOI10.2478/s11533-014-0417-yzbMath1343.94087OpenAlexW2073204308MaRDI QIDQ2248512

Roland Fray, Eric Mwambene, Washiela Fish

Publication date: 26 June 2014

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

Full work available at URL: https://doi.org/10.2478/s11533-014-0417-y

zbMATH Keywords

automorphism groupbinary codespermutation decodingodd graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Other designs, configurations (05B30) Group actions on combinatorial structures (05E18)

Related Items

\(LCD\) codes from adjacency matrices of graphs ⋮ Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1) ⋮ Codes from adjacency matrices of uniform subset graphs ⋮ Hamming graphs and special LCD codes ⋮ Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian uniform subset graphs
• The footballers of Croam
• PD-sets for the codes related to some classical varieties
• Maximal Subgroups of Symmetric Groups
• Permutation Decoding of Systematic Codes

This page was built for publication: Binary codes and partial permutation decoding sets from the odd graphs