Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\)

DOI10.1007/s00200-022-00544-9OpenAlexW4214917220MaRDI QIDQ6122405

Hai Quang Dinh, Pramod Kumar Kewat, Nilay Kumar Mondal

Publication date: 1 March 2024

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-022-00544-9

zbMATH Keywords

MDS codescodes over finite ringsconstacyclic codesrepeated-root codessymbol-pair distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Cites Work

• Unnamed Item
• Repeated-root constacyclic codes of prime power lengths over finite chain rings
• On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
• On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
• A Construction of New MDS Symbol-Pair Codes
• Some Repeated-Root Constacyclic Codes Over Galois Rings
• Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
• On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
• On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
• Codes for Symbol-Pair Read Channels
• Maximum Distance Separable Codes for Symbol-Pair Read Channels

This page was built for publication: Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\)