Granular Gain of Low-Dimensional Lattices from Binary Linear Codes

スポンサーリンク

概要

• 論文の詳細を見る

• Granular gain of low-dimensional lattices based on binary linear codes is estimated using a quantization algorithm which is equivalently a soft-decision decoding of the underlying code. It is shown that substantial portion of the ultimate granular gain is achieved even in limited dimensions.

著者

• ISAKA Motohiko

  Dept. of Informatics, Kwansei Gakuin University

• Isaka Motohiko

  Dept. Of Informatics Kwansei Gakuin University

• KOTANI Misako

  Dept. of Informatics, Kwansei Gakuin University

• Kotani Misako

  Dept. Of Informatics Kwansei Gakuin University

• KAWAMOTO Shingo

  Dept. of Informatics, Kwansei Gakuin University

関連論文

• Unconditionally Secure Oblivious Transfer from Algebraic Signaling over the Gaussian Channel
• Design of High-Rate Serially Concatenated Codes with Low Error Floor(Information Theory and Its Applications)
• Unconditionally Secure Oblivious Transfer from Algebraic Signaling over the Gaussian Channel
• Oblivious Transfer from the Additive White Gaussian Noise Channel
• Lossy Coding of Binary Sources with Short Linear Codes
• Granular Gain of Low-Dimensional Lattices from Binary Linear Codes

スポンサーリンク