Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over \({{\mathbb{F}_{p^m}[u]}/{\langle u^3\rangle}}\)
Round 1
Reviewer 1 Report
See the attached file.
Comments for author File: 
Comments.pdf
Author Response
Please see the attachment
Author Response File: Author Response.pdf
Reviewer 2 Report
The authors determine all symbol-pair distance of γ-constacyclic codes with length ps over R=F+uF+u2F (u3=0), where F is the finite field of pm elements and γ∈F. The obtained results are strongly based on results of two of the authors presented in another paper ([27]).
Sufficiently many new interesting results are obtained and I recommend paper to be published. I have only few remarks.
On page 7, the second row the word "the" is repeated.
In Example 1 the second sentence is strange in my opinion - γ is nonzero element of F, thus it is unity. No need to list elements of F.
More detail explanations (e.g. inequalities) in the proofs will facilitate reading and increase interest to the subject.
Author Response
Please see the attachment
Author Response File: Author Response.pdf
