Payel Chandra

collaborators

2 papers

cs.IT2026

Cyclic Codes of Length 7_p^s over F_p^m + uF_p^m : Characterization, Duals, and Applications to Quantum and LCD Codes

Payel Chandra, Kalyan Hansda

Let $R_{2} = F_{p^{m}} + u F_{p^{m}}$ ( $u^{2} = 0$ ), where $p$ is an odd prime and $m, s \in N$ . For $p \equiv 3, 5 (mod 7)$ with $g cd (m, 6) = 1$ , the cyclotomic…

cs.IT2026

On symbol-pair distance of repeated-root constacyclic codes of length $4 p^{s}$ over $F_{p^{m}} + u F_{p^{m}} + u^{2} F_{p^{m}}$

Payel Chandra, Kalyan Hansda

This paper completely determines the symbol-pair distance distributions of all repeated-root $Δ$ -constacyclic codes of length $4 p^{s}$ over the finite commutative chain ring $R_{3}…

Cyclic Codes of Length 7_p^s over F_p^m + uF_p^m : Characterization, Duals, and Applications to Quantum and LCD Codes

On symbol-pair distance of repeated-root constacyclic codes of length 4ps over Fpm​+uFpm​+u2Fpm​

On symbol-pair distance of repeated-root constacyclic codes of length $4 p^{s}$ over $F_{p^{m}} + u F_{p^{m}} + u^{2} F_{p^{m}}$