On the number of frequency hypercubes \(F^n(4;2,2) \)

DOI10.1134/S0037446621050165zbMath1473.05037arXiv2005.10887OpenAlexW3202504086MaRDI QIDQ820504

Minjia Shi, Shu-Kai Wang, Xiao-Xiao Li, Denis S. Krotov

Publication date: 27 September 2021

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

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

zbMATH Keywords

Latin hypercubeMDS codefrequency squaretesting setfrequency hypercube

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Linear codes (general theory) (94B05) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15)

Uses Software

• nauty
• OEIS
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional Latin bitrades
• Classification algorithms for codes and designs
• On the cardinality spectrum and the number of Latin bitrades of order 3
• Practical graph isomorphism. II.
• On extensions of partial n-quasigroups of order 4
• n-Ary Quasigroups of Order 4
• A Census of Small Latin Hypercubes
• On the number of n-ary quasigroups of finite order

This page was built for publication: On the number of frequency hypercubes \(F^n(4;2,2) \)