On symbol-pair distances of repeated-root constacyclic codes of length $2p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ and MDS symbol-pair codes

DOI10.1007/s00200-021-00534-3OpenAlexW3215505329MaRDI QIDQ6056621

Hai Quang Dinh, Abhay Kumar Singh, Madhu Kant Thakur

Publication date: 30 October 2023

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-021-00534-3

zbMATH Keywords

constacyclic codes finite chain rings repeated-root codes symbol-pair distance symbol-pair MDS codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Cites Work

Unnamed Item
On constacyclic codes of length $4p^s$ over $\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}$
Constacyclic codes of length $p^s$ over $\mathbb F_{p^m} + u\mathbb F_{p^m}$
Constacyclic codes of length $2p^{s}$ over $\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}$
New constructions of MDS symbol-pair codes
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
On Hamming and $b$-symbol distance distributions of repeated-root constacyclic codes of length $4p^s$ over $\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}$
On the symbol-pair distances of repeated-root constacyclic codes of length $2 p^s$
On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
A Construction of New MDS Symbol-Pair Codes
Cyclic and Negacyclic Codes Over Finite Chain Rings
On cyclic MDS codes of length q over GF(q) (Corresp.)
Semisimple cyclic and Abelian codes. II
Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
Codes for Symbol-Pair Read Channels
Maximum Distance Separable Codes for Symbol-Pair Read Channels
Repeated root constacyclic codes of length mp^s over 𝔽_p^r + u𝔽_p^r + ⋯ + u^e-1𝔽_p^r
Polynomial weights and code constructions

This page was built for publication: On symbol-pair distances of repeated-root constacyclic codes of length $2p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ and MDS symbol-pair codes

On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codes