Name
Abstract | ||
|---|---|---|
In this paper, we construct some families of binary linear and nonlinear codes by using various bipartite graphs. Furthermore, we also determine some conditions for the constructed binary linear code to be a maximum distance separable code. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s11786-016-0258-0 | Mathematics in Computer Science |
Keywords | Field | DocType |
Linear codes, Bipartite graphs, Minimum distance, Primary 14G50, Secondary 57M15 | Factor graph,Complete bipartite graph,Discrete mathematics,Combinatorics,Low-density parity-check code,Block code,Bipartite graph,Binary code,Expander code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
10 | 2 | 1661-8270 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Denis C. K. Wong | 1 | 0 | 1.69 |