Lossy Coding of Binary Sources with Short Linear Codes

スポンサーリンク

概要

• 論文の詳細を見る

• This letter treats lossy source coding of binary sources with short linear block codes. It is numerically shown that very simple basis-reprocessing approach yields good rate-distortion performance with manageable computational complexity for small block lengths. The result for code lengths up to 100 outperforms the message-passing based encoding for low-density codes which are several times longer.

• （社）電子情報通信学会の論文
• 2010-11-01

著者

• Isaka Motohiko

  Dept. Of Informatics Kwansei Gakuin University

• KOTANI Misako

  Dept. of Informatics, Kwansei Gakuin University

• Kotani Misako

  Dept. Of Informatics Kwansei Gakuin University

関連論文

• 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

スポンサーリンク