Multidimensional Latin bitrades

DOI10.1134/S0037446613020146zbMath1268.05034arXiv1104.1295OpenAlexW2593850864MaRDI QIDQ350856

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

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

Related Items (8)

On the number of frequency hypercubes \(F^n(4;2,2) \) ⋮ On the cardinality spectrum and the number of Latin bitrades of order 3 ⋮ To the theory of \(q\)-ary Steiner and other-type trades ⋮ 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 ⋮ Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
• On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4
• On the finite completion of partial latin cubes
• On multifold MDS and perfect codes that are not splittable into onefold codes
• On combinatorial Gray codes with distance 3
• A General Product Construction for Error Correcting Codes
• n-Ary Quasigroups of Order 4
• On the number of n-ary quasigroups of finite order

This page was built for publication: Multidimensional Latin bitrades