Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)

DOI10.1007/s00200-020-00432-0zbMath1458.94323OpenAlexW3020002337MaRDI QIDQ780367

D. Kharzeev

Publication date: 15 July 2020

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-020-00432-0

zbMATH Keywords

Hamming distanceconstacyclic codesfinite chain ringsrepeated-root codes

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items

A note on: ``Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\)

Uses Software

• Code Tables

Cites Work

• Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
• Repeated-root constacyclic codes of length
• Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^e \rangle\) of type 2]
• On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
• Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
• Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
• Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
• An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)
• Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
• On matrix-product structure of repeated-root constacyclic codes over finite fields
• An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
• On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
• ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4p^s
• A class of linear codes of length 2 over finite chain rings
• The Minimum Hamming Distance of Cyclic Codes of Length 2p s
• On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
• Optimal b-symbol constacyclic codes with respect to the Singleton bound
• Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
• On repeated-root cyclic codes
• Repeated-root cyclic codes