Let Fq be a finite field of size q and Fq∗ the set of non-zero elements of Fq. In this paper, we study a class of twisted generalized Reed-Solomon code Cℓ(D,k,η,v)⊂Fqn generated by the following matrix v1v1α1⋮v1α1ℓ−1v1α1ℓ+1⋮v1α1k−1v1(α1ℓ+ηα1q−2)v2v2α2⋮v2α2ℓ−1v2α2ℓ+1⋮v2α2k−1v2(α2ℓ+ηα2q−2)⋯⋯⋱⋯⋯⋱⋯⋯vnvnαn⋮vnαnℓ−1vnαnℓ+1⋮vnαnk−1vn(αnℓ+ηαnq−2) where 0≤ℓ≤k−1, the evaluation set D={α1,α2,⋯,αn}⊆Fq∗, scaling vector v=(v1,v2,⋯,vn)∈(Fq∗)n and η∈Fq∗. The minimum distance and dual code of Cℓ(D,k,η,v) will be determined. For the special case ℓ=k−1, a sufficient and necessary condition for Ck−1(D,k,η,v) to be self-dual will be given. We will also show that the code is MDS or near-MDS. Moreover, a complete classification when the code is near-MDS or MDS will be presented.
Cite
@article{arxiv.2202.09011,
title = {A class of twisted generalized Reed-Solomon codes},
author = {Jun Zhang and Zhengchun Zhou and Chunming Tang},
journal= {arXiv preprint arXiv:2202.09011},
year = {2022}
}