• Corpus ID: 201074595

RT distance and weight distributions of Type 1 constacyclic codes of length 4 p

@inproceedings{Dinh2019RTDA,
  title={RT distance and weight distributions of Type 1 constacyclic codes of length 4 p},
  author={Hai Quang Dinh and Bac Trong Nguyen and Songsak Sriboonchitta},
  year={2019}
}
For any odd prime p such that p ≡ 1 (mod 4) , the class of Λ -constacyclic codes of length 4p over the finite commutative chain ring Ra = Fpm [u] ⟨ua⟩ = Fpm + uFpm + · · · + u Fpm , for all units Λ of Ra that have the form Λ = Λ0+uΛ1+ · · ·+uΛa−1 , where Λ0,Λ1, . . . ,Λa−1 ∈ Fpm , Λ0 ̸=0, Λ1 ̸=0 , is investigated. If the unit Λ is a square, each Λ -constacyclic code of length 4p is expressed as a direct sum of a −λ -constacyclic code and a λ -constacyclic code of length 2p . In the main case… 
1 Citations

Constacyclic codes of length 4ps over the Galois ring GR(pa, m)

The Rosenbloom-Tsfasman (RT) distance, Hamming distance and weight distribution of Type (1) $\lambda$-constacyclic codes of length $4p^s$ are obtained when $\ lambda$ is not a square and the dual of the above code is self-orthogonal and self-dual.

References

SHOWING 1-10 OF 43 REFERENCES

On a Class of Constacyclic Codes of Length 4ps over Fpm[u]〈 ua 〉

For any odd prime p such that pm ≡ 3 (mod 4), consider all units Λ of the finite commutative chain ring [Formula: see text] that have the form Λ = Λ0 + uΛ1 + ⋯ + ua−1 Λa−1, where Λ0, Λ1, …, Λa−1 ∊

Repeated-root constacyclic codes of prime power length over and their duals

CONSTACYCLIC CODES OF LENGTH np s OVER F p m + u F p m

Representations for all distinct cyclic codes, negacyclic codes and their dual codes of length np s over R are obtained, and self-duality for these codes are determined.

On (1-u) -cyclic codes over Fpk + uFpk

Negacyclic codes of length 2p2 over 𝔽pm + u𝔽pm

Polynomial weights and code constructions

It is shown that the polynomials (x - c)^i, i = 0,1,2,\cdots, have the "weight-retaining" property that any linear combination of these polynmials with coefficients in GF(q) has Hamming weight at least as great as that of the minimum degree polynomial included.

Repeated-root constacyclic codes of length 2ps

  • H. Dinh
  • Computer Science, Mathematics
    Finite Fields Their Appl.
  • 2012

On cyclic MDS codes of length q over GF(q)

There exists a nontrivial cyclic extended Reed-Solomon code of length q over GF (q) if and only if q is a prime.