On the public citation graph

Linear recurring sequences over Galois rings

0 signed · 43 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.1007/3-540-46877-3_16openalex-snapshot
Lower Bounds for the Linear Complexity of Sequences over Residue Rings
inferredcites →https://doi.org/10.1007/978-1-84800-273-9_9openalex-snapshot
Algebraic coding theory
inferredcites →https://doi.org/10.1007/bf01093669openalex-snapshot
Finite rings of principal ideals
inferredcites →https://doi.org/10.1016/0021-8693(73)90170-1openalex-snapshot
Products of linear recurring sequences
inferredcites →https://doi.org/10.1017/cbo9780511666186openalex-snapshot
Combinatorial Methods in Discrete Mathematics
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-46796-3_36openalex-snapshot
Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey)
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_21openalex-snapshot
Formal duality of linearly presentable codes over a Galois field
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_22openalex-snapshot
Trace-function on a Galois ring in coding theory
inferred← citeshttps://doi.org/10.1007/978-3-319-67618-0_6openalex-snapshot
Lower Bounds on Linear Complexity of Digital Sequences Products of LRS and Matrix LRS over Galois Ring
inferred← citeshttps://doi.org/10.1007/978-3-662-04166-6_5openalex-snapshot
Recurring Sequences
inferred← citeshttps://doi.org/10.1007/s10623-026-01943-6openalex-snapshot
An improved method for predicting truncated Fibonacci LFSRs over integer residue rings
inferred← citeshttps://doi.org/10.1007/s12095-014-0121-6openalex-snapshot
Injectivity of compressing maps on the set of primitive sequences modulo square-free odd integers
inferred← citeshttps://doi.org/10.1007/s12095-017-0278-xopenalex-snapshot
Injectivity on distribution of elements in the compressed sequences derived from primitive sequences over ℤ p e $\mathbb {Z}_{p^{e}}$
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.03.006openalex-snapshot
An invariant for quadratic forms valued in Galois Rings of characteristic 4
inferred← citeshttps://doi.org/10.1016/j.ffa.2010.02.003openalex-snapshot
Witt index for Galois Ring valued quadratic forms
inferred← citeshttps://doi.org/10.1016/j.ffa.2015.06.006openalex-snapshot
Generalized Gray map and a class of p-ary nonlinear codes
inferred← citeshttps://doi.org/10.1016/j.jpaa.2008.03.028openalex-snapshot
Witt’s theorems for Galois Ring valued quadratic forms
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00348-6openalex-snapshot
Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring
inferred← citeshttps://doi.org/10.1016/s1570-7954(07)05005-xopenalex-snapshot
Finite Rings with Applications
inferred← citeshttps://doi.org/10.1017/cbo9781139057448openalex-snapshot
Algebraic Shift Register Sequences
inferred← citeshttps://doi.org/10.1070/im2013v077n06abeh002672openalex-snapshot
Frequency characteristics of coordinate sequences of linear recurrences over Galois rings
inferred← citeshttps://doi.org/10.1080/00927870500274796openalex-snapshot
Cyclic Generalized Galois Rings
inferred← citeshttps://doi.org/10.1090/s0025-5718-08-02075-9openalex-snapshot
On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
inferred← citeshttps://doi.org/10.1109/cig.2010.5592917openalex-snapshot
Generalized Frobenius extensions of finite rings and trace functions
inferred← citeshttps://doi.org/10.1109/tit.2007.901214openalex-snapshot
Injectivity of Compressing Maps on Primitive Sequences Over ${\BBZ}/(p^{e})$
inferred← citeshttps://doi.org/10.1109/tit.2007.901216openalex-snapshot
Further Result of Compressing Maps on Primitive Sequences Modulo Odd Prime Powers
inferred← citeshttps://doi.org/10.1109/tit.2009.2034782openalex-snapshot
Distribution Properties of Compressing Sequences Derived From Primitive Sequences Over $\BBZ /(p^{e})$
inferred← citeshttps://doi.org/10.1109/tit.2024.3442870openalex-snapshot
Predicting Truncated Galois Linear Feedback Shift Registers
inferred← citeshttps://doi.org/10.1134/s003294601003004xopenalex-snapshot
A class of injective compressing maps on linear recurring sequences over a Galois ring
inferred← citeshttps://doi.org/10.1515/dma-2018-0007openalex-snapshot
The cross-correlation function of complications of linear recurrent sequences
inferred← citeshttps://doi.org/10.1515/dma.2010.036openalex-snapshot
An algorithm to restore a linear recurring sequence over the ring R = Z pn from a linear complication of its highest coordinate sequence
inferred← citeshttps://doi.org/10.1515/dma.2011.010openalex-snapshot
Reconstruction of a linear recurrence of maximal period over a Galois ring from its highest coordinate sequence
inferred← citeshttps://doi.org/10.23919/cje.2022.00.387openalex-snapshot
A Lattice-Based Method for Recovering the Unknown Parameters of Truncated Multiple Recursive Generators with Constant
inferred← citeshttps://doi.org/10.4171/rmi/353openalex-snapshot
Nonassociative Algebras: Some Applications
inferred← citeshttps://doi.org/10.4213/dm1391openalex-snapshot
Кросс-корреляционная функция усложнений линейных рекуррент
inferred← citeshttps://doi.org/10.4213/im7799openalex-snapshot
Частотные характеристики разрядных последовательностей линейных рекуррент над кольцами Галуа
inferred← citeshttps://doi.org/10.4213/mvk112openalex-snapshot
Рекурсивно-порождаемые перестановки двоичного пространства
inferred← citeshttps://doi.org/10.4213/mvk114openalex-snapshot
Восстановление линейной рекурренты максимального периода над кольцом Галуа характеристики $p^3$ по последовательности старших разрядов
inferred← citeshttps://doi.org/10.4213/mvk141openalex-snapshot
Digit sequences of skew linear recurrences of maximal period over Galois rings
inferred← citeshttps://doi.org/10.4213/mvk192openalex-snapshot
The first digit sequence of skew linear recurrence of maximal period over Galois ring
inferred← citeshttps://doi.org/10.4213/mvk510openalex-snapshot
О развитии научных направлений, предложенных А. А. Нечаевым
inferred← citeshttps://doi.org/10.4213/mvk85openalex-snapshot
Нелинейные перестановки пространства над конечным полем, порожденные линейными преобразованиями модуля над кольцом Галуа
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.