Multidimensional Latin bitrades

DOI10.1134/S0037446613020146MaRDI QIDQ350856zbMATH OpenOpenAlexFDO

Authors Vladimir N. Potapov

Publication date 3 July 2013

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1104.1295

zbMATH Keywords

componentLatin bitradeMDS codeunited bitradeunitrade

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Orthogonal arrays, Latin squares, Room squares (05B15) Decoding (94B35) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: A subset $S$ of $k$-ary $n$-dimensional hypercube is called latin bitrade if $|ScapF|in0,2$ for each 1-face $F$. We find all admissible small (less than $2^{n+1}$) cardinalities of latin bitrades. A subset $M$ of $k$-ary $n$-dimensional hypercube is called $t$-fold MDS code if $|McapF|=t$ for each 1-face $F$. Symmetric difference of two 1-fold MDS codes is always a latin bitrade. Symmetric difference of two $t$-fold MDS codes may also be a latin bitrade. In this case we say that this latin bitrade embedded into $t$-fold MDS code. The intersection of $t$-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 $t$-fold MDS and admissible cardinalities of the component of $t$-fold MDS. Keywords: MDS code, latin bitrade, component.

Recommendations

• On the cardinality spectrum and the number of Latin bitrades of order 3
• Latin bitrades derived from groups
• An enumeration of spherical latin bitrades
• On the existence of \(k\)-homogeneous Latin bitrades
• Latin hypercubes and MDS codes

Cites work

• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 1455120 (Why is no real title available?)
• scientific article; zbMATH DE number 5228046 (Why is no real title available?)
• A General Product Construction for Error Correcting Codes
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
• On combinatorial Gray codes with distance 3
• On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4
• On multifold MDS and perfect codes that are not splittable into onefold codes
• On the finite completion of partial latin cubes
• On the number of \(n\)-ary quasigroups of finite order.
• \(n\)-ary quasigroups of order 4.

Cited in

(10)

• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
• Minimum supports of functions on the Hamming graphs with spectral constraints
• On existence of perfect bitrades in Hamming graphs
• The extended 1-perfect trades in small hypercubes
• On the number of frequency hypercubes \(F^n(4;2,2) \)
• On the cardinality spectrum and the number of Latin bitrades of order 3
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
• Latin hypercubes and MDS codes
• On extended 1-perfect bitrades
• To the theory of \(q\)-ary Steiner and other-type trades

This page was built for publication: Multidimensional Latin bitrades

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350856)