noisy channel coding theorem 中文意思是什麼

noisy channel coding theorem 解釋
香農定理
  • noisy : adj. （noisier; -iest）1. （人、地方等）嘈雜的，喧鬧的；（街道）熙熙攘攘的。2. （顏色、服裝）過分鮮艷的；（文體）過分華麗[渲染]的。
  • channel : n 1 水路，水道，渠，溝；海峽；河床，河底。2 （柱等的）槽，凹縫；【機械工程】槽鐵，凹形鐵。3 〈比...
  • coding : n. 編碼；譯成電碼。
  • theorem : n. 1. （能證明的）一般原理，公理，定律，法則。2. 【數學】定理。
  1. According to horodeckis, the coherent information of entangled state is supposed to be the lower bound of one - way distillable entanglement. this postulation is called hashing inequality, which is crucial in proving noisy channel coding theorem. it is shown that there are no direc

    根據horodecki等人的研究，糾纏態的相干信息推測是單向蒸餾糾纏的下限，該假設稱為hashing不等n式，對證明有噪通道編碼定理至關重要
  2. Turbo code, which utilizes the condition of random coding and decoding of shannon noisy channel coding theorem, has obtained the performance near to shannon theoretic limit. the performance of turbo code is the best one in all presented coding methods

    Turbo碼由於很好地應用了shannon有噪通道編碼定理中的隨機性編譯碼條件而獲得了接近shannon理論極限的譯碼性能。
分享友人
分享到 Line

分享到臉書