On the public citation graph
Classification of pseudo-cyclic MDS codes
0 signed · 45 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.1002/9780470050118.ecse011openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1007/bf00147659openalex-snapshot
The solution to Beniamino Segre's problem I r,q , r=3, q=2 h
inferredcites →https://doi.org/10.1007/bf02410598openalex-snapshot
Ovals in Desarguesian planes of even order
inferredcites →https://doi.org/10.1016/0012-365x(86)90067-1openalex-snapshot
The non-classical 10-arc of PG(4, 9)
inferredcites →https://doi.org/10.1016/0097-3165(87)90060-4openalex-snapshot
The automorphism groups of Reed-Solomon codes
inferredcites →https://doi.org/10.1016/0097-3165(88)90032-5openalex-snapshot
On linear MDS codes of length q + 1 over GF(q) for even q
inferredcites →https://doi.org/10.1016/0097-3165(92)90104-3openalex-snapshot
Cyclic and pseudo-cyclic MDS codes of length q + 1
inferredcites →https://doi.org/10.1109/18.53751openalex-snapshot
Pseudocyclic maximum-distance-separable codes
inferredcites →https://doi.org/10.1109/proc.1980.11608openalex-snapshot
The theory of error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1984.1056909openalex-snapshot
Maximum distance separable multilevel codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057113openalex-snapshot
On generator matrices of MDS codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1986.1057151openalex-snapshot
On cyclic MDS codes of length q over GF(q) (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1986.1057188openalex-snapshot
On MDS extensions of generalized Reed- Solomon codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/s0195-6698(97)90000-7openalex-snapshot
On the Existence of Cyclic and Pseudo-Cyclic MDS Codes
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_15openalex-snapshot
On the q-ary image of cyclic codes
inferred← citeshttps://doi.org/10.1007/978-3-031-22944-2_7openalex-snapshot
Two Classes of Constacyclic Codes with Variable Parameters
inferred← citeshttps://doi.org/10.1007/s10623-013-9865-9openalex-snapshot
On self-dual constacyclic codes over finite fields
inferred← citeshttps://doi.org/10.1007/s10623-021-00910-7openalex-snapshot
MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes
inferred← citeshttps://doi.org/10.1007/s10623-023-01242-4openalex-snapshot
Several families of irreducible constacyclic and cyclic codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01371-4openalex-snapshot
MDS codes with l-Galois hulls of arbitrary dimensions
inferred← citeshttps://doi.org/10.1007/s12095-018-0288-3openalex-snapshot
A note on the constructions of MDS self-dual codes
inferred← citeshttps://doi.org/10.1007/s12095-022-00624-0openalex-snapshot
MDS constacyclic codes of length q + 1 over GF(q)
inferred← citeshttps://doi.org/10.1016/0165-0114(95)00288-xopenalex-snapshot
Adaptive control of a submerged vehicle with sliding fuzzy relations
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.045openalex-snapshot
Constructing linear codes from some orbits of projectivities
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102854openalex-snapshot
On non-GRS MDS cyclic codes
inferred← citeshttps://doi.org/10.1016/j.jpaa.2008.11.011openalex-snapshot
Rational power series, sequential codes and periodicity of sequences
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00334-2openalex-snapshot
Cyclic arcs and pseudo-cyclic MDS codes
inferred← citeshttps://doi.org/10.1109/18.825841openalex-snapshot
Constacyclic codes, cocycles and a u+v|u-v construction
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653778openalex-snapshot
Some Results on F q -Double Constacyclic LCD Codes
inferred← citeshttps://doi.org/10.1109/lcomm.2018.2863370openalex-snapshot
Asymptotically Good Additive Cyclic Codes Exist
inferred← citeshttps://doi.org/10.1109/lcomm.2019.2908640openalex-snapshot
Hermitian Self-Dual, MDS, and Generalized Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2003.822619openalex-snapshot
Consta-Abelian Codes Over Galois Rings
inferred← citeshttps://doi.org/10.1109/tit.2016.2645759openalex-snapshot
New MDS Self-Dual Codes From Generalized Reed—Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2796125openalex-snapshot
On Linear Complementary Pairs of Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2880913openalex-snapshot
Self-Dual Near MDS Codes from Elliptic Curves
inferred← citeshttps://doi.org/10.1109/tit.2022.3222474openalex-snapshot
Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs
inferred← citeshttps://doi.org/10.1109/tit.2023.3322990openalex-snapshot
Two Classes of Constacyclic Codes With Variable Parameters [(q m – 1)/r, k, d]
inferred← citeshttps://doi.org/10.1109/tit.2024.3349996openalex-snapshot
Several Families of Ternary Negacyclic Codes and Their Duals
inferred← citeshttps://doi.org/10.1109/tit.2025.3538220openalex-snapshot
Non-Reed-Solomon Type Cyclic MDS Codes
inferred← citeshttps://doi.org/10.21608/jaet.2020.30317.1016openalex-snapshot
Efficient Implementation of Lightweight MDS Matrix on FPGA
inferred← citeshttps://doi.org/10.3390/e21020101openalex-snapshot
New Construction of Maximum Distance Separable (MDS) Self-Dual Codes over Finite Fields
inferred← citeshttps://doi.org/10.3934/math.20241439openalex-snapshot
The polycyclic codes over the finite field $ \mathbb{F}_q $
inferred← citeshttps://doi.org/10.48550/arxiv.1004.1158openalex-snapshot
New MDS Self-Dual Codes over Large Finite Fields
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.