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

DOI10.2989/16073606.2019.1580227MaRDI QIDQ5113374zbMATH OpenOpenAlexFDO

Authors N. B. Mumba, B. G. Rodrigues, Washiela Fish, E. 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 graphsbinary codepermutation decodingbiadjacency matrix

Mathematics Subject Classification ID

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

Recommendations

• 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
• Binary codes and partial permutation decoding sets from the Johnson graphs
• Binary codes from graphs on triples and permutation decoding
• Partial permutation decoding of some binary codes from graphs on triples.

Cites work

• scientific article; zbMATH DE number 1284430 (Why is no real title available?)
• Binary codes and partial permutation decoding sets from the odd graphs
• Binary codes of strongly regular graphs
• Codes associated with triangular graphs and permutation decoding
• Codes from incidence matrices and line graphs of Hamming graphs
• Codes from lattice and related graphs, and permutation decoding
• Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
• Codes from the incidence matrices of graphs on 3-sets
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• PD-sets for the codes related to some classical varieties
• Permutation Decoding of Systematic Codes
• Permutation decoding for the binary codes from triangular graphs.

Cited in

(5)

• Partial permutation decoding of some binary codes from graphs on triples.
• Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
• Codes from the line graphs of complete multipartite graphs and PD-sets
• Binary codes and partial permutation decoding sets from the odd graphs
• Binary codes and partial permutation decoding sets from the Johnson graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113374)