Minimum distance of Hermitian two-point codes (Q2638427)

The objective of the paper is to give a shorter and simpler new proof of the minimum distance of Hermitian two-points codes. Although similar research has been done in the area before, the article uses some of the previous results, but tries a different approach to the field. The author introduces the new notion of multiplicity of the Hermitiam two-point code. Than, it uses the concept to find a lower bound, and finally proof the minimum distance of Hermitian two-points codes. The formulas introduced in the paper have the advantage of a shorter and simpler proof than the previous work in the area. They also provide a different way to compute the distance, based on the multiplicity notion introduced. Due to the facts mentioned, the article can be used as a reference point for documentation and future research in the area.