Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\) (Q2014219)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs (2k+1,k,k+2,1) |
scientific article; zbMATH DE number 6759402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\) |
scientific article; zbMATH DE number 6759402 |
Statements
Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\) (English)
0 references
10 August 2017
0 references
bipartite graphs
0 references
biadjacency matrices
0 references
binary codes
0 references
automorphism group
0 references
permutation decoding
0 references
0.9858896136283876
0 references
0.8700879216194153
0 references
0.8519037961959839
0 references
0.8504639863967896
0 references
0.8463587164878845
0 references
