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.101794MaRDI QIDQ1995224zbMATH OpenOpenAlexFDO

Authors Xiaoqiang Wang, Woraphon Yamaka, Hai Quang Dinh, Hongwei Liu

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

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

Mathematics Subject Classification ID

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

Recommendations

On the Hamming distances of repeated-root constacyclic codes of length 4p^s
Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
Repeated-root constacyclic codes of prime power length
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
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}\)

Cites work

scientific article; zbMATH DE number 3577144 (Why is no real title available?)
A Bound for Error-Correcting Codes
Algebraically punctured cyclic codes
Codes for Symbol-Pair Read Channels
Divisibility of codes meeting the Griesmer bound
Matrix-product codes over \(\mathbb{F}_q\)
Matrix-product structure of repeated-root cyclic codes over finite fields
Minimum possible block length of a linear binary code for some distances
Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes
On matrix-product structure of repeated-root constacyclic codes over finite fields
On repeated-root constacyclic codes of length \(4p^s\)
On repeated-root cyclic codes
On the Hamming distances of repeated-root constacyclic codes of length 4p^s
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Polynomial weights and code constructions
Repeated-root constacyclic codes of length
Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
Repeated-root constacyclic codes of length 3lp^s and their dual codes
Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
Repeated-root cyclic codes
Structure of repeated-root constacyclic codes of length 3p^s and their duals
The minimum Hamming distance of cyclic codes of length \(2p^s\)

Cited in

(7)

On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)
Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
On the Hamming distances of repeated-root constacyclic codes of length 4p^s

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995224)