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

Cites Work

Title not available (Why is that?)
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
Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
Algebraically punctured cyclic codes
A Bound for Error-Correcting Codes
Polynomial weights and code constructions
On repeated-root cyclic codes
Repeated-root cyclic codes
Repeated-root constacyclic codes of length
Matrix-product structure of repeated-root cyclic codes over finite fields
Matrix-product codes over \(\mathbb{F}_q\)
Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
On repeated-root constacyclic codes of length \(4p^s\)
Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
The Minimum Hamming Distance of Cyclic Codes of Length 2p s
Divisibility of codes meeting the Griesmer bound
Minimum possible block length of a linear binary code for some distances
On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
On matrix-product structure of repeated-root constacyclic codes over finite fields
Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
Codes for Symbol-Pair Read Channels
On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)

Cited In (4)

On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
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

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)