64 research outputs found
On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4
A subset of is called a -fold MDS code if every
line in each of base directions contains exactly elements of . The
adjacency graph of a -fold MDS code is not connected if and only if the
characteristic function of the code is the repetition-free sum of the
characteristic functions of -fold MDS codes of smaller lengths.
In the case , the theory has the following application. The union of two
disjoint MDS codes in is a double-MDS-code. If
the adjacency graph of the double-MDS-code is not connected, then the
double-code can be decomposed into double-MDS-codes of smaller lengths. If the
graph has more than two connected components, then the MDS codes are also
decomposable. The result has an interpretation as a test for reducibility of
-quasigroups of order 4. Keywords: MDS codes, n-quasigroups,
decomposability, reducibility, frequency hypercubes, latin hypercubesComment: 19 pages. V2: revised, general case q=2t is added. Submitted to
Discr. Mat
- β¦