Block composition algorithm for constructing orthogonal n-ary operations
From MaRDI portal
Publication:2397540
Recommendations
Cites work
- scientific article; zbMATH DE number 4204670 (Why is no real title available?)
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- scientific article; zbMATH DE number 5247093 (Why is no real title available?)
- scientific article; zbMATH DE number 5053693 (Why is no real title available?)
- On a construction of orthogonal operations
- Orthogonal hypercubes and \(n\)-ary operations.
- Pairwise orthogonality of \(n\)-ary operations.
- Recursive MDS-codes and recursive differentiable quasigroups
- Secret-sharing schemes and orthogonal systems of \(k\)-ary operations
Cited in
(7)- On the use of binary operations for the construction of a multiply transitive class of block transformations
- On a construction of orthogonal operations
- 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
- Solution and full classification of generalized binary functional equations of the type \((3;3;0)\)
- scientific article; zbMATH DE number 6932165 (Why is no real title available?)
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)