We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
Jennifer D. Key, Jamshid Moori, Bernardo Gabriel R...
We 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 cod...
We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m, n) for 3 ≤ m < n and show that permut...
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...