Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
type: Item
instance of: scholarly article
title: Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
zbMATH Open document ID: 1458.94323
author: D. Kharzeev
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2020-07-15T00:00:00Z
Mathematics Subject Classification ID: 94B15
zbMATH DE Number: 7221087
zbMATH Keywords: repeated-root codes
zbMATH Keywords: constacyclic codes
zbMATH Keywords: Hamming distance
zbMATH Keywords: finite chain rings
describes a project that uses: Code Tables
MaRDI profile type: Publication
full work available at URL: s00200-020-00432-0
OpenAlex ID: W3020002337
cites work: Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
cites work: A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u] / \langle u^e \rangle\) of type 2
cites work: An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
cites work: A class of linear codes of length 2 over finite chain rings
cites work: Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
cites work: On matrix-product structure of repeated-root constacyclic codes over finite fields
cites work: An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)
cites work: Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
cites work: On repeated-root cyclic codes
cites work: On repeated-root constacyclic codes of length \(4p^s\)
cites work: Repeated-root constacyclic codes of length
cites work: Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
cites work: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
cites work: Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
cites work: On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
cites work: On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
cites work: Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
cites work: Optimal b-symbol constacyclic codes with respect to the Singleton bound
cites work: Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
cites work: The Minimum Hamming Distance of Cyclic Codes of Length 2p s
cites work: Repeated-root cyclic codes
DOI: 10.1007/S00200-020-00432-0
description: scientific article; zbMATH DE number 7221087