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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.