Binomial coding in distributed arbitration systems

DOI10.1049/EL:19890897MaRDI QIDQ3486507zbMATH OpenOpenAlexFDO

Authors M. Makhaniok, Vladimir S. Cherniavsky, O. Stucky, Reinhard Männer

Publication date 1989

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19890897

zbMATH Keywords

arbitration numbers in distributed systemsBinomial codingoptimal codes for specified arbitration delay

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 14643
• Generalized Coset Codes for Distributed Binning
• Distributed Arithmetic Coding for the Slepian–Wolf Problem
• A coding theorem for distributed computation
• Codebook Cardinality Spectrum of Distributed Arithmetic Coding for Independent and Identically-Distributed Binary Sources
• Distributed coding in a multiple access environment
• Coding for a binary independent piecewise-identically-distributed source
• A probability-ratio approach to approximate binary arithmetic coding
• scientific article; zbMATH DE number 2013823
• Two Applications of Coset Cardinality Spectrum of Distributed Arithmetic Coding

Cited in

(2)

• scientific article; zbMATH DE number 14643 (Why is no real title available?)
• EXTREMAL CODES FOR SPEED-UP OF DISTRIBUTED PARALLEL ARBITRATION∗

This page was built for publication: Binomial coding in distributed arbitration systems

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