On the public citation graph
Repeated-root constacyclic codes of length 3lp and their dual codes
0 signed · 66 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-02181-7_10openalex-snapshot
The Minimum Hamming Distance of Cyclic Codes of Length 2p s
inferredcites →https://doi.org/10.1007/s12095-014-0106-5openalex-snapshot
Repeated-root constacyclic codes of length ℓ t p s and their dual codes
inferredcites →https://doi.org/10.1007/s12095-015-0163-4openalex-snapshot
On constacyclic codes over finite fields
inferredcites →https://doi.org/10.1007/s13226-015-0158-zopenalex-snapshot
A class of constacyclic codes over a finite field-II
inferredcites →https://doi.org/10.1016/j.dam.2014.05.046openalex-snapshot
Repeated-root constacyclic codes of length ℓ p s and their duals
inferredcites →https://doi.org/10.1016/j.disc.2009.07.018openalex-snapshot
On the distances of cyclic codes of length 2e over Z4
inferredcites →https://doi.org/10.1016/j.disc.2013.01.024openalex-snapshot
Structure of repeated-root constacyclic codes of length 3ps and their duals
inferredcites →https://doi.org/10.1016/j.ffa.2004.01.005openalex-snapshot
Cyclotomic numbers and primitive idempotents in the ring GF(q)[x]/(xpn−1)
inferredcites →https://doi.org/10.1016/j.ffa.2007.07.001openalex-snapshot
On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
inferredcites →https://doi.org/10.1016/j.ffa.2011.07.003openalex-snapshot
Repeated-root constacyclic codes of length 2ps
inferredcites →https://doi.org/10.1016/j.ffa.2011.09.005openalex-snapshot
A class of constacyclic codes over a finite field
inferredcites →https://doi.org/10.1016/j.ffa.2012.10.001openalex-snapshot
Constacyclic codes over finite fields
inferredcites →https://doi.org/10.1016/j.ffa.2014.11.006openalex-snapshot
Repeated-root constacyclic codes of length 2 ℓ m p n
inferredcites →https://doi.org/10.1016/j.jalgebra.2010.05.027openalex-snapshot
Constacyclic codes of length p s over F p m + u F p m
inferredcites →https://doi.org/10.1090/conm/609/12150openalex-snapshot
Repeated-Root Cyclic and Negacyclic Codes of Length 6𝑝^{𝑠}
inferredcites →https://doi.org/10.1109/tit.2010.2092415openalex-snapshot
On Self-Dual Cyclic Codes Over Finite Fields
inferredcites →https://doi.org/10.1142/5350openalex-snapshot
Lectures on Finite Fields and Galois Rings
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00200-020-00432-0openalex-snapshot
Hamming distance of repeated-root constacyclic codes of length $$2p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s00200-021-00531-6openalex-snapshot
Quantum MDS and synchronizable codes from cyclic codes of length $$5p^s$$ over $$\mathbb F_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s00200-024-00660-8openalex-snapshot
Some results on the Hamming distances of cyclic codes
inferred← citeshttps://doi.org/10.1007/s00200-025-00694-6openalex-snapshot
Amds codes and quantum AMDS codes of length $$3p^s$$ over $${\mathbb {F}}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s11128-019-2389-0openalex-snapshot
Two new families of quantum synchronizable codes
inferred← citeshttps://doi.org/10.1007/s11128-021-03306-7openalex-snapshot
Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length $$4p^s$$ over $${\mathbb {F}}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s11128-023-03958-7openalex-snapshot
Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length $$3p^s$$
inferred← citeshttps://doi.org/10.1007/s12190-020-01383-yopenalex-snapshot
The minimum Hamming distances of repeated-root cyclic codes of length $$6p^s$$ and their MDS codes
inferred← citeshttps://doi.org/10.1007/s12190-020-01456-yopenalex-snapshot
On Hamming and b-symbol distance distributions of repeated-root constacyclic codes of length $$4p^s$$ over $${\pmb {\mathbb {F}}}_{p^m}+u {\pmb {\mathbb {F}}}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s40840-019-00787-9openalex-snapshot
Repeated-Root Constacyclic Codes of Length $$k\ell p^s$$
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.026openalex-snapshot
The Hamming distances of repeated-root cyclic codes of length 5ps
inferred← citeshttps://doi.org/10.1016/j.disc.2017.04.018openalex-snapshot
Repeated-root constacyclic codes of length n l p s
inferred← citeshttps://doi.org/10.1016/j.disc.2019.01.023openalex-snapshot
On the Hamming distances of repeated-root constacyclic codes of length 4ps
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.017openalex-snapshot
On the symbol-pair distances of repeated-root constacyclic codes of length 2ps
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111609openalex-snapshot
Structure of some classes of repeated-root constacyclic codes of length 2Kℓmpn
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113593openalex-snapshot
On Hamming distance distributions of repeated-root constacyclic codes of length 3p over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101648openalex-snapshot
Self-reciprocal and self-conjugate-reciprocal irreducible factors of x − λ and their applications
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101794openalex-snapshot
Hamming distances of constacyclic codes of length 3p and optimal codes with respect to the Griesmer and Singleton bounds
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102420openalex-snapshot
Hamming distances of constacyclic codes of length 7p over Fpm
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102542openalex-snapshot
Repeated-root constacyclic codes of length klp over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102695openalex-snapshot
Closed formulas for the generators of all constacyclic codes and for the factorization of X − 1, the n-th cyclotomic polynomial and every composition of the form f(X) over a finite field for arbitrary positive integers n
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102761openalex-snapshot
Explicit representatives and sizes of cyclotomic cosets and their application to cyclic codes over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102860openalex-snapshot
On constacyclic codes of length 10ps over Fpm and their optimal codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102902openalex-snapshot
BCH and LCD cyclic codes of length n = λ(qm + 1) over finite fields
inferred← citeshttps://doi.org/10.1109/access.2019.2937544openalex-snapshot
Negacyclic Codes of Length $2^mp^n$ Over Finite Fields
inferred← citeshttps://doi.org/10.1109/access.2019.2963289openalex-snapshot
On a Family of Quantum Synchronizable Codes Based on the $(\lambda(u + v)|u - v)$ Construction
inferred← citeshttps://doi.org/10.1109/access.2020.2974866openalex-snapshot
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6ps
inferred← citeshttps://doi.org/10.1109/access.2020.2976536openalex-snapshot
On the Hamming Distances of Constacyclic Codes of Length 5pS
inferred← citeshttps://doi.org/10.1109/access.2021.3117561openalex-snapshot
Some Classes of New Quantum MDS and Synchronizable Codes Constructed From Repeated-Root Cyclic Codes of Length 6ps
inferred← citeshttps://doi.org/10.1109/access.2022.3219498openalex-snapshot
On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m
inferred← citeshttps://doi.org/10.1109/tit.2017.2726691openalex-snapshot
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
inferred← citeshttps://doi.org/10.1109/tit.2018.2864200openalex-snapshot
Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes
inferred← citeshttps://doi.org/10.1142/s0219498825500768openalex-snapshot
On constacyclic codes of length 9ps over 𝔽pm and their optimal codes
inferred← citeshttps://doi.org/10.1142/s1793557119500505openalex-snapshot
Structure of repeated-root constacyclic codes of length 8ℓmpn
inferred← citeshttps://doi.org/10.13069/jacodesmath.36866openalex-snapshot
Recent progress on weight distributions of cyclic codes over finite fields
inferred← citeshttps://doi.org/10.3390/math13030473openalex-snapshot
A Note on Factorization and the Number of Irreducible Factors of xn − λ over Finite Fields
inferred← citeshttps://doi.org/10.3934/amc.2017039openalex-snapshot
The weight distributions of constacyclic codes
inferred← citeshttps://doi.org/10.3934/amc.2020025openalex-snapshot
Repeated-root constacyclic codes of length $ 3\ell^mp^s $
inferred← citeshttps://doi.org/10.3934/amc.2020051openalex-snapshot
Repeated-root constacyclic codes of length $ 6lp^s $
inferred← citeshttps://doi.org/10.3934/amc.2021044openalex-snapshot
Repeated-root constacyclic codes of length 6lmpn
inferred← citeshttps://doi.org/10.3934/math.2023644openalex-snapshot
Repeated-root constacyclic codes of length $ p_1p_2^t p^s $ and their dual codes
inferred← citeshttps://doi.org/10.48550/arxiv.1707.08856openalex-snapshot
LCD codes over ${\mathbb F}_q $ are as good as linear codes for q at least four
inferred← citeshttps://doi.org/10.48550/arxiv.1911.07542openalex-snapshot
On the Hamming distances of repeated-root cyclic codes of length $5p^s$
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04766openalex-snapshot
Self-reciprocal and self-conjugate-reciprocal irreducible factors of $x^n-λ$ and their applications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.