Block composition algorithm for constructing orthogonal n-ary operations
DOI10.1016/J.DISC.2016.11.012zbMATH Open1422.94050OpenAlexW2559346188MaRDI QIDQ2397540FDOQ2397540
Fedir M. Sokhatsky, Iryna V. Fryz
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.11.012
Recommendations
composition algorithmblock composition algorithmblock-wise recursive algorithmorthogonality of operationsretract orthogonality of operations
Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25)
Cites Work
- Title not available (Why is that?)
- Orthogonal hypercubes and \(n\)-ary operations.
- Title not available (Why is that?)
- Pairwise orthogonality of \(n\)-ary operations.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursive MDS-codes and recursive differentiable quasigroups
- Title not available (Why is that?)
Cited In (6)
- On the use of binary operations for the construction of a multiply transitive class of block transformations
- Title not available (Why is that?)
- Algorithm for the complement of orthogonal operations
- CASOP: A fast algorithm for computing the \(n\)-ary composition of a binary associative operator
- Construction of medial ternary self-orthogonal quasigroupsm
- Title not available (Why is that?)
This page was built for publication: Block composition algorithm for constructing orthogonal \(n\)-ary operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397540)
