The tensor product of one code endowed with the Hamming metric and rank is analyzed. This gives a which naturally inherits sum-rank metric. Specializing to cyclic skew-cyclic code, resulting turns out belong recently introduced family cyclic-skew-cyclic codes. A group theoretical description these codes given, after investigating semilinear isometries in Finally, generalization Roos Hartmann-Tz...

Finding the minimum distance of linear codes is one main problems in coding theory. The importance comes from its error-correcting and error-detecting capability handled codes. It was proven that this problem an NP-hard solution can be guessed verified polynomial time but no particular rule followed to make guess some meta-heuristic approaches literature have been used solve problem. In paper, ...

A method is given for the construction of linear codes with prescribed minimum distance and also prescribed minimum distance of the dual code. This works for codes over arbitrary finite fields. In the case of binary codes Matsumoto et al. showed how such codes can be used to construct cryptographic Boolean functions. This new method allows to compute new bounds on the size of such codes, extend...