Research Articles (Mathematics)
Permanent URI for this collection
Browse
Browsing by Subject "Binary codes"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Binary codes and partial permutation decoding sets from the odd graphs(Walter de Gruyter, 2014) Fish, Washiela; Fray, Roland; Mwambene, EricFor 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.Item Binary codes from m-ary n-cubes Q(n) (m)(American Institute of Mathematical Sciences, 2021) Key, Jennifer D.; Rodrigues, Bernardo G.We examine the binary codes from adjacency matrices of the graph with vertices the nodes of the m-ary n-cube Qmn and with adjacency de ned by the Lee metric. For n = 2 and m odd, we obtain the parameters of the code and its dual, and show the codes to be LCD. We also nd s-PD-sets of size s + 1 for s < m1 2 for the dual codes, i.e. [m2; 2m 1;m]2 codes, when n = 2 and m 5 is odd.