Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds

DOI10.1016/j.ffa.2020.101794zbMath1465.94124OpenAlexW3117798232MaRDI QIDQ1995224

Woraphon Yamaka, Xiaoqiang Wang, Hong-wei Liu, Hai Quang Dinh

Publication date: 19 February 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2020.101794

zbMATH Keywords

Singleton bound Griesmer bound minimum distance constacyclic code repeated-root code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

Unnamed Item
Matrix-product structure of repeated-root cyclic codes over finite fields
Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
Repeated-root constacyclic codes of length
Minimum possible block length of a linear binary code for some distances
Divisibility of codes meeting the Griesmer bound
On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
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
Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
On matrix-product structure of repeated-root constacyclic codes over finite fields
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
ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4p^s
The Minimum Hamming Distance of Cyclic Codes of Length 2p s
On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
Codes for Symbol-Pair Read Channels
Algebraically punctured cyclic codes
A Bound for Error-Correcting Codes
Polynomial weights and code constructions
On repeated-root cyclic codes
Repeated-root cyclic codes
Matrix-product codes over \(\mathbb{F}_q\)

This page was built for publication: Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds