On the public citation graph

Multidimensional cyclic codes and Artin–Schreier type hypersurfaces over finite fields

0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.2001.2965openalex-snapshot
Finding Recursions for Multidimensional Arrays
inferredcites →https://doi.org/10.1007/978-3-540-76878-4openalex-snapshot
Algebraic Function Fields and Codes
inferredcites →https://doi.org/10.1007/bf01268659openalex-snapshot
On minimum distance bounds for abelian codes
inferredcites →https://doi.org/10.1007/bf02568266openalex-snapshot
Elementary Abelianp-extensions of algebraic function fields
inferredcites →https://doi.org/10.1007/bfb0091523openalex-snapshot
Applications de la formule des traces aux sommes trigonométrigues
inferredcites →https://doi.org/10.1016/j.ffa.2003.10.002openalex-snapshot
Artin–Schreier curves and weights of two-dimensional cyclic codes
inferredcites →https://doi.org/10.1016/s0019-9958(70)90214-7openalex-snapshot
On generalized ReedMuller codes and their relatives
inferredcites →https://doi.org/10.1016/s0019-9958(77)90232-7openalex-snapshot
A theory of two-dimensional cyclic codes
inferredcites →https://doi.org/10.1090/dol/054/12openalex-snapshot
The arithmetic of algebraic curves
inferredcites →https://doi.org/10.1109/18.259637openalex-snapshot
Minimum distance bounds for cyclic codes and Deligne's theorem
inferredcites →https://doi.org/10.1109/18.272482openalex-snapshot
The n-dimensional key equation and a decoding application
inferredcites →https://doi.org/10.1109/18.476246openalex-snapshot
Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
inferredcites →https://doi.org/10.1109/18.86974openalex-snapshot
Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
inferredcites →https://doi.org/10.1109/tit.1975.1055435openalex-snapshot
On subfield subcodes of modified Reed-Solomon codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057109openalex-snapshot
The concatenated structure of cyclic and Abelian codes
inferredcites →https://doi.org/10.5860/choice.33-0986openalex-snapshot
Arithmetic of algebraic curves

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/1-4020-5334-4_3openalex-snapshot
ARTIN-SCHREIER EXTENSIONS AND THEIR APPLICATIONS
inferred← citeshttps://doi.org/10.1007/s00220-013-1810-2openalex-snapshot
Commuting Pauli Hamiltonians as Maps between Free Modules
inferred← citeshttps://doi.org/10.1007/s10623-019-00655-4openalex-snapshot
Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01431-9openalex-snapshot
On the number of rational points of Artin–Schreier’s curves and hypersurfaces
inferred← citeshttps://doi.org/10.1007/s12190-021-01540-xopenalex-snapshot
n-Dimension quasi-twisted codes of arbitrary length over finite fields
inferred← citeshttps://doi.org/10.1007/s13226-023-00453-8openalex-snapshot
Multi-dimensional constacyclic codes of arbitrary length over finite fields
inferred← citeshttps://doi.org/10.1007/s40314-025-03386-6openalex-snapshot
Complete weight enumerators of quasi-2-dimensional cyclic codes
inferred← citeshttps://doi.org/10.1007/s40314-026-03635-2openalex-snapshot
PIR Schemes from nD-Cyclic and nD-Constacyclic Codes and Their Monomial Equivalence
inferred← citeshttps://doi.org/10.1007/s40995-025-01823-zopenalex-snapshot
One-Sided Repeated-Root Two-Dimensional Cyclic and Constacyclic Codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.07.004openalex-snapshot
A relation between quasi-cyclic codes and 2-D cyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2013.08.001openalex-snapshot
2-D skew-cyclic codes over Fq[x,y;ρ,θ]
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.06.004openalex-snapshot
A minimum distance bound for quasi-nD-cyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.07.005openalex-snapshot
Quasi-cyclic complementary dual codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2023.102229openalex-snapshot
On the number of rational points on Artin-Schreier hypersurfaces
inferred← citeshttps://doi.org/10.1016/j.jpaa.2026.108258openalex-snapshot
Superelliptic curves defined by linearized polynomials
inferred← citeshttps://doi.org/10.1103/physrevresearch.2.033021openalex-snapshot
Bifurcating entanglement-renormalization group flows of fracton stabilizer models
inferred← citeshttps://doi.org/10.1109/lcomm.2018.2872046openalex-snapshot
On Linear Complementary Pair of $n$ D Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2225823openalex-snapshot
The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound
inferred← citeshttps://doi.org/10.1109/tit.2015.2512594openalex-snapshot
Apparent Distance and a Notion of BCH Multivariate Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2616467openalex-snapshot
Multidimensional Quasi-Cyclic and Convolutional Codes
inferred← citeshttps://doi.org/10.1142/s0219498825410233openalex-snapshot
Codes with hierarchical locality on Artin–Schreier surfaces
inferred← citeshttps://doi.org/10.1142/s0219498826500635openalex-snapshot
On generating sets of 2D cyclic codes of length 2ks and corrections to some previous results
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.