On the public citation graph

Analysis of one-dimensional linear hybrid cellular automata over GF(q)

0 signed · 56 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/978-1-4613-1983-2openalex-snapshot

Finite Fields for Computer Scientists and Engineers

inferredcites →https://doi.org/10.1007/bf01010579openalex-snapshot

Global properties of cellular automata

inferredcites →https://doi.org/10.1007/bf01020648openalex-snapshot

Exact results for deterministic cellular automata with additive rules

inferredcites →https://doi.org/10.1016/0022-314x(87)90058-8openalex-snapshot

Continued fraction expansions of rational expressions with irreducible denominators in characteristic 2

inferredcites →https://doi.org/10.1016/0167-2789(84)90245-8openalex-snapshot

Universality and complexity in cellular automata

inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot

Introduction to Finite Fields and their Applications

inferredcites →https://doi.org/10.1049/ip-e.1991.0031openalex-snapshot

Pseudorandom number generators for VLSI systems based on linear cellular automata

inferredcites →https://doi.org/10.1090/s0025-5718-1992-1134730-7openalex-snapshot

Primitive Polynomials Over Finite Fields

inferredcites →https://doi.org/10.1103/revmodphys.55.601openalex-snapshot

Statistical mechanics of cellular automata

inferredcites →https://doi.org/10.1109/12.210176openalex-snapshot

Vector space theoretic analysis of additive cellular automata and its application for pseudoexhaustive test pattern generation

inferredcites →https://doi.org/10.1109/12.286310openalex-snapshot

Design of CAECC - cellular automata based error correcting code

inferredcites →https://doi.org/10.1109/43.489103openalex-snapshot

Synthesis of one-dimensional linear hybrid cellular automata

inferredcites →https://doi.org/10.1109/43.55213openalex-snapshot

The analysis of one-dimensional linear cellular automata and their aliasing properties

inferredcites →https://doi.org/10.1109/iscas.1991.176777openalex-snapshot

Cellular automata techniques for compaction based BIST

inferredcites →https://doi.org/10.1109/iscas.1994.408757openalex-snapshot

Why cellular automata are better than LFSRs as built-in self-test generators for sequential-type faults

inferredcites →https://doi.org/10.1109/ismvl.1990.122655openalex-snapshot

The analysis of one dimensional multiple-valued linear cellular automata

inferredcites →https://doi.org/10.1109/ismvl.1992.186776openalex-snapshot

Aliasing in multiple-valued test data compaction

inferredcites →https://doi.org/10.1109/ismvl.1993.289552openalex-snapshot

Current-mode CMOS Galois field circuits

inferredcites →https://doi.org/10.1109/test.1990.114093openalex-snapshot

Analysis of cellular automata used as pseudorandom pattern generators

inferredcites →https://doi.org/10.2307/2977043openalex-snapshot

Discrete Mathematical Structures and Their Applications.

inferredcites →https://doi.org/10.5109/13414openalex-snapshot

ON A POLYNOMIAL REPRESENTATION OF FINITE LINEAR CELLULAR AUTOMATA

inferredcites →https://doi.org/10.5109/13420openalex-snapshot

ON DYNAMICAL BEHAVIORS OF CELLULAR AUTOMATA CA-60

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11751595_108openalex-snapshot

Practical Attack on the Shrinking Generator

inferred← citeshttps://doi.org/10.1007/11861201_25openalex-snapshot

A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation

inferred← citeshttps://doi.org/10.1007/978-1-4615-0853-3_6openalex-snapshot

Redundant Implementations of Linear Finite-State Machines

inferred← citeshttps://doi.org/10.1007/978-3-032-00257-0_6openalex-snapshot

Maximal Length Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-30479-1_63openalex-snapshot

Cellular Automata Application to the Linearization of Stream Cipher Generators

inferred← citeshttps://doi.org/10.1007/978-3-540-45224-9_162openalex-snapshot

Keystream Generator Analysis in Terms of Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-981-99-0688-8_10openalex-snapshot

On Non-linear Maximal Length Cellular Automata

inferred← citeshttps://doi.org/10.1007/bf02936572openalex-snapshot

Analysis of Pseudo-Noise sequences generated by Null Boundary Cellular Automata

inferred← citeshttps://doi.org/10.1007/s10440-006-9041-6openalex-snapshot

On the Use of Cellular Automata in Symmetric Cryptography

inferred← citeshttps://doi.org/10.1007/s13369-013-0757-0openalex-snapshot

Error Correcting Codes via Reversible Cellular Automata Over Finite Fields

inferred← citeshttps://doi.org/10.1016/j.jisa.2020.102624openalex-snapshot

PCHET: An efficient programmable cellular automata based hybrid encryption technique for multi-chat client-server applications

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.007openalex-snapshot

(Imperfect) strategies to generate primitive polynomials over GF(2)

inferred← citeshttps://doi.org/10.1016/s0898-1221(03)00028-2openalex-snapshot

Analysis of complemented CA derived from a linear TPMACA

inferred← citeshttps://doi.org/10.1080/10798587.2008.10642990openalex-snapshot

Modeling and Processing Using Reversible Conservative Noisy Elementary Cellular Automata Circuits and their M-Ary Quantum Computing

inferred← citeshttps://doi.org/10.1090/conm/477/09301openalex-snapshot

Cellular automata in stream ciphers

inferred← citeshttps://doi.org/10.1109/43.489103openalex-snapshot

Synthesis of one-dimensional linear hybrid cellular automata

inferred← citeshttps://doi.org/10.1109/ares.2008.114openalex-snapshot

Cryptographic Properties of Second-Order Memory Elementary Cellular Automata

inferred← citeshttps://doi.org/10.1109/c2spca.2013.6749441openalex-snapshot

Design of online testable fast divider

inferred← citeshttps://doi.org/10.1109/eait.2018.8470413openalex-snapshot

Cycle structure of non-uniform cellular automata

inferred← citeshttps://doi.org/10.1109/glocom.1998.775806openalex-snapshot

A fast and secure stream cipher based on cellular automata over GF(q)

inferred← citeshttps://doi.org/10.1109/icess.symposia.2008.94openalex-snapshot

Performance Analysis of the CPLD/FPGA Implementation of Cellular Automata

inferred← citeshttps://doi.org/10.1109/iscit.2005.1567043openalex-snapshot

VLSI characteristic of cellular automata and LFSR

inferred← citeshttps://doi.org/10.1109/itw.2003.1216715openalex-snapshot

Simple cellular automata-based linear models for the shrinking generator

inferred← citeshttps://doi.org/10.1109/tcad.2007.895784openalex-snapshot

New Synthesis of One-Dimensional 90/150 Linear Hybrid Group Cellular Automata

inferred← citeshttps://doi.org/10.1109/tit.2004.839491openalex-snapshot

Coding Approaches to Fault Tolerance in Linear Dynamic Systems

inferred← citeshttps://doi.org/10.1109/tit.2011.2164234openalex-snapshot

Revisiting LFSRs for Cryptographic Applications

inferred← citeshttps://doi.org/10.1142/s0129183120500370openalex-snapshot

Maximal length cellular automata in GF(q) and pseudo-random number generation

inferred← citeshttps://doi.org/10.1142/s0129183121500911openalex-snapshot

Non-uniform nonlinear cellular automata with large cycles and their application in pseudo-random number generation

inferred← citeshttps://doi.org/10.1155/2014/970157openalex-snapshot

On Determinantal Varieties of Hankel Matrices

inferred← citeshttps://doi.org/10.14209/sbrt.2008.42694openalex-snapshot

Desenvolvimento de uma Cifra de Fluxo Baseada em Autômatos Celulares

inferred← citeshttps://doi.org/10.25088/complexsystems.19.1.89openalex-snapshot

Linear Time Algorithm for Identifying the Invertibility of Null-Boundary Three Neighborhood Cellular Automata

inferred← citeshttps://doi.org/10.25088/complexsystems.20.1.47openalex-snapshot

On Invertible Three Neighborhood Null-Boundary Uniform Cellular Automata

inferred← citeshttps://doi.org/10.3934/amc.2016041openalex-snapshot

Modelling the shrinking generator in terms of linear CA

inferred← citeshttps://doi.org/10.5772/16155openalex-snapshot

Conservative Reversible Elementary Cellular Automata and their Quantum Computations

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.