Bounds on the size and transmission rate of communications protocols

DOI10.1016/0898-1221(82)90043-8MaRDI QIDQ1163522zbMATH OpenOpenAlexFDO

Authors A. V. Aho, Mihalis Yannakakis, Jeffrey D. Ullman, Aaron D. Wyner

Publication date 1982

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(82)90043-8

zbMATH Keywords

finite-state automatareliable communication across an error-prone channelsize of automatatransmitter-receiver protocol in a data communications system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99) Circuits, networks (94C99)

Cites work

• Algebraic coding theory
• Basic limits on protocol information in data communication networks

Cited in

(4)

• Modelling knowledge and action in distributed systems
• Self-stabilization over unreliable communication media
• Synthesis in presence of dynamic links
• scientific article; zbMATH DE number 7455739 (Why is no real title available?)

This page was built for publication: Bounds on the size and transmission rate of communications protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1163522)