Asynchronous Communication: Exact Synchronization, Universality, and Dispersion
From MaRDI portal
Publication:2989341
Recommendations
- Synchronization in the presence of unknown, nonuniform and arbitrarily large communication delay
- Synchrony vs asynchrony in communication primitives
- On deciding synchronizability for asynchronously communicating systems
- scientific article; zbMATH DE number 1820087
- scientific article; zbMATH DE number 4055012
- Distributed Probabilistic Synchronization Algorithms for Communication Networks
- Synchronization in a network of identical discrete-time agents with uniform constant communication delay
- Synchronization and informational agreement in distributed computing systems
- Time bounds on synchronization in a periodic distributed system
Cited in
(5)- Two new families of quantum synchronizable codes
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- Second-Order Asymptotics for Communication Under Strong Asynchronism
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
This page was built for publication: Asynchronous Communication: Exact Synchronization, Universality, and Dispersion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989341)