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

DOI10.2989/16073606.2019.1580227zbMath1475.94189OpenAlexW2921461147MaRDI QIDQ5113374

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

Publication date: 10 June 2020

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2019.1580227

zbMATH Keywords

bipartite graphspermutation decodingbinary codebiadjacency matrix

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Codes from lattice and related graphs, and permutation decoding
• Codes associated with triangular graphs and permutation decoding
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Codes from incidence matrices and line graphs of Hamming graphs
• Permutation decoding for the binary codes from triangular graphs.
• Binary codes of strongly regular graphs
• Binary codes and partial permutation decoding sets from the odd 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\)
• 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 bipartite graphs Γ(2k, k, k + 1, 1)