The Experts below are selected from a list of 318 Experts worldwide ranked by ideXlab platform
Hai Q. Dinh - One of the best experts on this subject based on the ideXlab platform.
-
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Journal of Algebra and Its Applications, 2019Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Sampurna Satpati, Woraphon YamakaAbstract:Let p be an odd prime, s and m be positive integers and λ be a Nonzero Element of 𝔽pm. The λ-constacyclic codes of length ps over 𝔽pm are linearly ordered under set theoretic inclusion as ideals of...
-
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Journal of Algebra and Its Applications, 2019Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Sampurna Satpati, Woraphon YamakaAbstract:Let [Formula: see text] be an odd prime, [Formula: see text] and [Formula: see text] be positive integers and [Formula: see text] be a Nonzero Element of [Formula: see text]. The [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] are linearly ordered under set theoretic inclusion as ideals of the chain ring [Formula: see text]. Using this structure, the symbol-triple distances of all such [Formula: see text]-constacyclic codes are established in this paper. All maximum distance separable symbol-triple constacyclic codes of length [Formula: see text] are also determined as an application.
-
on the symbol pair distance of repeated root constacyclic codes of prime power lengths
IEEE Transactions on Information Theory, 2018Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Bac T Nguyen, Songsak SriboonchittaAbstract:Let $p$ be a prime, and $\lambda$ be a Nonzero Element of the finite field $\mathbb F_{p^{m}}$ . The $\lambda$ -constacyclic codes of length $p^{s}$ over $\mathbb F_{p^{m}}$ are linearly ordered under set-theoretic inclusion, i.e., they are the ideals $\langle (x-\lambda _{0})^{i} \rangle$ , $0 \leq i \leq p^{s}$ of the chain ring $[({\mathbb F_{p^{m}}[x]})/({\langle x^{p^{s}}-\lambda \rangle })]$ . This structure is used to establish the symbol-pair distances of all such $\lambda$ -constacyclic codes. Among others, all maximum distance separable symbol-pair constacyclic codes of length $p^{s}$ are obtained.
Songsak Sriboonchitta - One of the best experts on this subject based on the ideXlab platform.
-
on the symbol pair distance of repeated root constacyclic codes of prime power lengths
IEEE Transactions on Information Theory, 2018Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Bac T Nguyen, Songsak SriboonchittaAbstract:Let $p$ be a prime, and $\lambda$ be a Nonzero Element of the finite field $\mathbb F_{p^{m}}$ . The $\lambda$ -constacyclic codes of length $p^{s}$ over $\mathbb F_{p^{m}}$ are linearly ordered under set-theoretic inclusion, i.e., they are the ideals $\langle (x-\lambda _{0})^{i} \rangle$ , $0 \leq i \leq p^{s}$ of the chain ring $[({\mathbb F_{p^{m}}[x]})/({\langle x^{p^{s}}-\lambda \rangle })]$ . This structure is used to establish the symbol-pair distances of all such $\lambda$ -constacyclic codes. Among others, all maximum distance separable symbol-pair constacyclic codes of length $p^{s}$ are obtained.
Abhay Kumar Singh - One of the best experts on this subject based on the ideXlab platform.
-
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Journal of Algebra and Its Applications, 2019Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Sampurna Satpati, Woraphon YamakaAbstract:Let p be an odd prime, s and m be positive integers and λ be a Nonzero Element of 𝔽pm. The λ-constacyclic codes of length ps over 𝔽pm are linearly ordered under set theoretic inclusion as ideals of...
-
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Journal of Algebra and Its Applications, 2019Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Sampurna Satpati, Woraphon YamakaAbstract:Let [Formula: see text] be an odd prime, [Formula: see text] and [Formula: see text] be positive integers and [Formula: see text] be a Nonzero Element of [Formula: see text]. The [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] are linearly ordered under set theoretic inclusion as ideals of the chain ring [Formula: see text]. Using this structure, the symbol-triple distances of all such [Formula: see text]-constacyclic codes are established in this paper. All maximum distance separable symbol-triple constacyclic codes of length [Formula: see text] are also determined as an application.
-
on the symbol pair distance of repeated root constacyclic codes of prime power lengths
IEEE Transactions on Information Theory, 2018Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Bac T Nguyen, Songsak SriboonchittaAbstract:Let $p$ be a prime, and $\lambda$ be a Nonzero Element of the finite field $\mathbb F_{p^{m}}$ . The $\lambda$ -constacyclic codes of length $p^{s}$ over $\mathbb F_{p^{m}}$ are linearly ordered under set-theoretic inclusion, i.e., they are the ideals $\langle (x-\lambda _{0})^{i} \rangle$ , $0 \leq i \leq p^{s}$ of the chain ring $[({\mathbb F_{p^{m}}[x]})/({\langle x^{p^{s}}-\lambda \rangle })]$ . This structure is used to establish the symbol-pair distances of all such $\lambda$ -constacyclic codes. Among others, all maximum distance separable symbol-pair constacyclic codes of length $p^{s}$ are obtained.
Woraphon Yamaka - One of the best experts on this subject based on the ideXlab platform.
-
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Journal of Algebra and Its Applications, 2019Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Sampurna Satpati, Woraphon YamakaAbstract:Let p be an odd prime, s and m be positive integers and λ be a Nonzero Element of 𝔽pm. The λ-constacyclic codes of length ps over 𝔽pm are linearly ordered under set theoretic inclusion as ideals of...
-
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Journal of Algebra and Its Applications, 2019Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Sampurna Satpati, Woraphon YamakaAbstract:Let [Formula: see text] be an odd prime, [Formula: see text] and [Formula: see text] be positive integers and [Formula: see text] be a Nonzero Element of [Formula: see text]. The [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] are linearly ordered under set theoretic inclusion as ideals of the chain ring [Formula: see text]. Using this structure, the symbol-triple distances of all such [Formula: see text]-constacyclic codes are established in this paper. All maximum distance separable symbol-triple constacyclic codes of length [Formula: see text] are also determined as an application.
Bac T Nguyen - One of the best experts on this subject based on the ideXlab platform.
-
on the symbol pair distance of repeated root constacyclic codes of prime power lengths
IEEE Transactions on Information Theory, 2018Co-Authors: Hai Q. Dinh, Abhay Kumar Singh, Bac T Nguyen, Songsak SriboonchittaAbstract:Let $p$ be a prime, and $\lambda$ be a Nonzero Element of the finite field $\mathbb F_{p^{m}}$ . The $\lambda$ -constacyclic codes of length $p^{s}$ over $\mathbb F_{p^{m}}$ are linearly ordered under set-theoretic inclusion, i.e., they are the ideals $\langle (x-\lambda _{0})^{i} \rangle$ , $0 \leq i \leq p^{s}$ of the chain ring $[({\mathbb F_{p^{m}}[x]})/({\langle x^{p^{s}}-\lambda \rangle })]$ . This structure is used to establish the symbol-pair distances of all such $\lambda$ -constacyclic codes. Among others, all maximum distance separable symbol-pair constacyclic codes of length $p^{s}$ are obtained.
