Asynchronous Agreement and Its Relation with Error-Correcting Codes
From MaRDI portal
Publication:4564181
DOI10.1109/TC.2007.1043zbMath1391.94864OpenAlexW2139686511MaRDI QIDQ4564181
Michel Raynal, Achour Mostefaoui, Sergio Rajsbaum, Roy Friedman
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network protocols (68M12) Combinatorial codes (94B25)
Related Items (6)
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ No double discount: condition-based simultaneity yields limited gain ⋮ No Double Discount: Condition-Based Simultaneity Yields Limited Gain ⋮ Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
This page was built for publication: Asynchronous Agreement and Its Relation with Error-Correcting Codes