Binary codes and partial permutation decoding sets from the odd graphs
| dc.contributor.author | Fish, Washiela | |
| dc.contributor.author | Fray, Roland | |
| dc.contributor.author | Mwambene, Eric | |
| dc.date.accessioned | 2023-02-13T07:56:11Z | |
| dc.date.available | 2023-02-13T07:56:11Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | For k ≥ 1, the odd graph denoted by O(k), is the graph with the vertex-set Ω{k} , the set of all k-subsets of Ω = {1, 2, . . . , 2k + 1}, and any two of its vertices u and v constitute an edge [u, v] if and only if u ∩ v = ∅. In this paper the binary code generated by the adjacency matrix of O(k) is studied. The automorphism group of the code is determined, and by identifying a suitable information set, a 2-PD-set of the order of k 4 is determined. Lastly, the relationship between the dual code from O(k) and the code from its graph-theoretical complement O(k), is investigated. | en_US |
| dc.identifier.citation | Fish, W. et al. (2014). Binary codes and partial permutation decoding sets from the odd graphs. Open Mathematics, 12 (9), 1362-1371. 10.2478/s11533-014-0417-y | en_US |
| dc.identifier.issn | 2391-5455 | |
| dc.identifier.uri | 10.2478/s11533-014-0417-y | |
| dc.identifier.uri | http://hdl.handle.net/10566/8413 | |
| dc.language.iso | en | en_US |
| dc.publisher | Walter de Gruyter | en_US |
| dc.subject | Binary codes | en_US |
| dc.subject | Automorphism | en_US |
| dc.subject | Permutation decoding | en_US |
| dc.subject | Applied Mathematics | en_US |
| dc.title | Binary codes and partial permutation decoding sets from the odd graphs | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- fish_binary codes and partial permutation_2014.pdf
- Size:
- 1.39 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: