On the cardinality spectrum and the number of Latin bitrades of order 3

DOI10.1134/S0032946019040021MaRDI QIDQ2190924zbMATH OpenOpenAlexWikidataFDO

Authors Denis S. Krotov, Vladimir N. Potapov

Publication date 23 June 2020

Published in Problems of Information Transmission (Search for Journal in Brave)

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

zbMATH Keywords

Boolean functionscombinatorial configurationsLatin bitradesReed-Muller codesunitrades

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Abstract: By a (latin) unitrade, we call a set of vertices of the Hamming graph that is intersects with every maximal clique in $0$ or $2$ vertices. A bitrade is a bipartite unitrade, that is, a unitrade splittable into two independent sets. We study the cardinality spectrum of the bitrades in the Hamming graph $H(n,k)$ with $k=3$ (ternary hypercube) and the growth of the number of such bitrades as $n$ grows. In particular, we determine all possible (up to $2.5cdot{2}^n$) and large (from $14cdot{3}^{n-3}$) cardinatities of bitrades and prove that the cardinality of a bitrade is compartible to $0$ or $2^n$ modulo $3$ (this result has a treatment in terms of a ternary code of Reed--Muller type). A part of the results is valid for any $k$. We prove that the number of nonequivalent bitrades is not less than $2^{(2/3-o(1))n}$ and is not greater than $2^{alph{a}^n}$, $alpha<2$, as $noinfty$.

Recommendations

• Multidimensional Latin bitrades
• On existence of perfect bitrades in Hamming graphs
• Partitioning 3-homogeneous Latin bitrades
• An enumeration of spherical latin bitrades
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph

Cites work

• 10.17686/sced_rusnauka_2008-1040
• n-ary quasigroups of order 4.
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
• Classification algorithms for codes and designs
• Construction of perfect binary codes by sequential shifts of -components
• scientific article; zbMATH DE number 3080144 (Why is no real title available?)
• Multidimensional Latin bitrades
• On complexity of a particular Boolean functions class
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• On the gaps of the spectrum of volumes of trades
• On the support size of null designs of finite ranked posets
• On the volumes and affine types of trades
• On the weight enumeration of weights less than 2.5d of Reed—Muller codes
• On the weight structure of Reed-Muller codes
• On trades: An update
• Switching codes and designs
• The theory and application of latin bitrades: A survey
• To the theory of \(q\)-ary Steiner and other-type trades

Cited in

(7)

• Enumeration of Latin arrays. I: Case \(n\leq 3\)
• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
• The number of B₃-sets of a given cardinality
• Multidimensional Latin bitrades
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
• Characterization of polystochastic matrices of order 4 with zero permanent
• On the number of frequency hypercubes F^n(4;2,2)

This page was built for publication: On the cardinality spectrum and the number of Latin bitrades of order 3

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