Minimax codes for finite alphabets (Corresp.)

IEEE Transactions on Information Theory, 1978 - ieeexplore.ieee.org
Minimax codes are designed for applications where the symbol probabilities are not known
except for their order. A minimax code is defined by real-valued parameters/,(resembling the …
被引用次数：31 相关文章

Minimax codes for finite alphabets (Corresp.)

J Rissanen - IEEE Transactions on Information Theory, 2006 - dl.acm.org
Minimax codes are designed for applications where the symbol probabilities are not known
except for their order. A minimax code is defined by real-valued parameters/,(resembling the …

[引用][C] Minimax codes for finite alphabets

J RISSANEN - IEEE Trans. Inf. Theory, 1978 - cir.nii.ac.jp
Minimax codes for finite alphabets | CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ
[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学図書館の本をさがす 日本の博士 …