• 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}
}
• Published 2019
• Computer Science, Mathematics
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
• Mathematics
ArXiv
• 2019
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

• Mathematics
Algebra Colloquium
• 2019
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 ∊
• Computer Science, Mathematics
• 2018
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.
• Mathematics, Computer Science
Appl. Math. Lett.
• 2008
• Computer Science
IEEE Trans. Inf. Theory
• 1973
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.
• H. Dinh
• Computer Science, Mathematics
Finite Fields Their Appl.
• 2012
• Mathematics
IEEE Trans. Inf. Theory
• 1986
There exists a nontrivial cyclic extended Reed-Solomon code of length q over GF (q) if and only if q is a prime.