加载中…
We define the Euclidean hull of a linear code as the intersection of and its Euclidean dual . The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing the automorphism group of a linear code and checking permutation equivalence of two linear codes. It has been recently proved that any -ary linear code with gives rise to a linear code with the same parameters and having zero dimensional Euclidean hull, which is known as a linear complementary dual code. This paper aims to explore explicit constructions of families of MDS linear codes with one dimensional Euclidean hull. We obtain several classes of such codes.

生成讲解博客的中文版本

生成AI智能校验的中文版本