Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Codes and designs from triangular graphs and their line graphs

100%

Fish W., Kumwenda K., Mwambene E.

Open Mathematics

2011

tom 9

nr 6

1411-1423

For any prime p, we consider p-ary linear codes obtained from the span over $\mathbb{F}_p $ p of rows of incidence matrices of triangular graphs, differences of the rows and adjacency matrices of line graphs of triangular graphs. We determine parameters of the codes, minimum words and automorphism groups. We also show that the codes can be used for full permutation decoding.

Binary codes and partial permutation decoding sets from the odd graphs

100%

Fish W., Fray R., Mwambene E.

Open Mathematics

2014

tom 12

nr 9

1362-1371

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 = /0. 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 $\overline {O(k)} $, is investigated.

Ograniczanie wyników

2 Open Mathematics

2 Fish W.

2 Mwambene E.

1 Fray R.

1 Kumwenda K.

1 2014

1 2011

Wyniki wyszukiwania

Codes and designs from triangular graphs and their line graphs

Binary codes and partial permutation decoding sets from the odd graphs