A Bound on Uniquely Decodable Code Pair for Two-User Binary Adder Channel

スポンサーリンク

概要

• 論文の詳細を見る

• A uniquely decodable code pair (C,S) is considered for the two-user binary adder channel. When the first code C is linear, a lower bound of |S| is formulated and a uniquely decodable code pair (C,S) is presented. When a rate R_1 of C is less than 1/3, a rate R_2 of S is greater than the best rate known previously.

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

著者

• WATANABE Yoichiro

  Department of Ophthalmology, Yokohama City University Medical Center

• Shi Jian-jun

  Department Knowledge Eng. & Comp. Sci. Doshisha University

• Shi Jian-jun

  Department Of Knowledge Engineering And Computer Science Doshisha University

• Watanabe Yoichiro

  Department Knowledge Eng. & Comp. Sci. Doshisha University

• Watanabe Yoichiro

  Department Of Knowledge Engineering And Computer Science Doshisha University

関連論文

• Wavefront Analysis of Acrylic Spherical and Aspherical Intraocular Lenses
• Uniquely Decodable Code Pair Derived from a Class of Generator Matrices for Two-User Binary Adder Channel (Special Section on Information Theory and Its Applications)
• Construction of Error-Correcting Spreading Sequences for Synchronous-CDMA Systems
• T-User Code with Arbitrary Code Length for Multiple-Access Adder Channel (Special Section on Information Theory and Its Applications)
• A Bound on Uniquely Decodable Code Pair for Two-User Binary Adder Channel
• B-1-221 DoA Estimation for Near-Field Sources Based on Generalized-ESPRIT with Multiple Subarrays
• A-6-6 K-User Hybrid Spread-Accumulate Code for Multiple-Access Channel
• Spreading and Interleaving Design for Synchronous Interleave-Division Multiple-Access
• Two-User Turbo Decoding with Simplified Sum Trellis in Two-Way Relay Channel
• Direction-of-Arrival Estimation for Near-Field Sources with Multiple Symmetric Subarrays

スポンサーリンク