| Abstrakt: |
Let a and m be positive integers and λ be any unit in GR (p a , m) of the form λ = (σ 0 + p σ 1 + p 2 z) , where σ 0 , σ 1 ∈ T (p , m) \ { 0 } and z ∈ GR (p a , m) . The symbol-pair distance of all such λ -constacyclic codes over GR (p a , m) of length p s are determined. As an application, we identify all maximum distance separable (MDS) λ -constacyclic codes of length p s over GR (p a , m) with respect to the symbol-pair distance. We give numerous examples of newly constructed MDS symbol-pair codes, i.e., new optimal symbol-pair codes with respect to the Singleton bound. [ABSTRACT FROM AUTHOR] |
Full text from SpringerLink