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}$

DOI10.1007/s12190-020-01456-yOpenAlexW3109759153MaRDI QIDQ2053264

Abhay Kumar Singh, Madhu Kant Thakur, Hai Quang Dinh

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01456-y

zbMATH Keywords

Hamming distance MDS codes constacyclic codes finite chain rings repeated-root codes $b$-symbol distance

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

Repeated-root constacyclic codes of length $3lp^s$ and their dual codes
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}$
Repeated-root constacyclic codes of length
Maximum distance separable codes for $b$-symbol read channels
On the Hamming distances of repeated-root constacyclic codes of length $4p^s$
Structure of repeated-root constacyclic codes of length $3p^s$ and their duals
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
Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
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
On the Hamming distance of linear codes over a finite chain ring
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pm
Optimal b-symbol constacyclic codes with respect to the Singleton bound
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Codes for Symbol-Pair Read Channels
On a class of constacyclic codes of length 4ps over 𝔽pm + u𝔽pm
On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗
Repeated root constacyclic codes of length mp^s over 𝔽_p^r + u𝔽_p^r + ⋯ + u^e-1𝔽_p^r
On repeated-root cyclic codes
Repeated-root cyclic codes

This page was built for publication: 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 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}\)