Asynchronous Agreement and Its Relation with Error-Correcting Codes

DOI10.1109/TC.2007.1043MaRDI QIDQ4564181zbMATH OpenOpenAlexFDO

Authors Roy Friedman, Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2007.1043

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25) Network protocols (68M12)

Cited in

(8)

• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
• No double discount: condition-based simultaneity yields limited gain
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
• Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
• Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism
• scientific article; zbMATH DE number 3693146 (Why is no real title available?)
• Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
• No Double Discount: Condition-Based Simultaneity Yields Limited Gain

This page was built for publication: Asynchronous Agreement and Its Relation with Error-Correcting Codes

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