Multidimensional Latin Bitrade

preprint2014arXivOpen access

Abstract

A subset SS of kk-ary nn-dimensional hypercube is called latin bitrade if ∣S∩F∣∈{0,2}|S\cap F|\in\{0,2\} for each 1-face FF. We find all admissible small (less than 2n+12^{n+1}) cardinalities of latin bitrades. A subset MM of kk-ary nn-dimensional hypercube is called tt-fold MDS code if ∣M∩F∣=t|M\cap F|=t for each 1-face FF. Symmetric difference of two 1-fold MDS codes is always a latin bitrade. Symmetric difference of two tt-fold MDS codes may also be a latin bitrade. In this case we say that this latin bitrade embedded into tt-fold MDS code. The intersection of tt-fold MDS code and a latin bitrade embedded into it is called a component of the code. We study the questions of embedding of latin bitrades into tt-fold MDS and admissible cardinalities of the component of tt-fold MDS. Keywords: MDS code, latin bitrade, component.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.