On the public citation graph
Decoding of cyclic codes over F/sub 2/+uF/sub 2/
0 signed · 53 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/bf01225641openalex-snapshot
Transform domain characterization of cyclic codes overZ m
inferredcites →https://doi.org/10.1016/0012-365x(73)90080-0openalex-snapshot
A construction scheme for linear and non-linear codes
inferredcites →https://doi.org/10.1109/18.312154openalex-snapshot
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
inferredcites →https://doi.org/10.1109/18.481791openalex-snapshot
Cyclic codes over Z/sub 4/, locator polynomials, and Newton's identities
inferredcites →https://doi.org/10.1109/18.532906openalex-snapshot
Cyclic codes and quadratic residue codes over Z/sub 4/
inferredcites →https://doi.org/10.1109/18.681324openalex-snapshot
Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
inferredcites →https://doi.org/10.1109/18.746770openalex-snapshot
Type II codes over F/sub 2/+uF/sub 2/
inferredcites →https://doi.org/10.1109/18.761278openalex-snapshot
Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
inferredcites →https://doi.org/10.1109/isit.1998.709003openalex-snapshot
Cyclic codes over a linear companion of Z/sub 4/
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_14openalex-snapshot
Gröbner Bases over Commutative Rings and Applications to Coding Theory
inferred← citeshttps://doi.org/10.1007/bf02896468openalex-snapshot
DFT for cyclic code overF p +uF p + ··· +u k-1 F p
inferred← citeshttps://doi.org/10.1007/s00200-013-0188-xopenalex-snapshot
Construction of cyclic codes over $$\mathbb F _2+u\mathbb F _2$$ F 2 + u F 2 for DNA computing
inferred← citeshttps://doi.org/10.1007/s12190-015-0892-8openalex-snapshot
On cyclic DNA codes over $${\mathbb {F}}_2+u{\mathbb {F}}_2$$ F 2 + u F 2
inferred← citeshttps://doi.org/10.1007/s12190-016-1046-3openalex-snapshot
Cyclic DNA codes over $$\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2$$ F 2 + u F 2 + v F 2 + u v F 2 and their applications
inferred← citeshttps://doi.org/10.1007/s12190-023-01893-5openalex-snapshot
Linear codes over $$\mathbb {F}_q\times (\mathbb {F}_q+v\mathbb {F}_q)$$
inferred← citeshttps://doi.org/10.1007/s13226-019-0310-2openalex-snapshot
Decoding of Cyclic Codes Over the Ring $$\frac{{{F_2}\left[ u \right]}}{{\langle {u^t}\rangle }}$$ F 2 [ u ] 〈 u t 〉
inferred← citeshttps://doi.org/10.1007/s40314-021-01487-6openalex-snapshot
Decoding of cyclic codes over the ring $$F_2+uF_2+u^2F_2$$
inferred← citeshttps://doi.org/10.1007/s40314-022-01867-6openalex-snapshot
RT distances and Hamming distances of constacyclic codes of length $$8p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s40840-024-01760-xopenalex-snapshot
MacWilliams Identities of the Linear Codes Over $${\mathbb {F}}_q\times ({\mathbb {F}}_q+v{\mathbb {F}}_q)$$
inferred← citeshttps://doi.org/10.1016/j.disc.2016.01.020openalex-snapshot
Repeated-root constacyclic codes of prime power length over F p m [ u ] 〈 u a 〉 and their duals
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.014openalex-snapshot
On constacyclic codes of length 4ps over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.disc.2017.08.044openalex-snapshot
On self-dual constacyclic codes of length ps over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.09.003openalex-snapshot
Negacyclic codes of length 2ps over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.ffa.2015.09.006openalex-snapshot
Constacyclic codes of length 2p over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2010.05.027openalex-snapshot
Constacyclic codes of length p s over F p m + u F p m
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2010.02.003openalex-snapshot
(1+λu)-Constacyclic codes over F[u]/〈u〉
inferred← citeshttps://doi.org/10.1090/conm/642/12887openalex-snapshot
On Repeated-Root Constacyclic Codes of Prime Power Length Over Polynomial Residue Rings
inferred← citeshttps://doi.org/10.1109/access.2020.2998836openalex-snapshot
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩
inferred← citeshttps://doi.org/10.1109/icece.2010.662openalex-snapshot
Cyclic Codes over Polynomial Residue Class Rings
inferred← citeshttps://doi.org/10.1109/tit.2009.2013015openalex-snapshot
Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
inferred← citeshttps://doi.org/10.1109/tit.2010.2040896openalex-snapshot
Some Results on Cyclic Codes Over ${F}_{2}+v{F}_{2}$
inferred← citeshttps://doi.org/10.1109/trustcom.2011.122openalex-snapshot
Gray Map and Quantum Codes over the Ring F_2+uF_2+u^2F_2
inferred← citeshttps://doi.org/10.1142/s0219498818501736openalex-snapshot
Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pm
inferred← citeshttps://doi.org/10.1142/s0219498819500233openalex-snapshot
On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗
inferred← citeshttps://doi.org/10.1142/s1005386719000166openalex-snapshot
On a Class of Constacyclic Codes of Length 4ps over Fpm[u]〈 ua 〉
inferred← citeshttps://doi.org/10.1142/s1793557115500850openalex-snapshot
Quasi-cyclic codes over the ring 𝔽p[u]/〈u2 − u〉
inferred← citeshttps://doi.org/10.1155/2016/3965789openalex-snapshot
Skew Constacyclic Codes over Finite Fields and Finite Chain Rings
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.808openalex-snapshot
Some Constacyclic and Cyclic Codes Over Fq[u]/(ut+1)
inferred← citeshttps://doi.org/10.2298/fil2326009dopenalex-snapshot
Cyclic codes of length 5ps over Fpm + uFpm and their duals
inferred← citeshttps://doi.org/10.2298/fil2530847bopenalex-snapshot
A family of optimal linear codes of length $2^s$ over the ring $\frac{\mathbb{F}_2[u]}{⟨u^2⟩}$ with Lee distance 4
inferred← citeshttps://doi.org/10.3390/axioms12030254openalex-snapshot
On Symbol-Pair Distance of a Class of Constacyclic Codes of Length 3ps over Fpm+uFpm
inferred← citeshttps://doi.org/10.3390/axioms13100655openalex-snapshot
γ-Dual Codes over Finite Commutative Chain Rings
inferred← citeshttps://doi.org/10.3906/mat-1211-20openalex-snapshot
Some results on cyclic codes over the ring $R_{2,m}$
inferred← citeshttps://doi.org/10.3934/amc.2012.6.175openalex-snapshot
On some classes of constacyclic codes over polynomial residue rings
inferred← citeshttps://doi.org/10.3934/amc.2012.6.39openalex-snapshot
Skew constacyclic codes over finite chain rings
inferred← citeshttps://doi.org/10.3934/amc.2020123openalex-snapshot
Constacyclic codes of length $ 8p^s $ over $ \mathbb F_{p^m} + u\mathbb F_{p^m} $
inferred← citeshttps://doi.org/10.3934/amc.2022073openalex-snapshot
Cyclic codes over rings of matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1207.3385openalex-snapshot
Construction of Cyclic Codes over $\mathbb{F}_2+u\mathbb{F}_2$ for DNA Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1505.02238openalex-snapshot
2-D Skew Constacyclic Codes Over $R[x,y,ρ,θ]$
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.