AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n,2). We find the automorphism groups and the parameters of the codes. We find a regular subgroup of the automorphism group that can be used for permutation decoding, or partial permutation decoding, for any information set
A generalized hypercube graph $\Q_n(S)$ has $\F_{2}^{n}=\{0,1\}^n$ as the vertex set and two vertice...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
>Magister Scientiae - MScFor integers n, k 2:: 1, and k ~ n, the graph r~has vertices the 2n vectors...
Masters of ScienceCodes Related to and Derived from Hamming Graphs T.R Muthivhi M.Sc thesis, Depar...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
AbstractFor integers n≥1,k≥0, and k≤n, the graph Γnk has vertices the 2n vectors of F2n and adjacenc...
AbstractWe examine the p-ary codes, for any prime p, that can be obtained from incidence matrices an...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
For integers n ≥ 1, k ≥ 0, and k ≤ n, the graph Γkn has vertices the 2n vectors of Fn2 and adjacency...
The generalized Paley graphs GP (q, k) are a generalization of the well-known Paley graphs. Codes de...
Philosophiae Doctor - PhDIn this thesis, we describe linear codes over prime fields obtained from in...
A generalized hypercube graph $\Q_n(S)$ has $\F_{2}^{n}=\{0,1\}^n$ as the vertex set and two vertice...
A generalized hypercube graph $\Q_n(S)$ has $\F_{2}^{n}=\{0,1\}^n$ as the vertex set and two vertice...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
>Magister Scientiae - MScFor integers n, k 2:: 1, and k ~ n, the graph r~has vertices the 2n vectors...
Masters of ScienceCodes Related to and Derived from Hamming Graphs T.R Muthivhi M.Sc thesis, Depar...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
AbstractFor integers n≥1,k≥0, and k≤n, the graph Γnk has vertices the 2n vectors of F2n and adjacenc...
AbstractWe examine the p-ary codes, for any prime p, that can be obtained from incidence matrices an...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
For integers n ≥ 1, k ≥ 0, and k ≤ n, the graph Γkn has vertices the 2n vectors of Fn2 and adjacency...
The generalized Paley graphs GP (q, k) are a generalization of the well-known Paley graphs. Codes de...
Philosophiae Doctor - PhDIn this thesis, we describe linear codes over prime fields obtained from in...
A generalized hypercube graph $\Q_n(S)$ has $\F_{2}^{n}=\{0,1\}^n$ as the vertex set and two vertice...
A generalized hypercube graph $\Q_n(S)$ has $\F_{2}^{n}=\{0,1\}^n$ as the vertex set and two vertice...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
DOI
Add to ORKG