Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)

DOI10.1007/s00373-017-1765-8zbMath1410.94116OpenAlexW2581281384MaRDI QIDQ2014219

N. B. Mumba, Bernardo Gabriel Rodrigues, Eric Mwambene, Washiela Fish

Publication date: 10 August 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1765-8

zbMATH Keywords

automorphism groupbinary codesbipartite graphspermutation decodingbiadjacency matrices

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other designs, configurations (05B30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

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
• Codes associated with triangular graphs and permutation decoding
• Codes from incidence matrices and line graphs of Hamming graphs
• Ternary codes from graphs on triples
• Permutation decoding for the binary codes from triangular graphs.
• Binary codes of strongly regular graphs
• Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
• Binary codes and partial permutation decoding sets from the odd graphs
• Codes from the incidence matrices of graphs on 3-sets
• PD-sets for the codes related to some classical varieties
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes

This page was built for publication: Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)