Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences
From MaRDI portal
Recommendations
- Geometry of Neighborhood Sequences in Hexagonal Grid
- Optimal grid representations
- Dynamical transition theory of hexagonal pattern formations
- Hexagonal approach and modeling for the visual cortex
- A Structurally Dynamic Cellular Automaton with Memory in the Hexagonal Tessellation
- Neighborhood sequences on \(n\)D hexagonal/face-centered-cubic grids
- Invariant encoding of spatial stimulus topology in the temporal domain
- A computational model for grid maps in neural populations
Cites work
- A literature review on circle and sphere packing problems: models and methodologies
- Communicating sequential processes
- Factor graphs and the sum-product algorithm
- scientific article; zbMATH DE number 815103 (Why is no real title available?)
- Introduction to algorithms.
- Logic of transition systems
- On associative memory
- Optimal population codes for space: grid cells outperform place cells
- Reinforcement learning. An introduction
- Space, time and learning in the hippocampus: How fine spatial and temporal scales are expanded into population codes for behavioral control
- Time, clocks, and the ordering of events in a distributed system
Cited in
(7)- A computational model for grid maps in neural populations
- Modeling grid fields instead of modeling grid cells. An effective model at the macroscopic level and its relationship with the underlying microscopic neural system
- Grid cells on the ball
- Transition scale-spaces: a computational theory for the discretized entorhinal cortex
- Can grid cell ensembles represent multiple spaces?
- Optimal population codes for space: grid cells outperform place cells
- Why grid cells function as a metric for space
This page was built for publication: Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157249)
