The Tensor Rank of Semifields of Order 16 and 81
Combinatorics
2021-02-04 v1
Abstract
We determine the tensor rank of all semifields of order 16 over and of all semifields of order 81 over . Our results imply that some semifields of order 81 have lower multiplicative complexity than the finite field over . We prove new results on the correspondence between linear codes and tensor rank, including a generalisation of a theorem of Brockett and Dobkin to arbitrary tensors, which makes the problem computationally feasible.
Cite
@article{arxiv.2102.01997,
title = {The Tensor Rank of Semifields of Order 16 and 81},
author = {Michel Lavrauw and John Sheekey},
journal= {arXiv preprint arXiv:2102.01997},
year = {2021}
}