Affine Code for T-User Noisy Multiple-Access Adder Channel

スポンサーリンク

概要

• 論文の詳細を見る

• Coding scheme for a noisy multiple-access adder channel is proposed. When a T-user δ-decodable affine code C is given a priori, a qT-user λδ-decodable affine code C^* is produced by using a q×q matrix B satisfying BA=λI_<q×q>, e.g., a Hadamard matrix or a conference matrix. In particular, the case of δ=1 is considered for the practical purposes. A (2n-1)-user uniquely decodable (δ=1) affine code C^n with arbitrary code length n is recursively constructed. When C^n plays a role of C, a q(2n-1)-user λ-decodable affine code C^* is obtained. The code length and the number of users of C^* are more flexible than those of the Wilson's code. The total rate of the λ-decodable code in this paper tends to be higher than that of the λ-decodable code by Wilson as the number of users increases.

• 社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Mikami Naoki

  Department Of Computer And Information Science University Of Industrial Technology

• Cheng Jun

  The Department Of Knowledge Eng.and Comp. Sci. Doshisha University

• WATANABE Yoichiro

  the Department of Knowledge Eng.and Comp. Sci., Doshisha University

• Watanabe Yoichiro

  The Department Knowledge Engineering And Computer Science Doshisha University

• Watanabe Yoichiro

  The Department Of Knowledge Eng.and Comp. Sci. Doshisha University

関連論文

• Study for Signal Processing to Survey Pulsars Using Noise Suppression Filter Based on Average Spectrum (Special Section of Letters Selected from the 1994 IEICE Spring Conference)
• Parameter Estimation of Inhomogeneous AR Model Expanded with Unknown Basis (Special Section on Digital Signal Processing)
• Affine Code for T-User Noisy Multiple-Access Adder Channel
• Formulation of the Independence Number of One-Order Graph Associated with a Linear Code (Special Section on Information Theory and Its Applications)
• Direction-of-Arrival Estimation for Near-Field Sources with Multiple Symmetric Subarrays

スポンサーリンク