Abstract: Let p be a prime and let b be an integer. MDS b-symbol codes are a direct generalization of MDS codes. The γ-constacyclic codes of length pˢ over the finite commutative chain ring Fₚm [u]/ < u² > had been classified into four distinct types, where is a nonzero element of the field Fₚm. Let C₃ be a code of Type 3. In this paper, we obtain the b-symbol distance db(C₃) of the code C₃. Using this result, necessary and sufficient conditions under which C₃ is an MDS b-symbol code are given.
Abstract: MDS matrices are of great significance in the design
of block ciphers and hash functions. In the present paper, we
investigate the problem of constructing MDS matrices which are
both lightweight and low-latency. We propose a new method of
constructing lightweight MDS matrices using circulant matrices
which can be implemented efficiently in hardware. Furthermore, we
provide circulant MDS matrices with as few bit XOR operations as
possible for the classical dimensions 4 × 4, 8 × 8 over the space of
linear transformations over finite field F42
. In contrast to previous
constructions of MDS matrices, our constructions have achieved
fewer XORs.