Abstract
We determine the tensor rank of all semifields of order 16 over F2 and of all semifields of order 81 over F3. Our results imply that some semifields of order 81 have lower multiplicative complexity than the finite field F81 over F3. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
