LAUSR

Nowadays it is vital to have a robust mechanism that can identify people, objects, animals, and living beings, for example, for agricultural, health and national security purposes. Some drawbacks occur when very many objects need to be identified, and the tool is unable to support all of them. Even if the mechanism could tag them all, it is also important that the labels or codewords not resemble each other, to be able to detect and correct errors. To solve this problem, this article proposes an MDS (Maximum Distance Separable) code C with length 11 and dimension 7 over the finite field F210${\mathbb {F}}_{2^{10}}$. Furthermore, we construct a subcode of C with capacity for 327 different identifiers. Concretely we consider the set of all codewords with entries belonging to the subfield of F210${\mathbb {F}}_{2^{10}}$ isomorphic to F25${\mathbb {F}}_{2^{5}}$. A decoding algorithm and an encryption method using elliptic curves cryptography for the codewords are also proposed.