Modulo Prime(主模塊)到底是什麼？
Modulo Prime 主模塊 - Coding strategies based on QGCs are introduced for three fundamental multi-terminal problems: the Körner-Marton problem for modulo prime-power sums, computation over the multiple access channel (MAC), and MAC with distributed states. [1]針對三個基本多終端問題引入了基於 QGC 的編碼策略：模素數功率和的 Körner-Marton 問題、多路訪問信道 (MAC) 上的計算以及具有分佈式狀態的 MAC。 [1]
modulo prime power 模主功率
We identify two faults in a published algorithm for fast computation of multiplicative inverses modulo prime powers. [1] However, modulo prime powers, factoring gets harder because there is non-unique factorization and a combinatorial blowup ensues. [2]我們在已發布的算法中識別出兩個錯誤，用於快速計算乘法逆模素數冪。 [1] 然而，模素數冪，因式分解變得更加困難，因為存在非唯一的因式分解並且隨之而來的是組合爆炸。 [2]