Sliding Block Codes is a continuous, shift-commuting map between shift spaces that is defined by a local rule assigning output symbols based on finite-length input blocks, thereby generalizing block codes to include both memory and anticipation in symbolic dynamical systems.
40
Publications
1.9K
Citations
51
Authors
29
Institutions
Publications per year
2017–2026
2
Parents
Publications
40
A.J. Feltstrom, Dmitri Truhachev, Michael Lentmaier et al. · IEEE Transactions on Information Theory · 2009 · 95 citations
1–5 of 40
Authors
51
- JA
6
h-index
- JC
5
h-index
- BM
5
h-index
- RM
3
h-index
- PH
3
h-index
1–5 of 51
Institutions
29
IBM Research - Almaden
San Jose, United States
8 h-index
14 publications
1.2K citations
IBM (United States)
Armonk, United States
4 h-index
9 publications
2.1K citations
University of California San Diego
San Diego, United States
3 h-index
3 publications
284 citations
Missouri University of Science and Technology
Rolla, United States
3 h-index
3 publications
41 citations
Stanford University
Stanford, United States
3 h-index
4 publications
211 citations
Laboratoire d'Informatique Gaspard-Monge
Champs-sur-Marne, France
2 h-index
2 publications
38 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
3 publications
68 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
4 publications
1.1K citations
1–8 of 29
Venues
- IEEE Transactions on Information Theory
23 publications · 1.3K citations
18
h-index
- arXiv (Cornell University)
Repository · 3 publications · 35 citations
3
h-index
- SIAM Journal on Discrete Mathematics
2 publications · 71 citations
2
h-index
- The Annals of Probability
2 publications · 33 citations
2
h-index
- IEEE Journal on Selected Areas in Communications
2 publications · 261 citations
2
h-index
1–5