A Code Construction for M-Choose-T Communication over the Multiple-Access Adder Channel
スポンサーリンク
概要
- 論文の詳細を見る
Coding scheme is discussed for M-Choose-T communication in which at most T active users out of M potential users simultaneously transmit their messages over a common channel. The multiple-access channel considered in this paper is assumed to be a time-discrete noiseless adder channel without feedback with T binary inputs and one real-valued output, and is used on the assumption of perfect block and bit synchronization among users. In this paper a new class of uniquely decodable codes is proposed in order to realize error-free M-Choose-T communication over the adder channel described above. These codes are uniquely decodable in the sense that not only the set of active users can be specified but also their transmitted messages can be recovered uniquely as long as T or fewer users are active simultaneously. It is shown that these codes have a simple decoding algorithm and can achieve a very high sum rate arbitrarily close to unity if exactly T users are active.
- 社団法人電子情報通信学会の論文
- 1995-01-25
著者
-
TANAKA Hatsukazu
Faculty of Engineering, Kobe University
-
TANAKA Hatsukazu
the Faculty of Engineering, Kobe University
-
Tokiwa Kin-ichiroh
Faculty of Engineering, Kobe University
-
Matsuda Hiroshi
College of Liberal Arts, Himeji Dokkyo University
-
Tokiwa Kin-ichiroh
Faculty Of Engineering Kobe University
-
Tanaka Hatsukazu
Faculty Of Engineering Kobe University
-
Matsuda Hiroshi
College Of Liberal Arts Himeji Dokkyo University
関連論文
- Image Size Invariant Visual Cryptography (Special Section on Information Theory and Its Applications)
- Efficient Relative Time-Stamping Scheme Based on the Ternary Link(Information Security)(Information Theory and Its Applications)
- Message Authentication for Stream(Special Section on Cryptography and Information Security)
- Size-Reduced Visual Secret Sharing Scheme(Discrete Mathematics and Its Applications)
- Transitive Signature Scheme for Directed Trees
- Polynomial Representation of a Visual Secret Sharing Scheme and Its Application
- A New Digital Watermarking Scheme Applying Locally the Wavelet Transform
- A Code Construction for M-Choose-T Communication over the Multiple-Access Adder Channel
- Video Watermarking of Which Embedded Information Depends on the Distance between Two Signal Positions
- Equivalent Keys in RC6-32/20/176(Special Section on Information Theory and Its Applications)
- A New Approach to Constructing a Provably Secure Variant of Schnorr's Identification Scheme
- Improvement on the Cheater Identifiable Threshold Scheme(Special Section on Fundamentals of Information and Communications)
- A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes(Coding Theory)(Regular Section)
- A New Method of Measuring the Blocking Effects of Images Based on Cepstral Information
- Identity-Based Non-interactive Key Sharing (Special Section on Cryptography and Information Security)
- On the Security of the ElGamal-Type Signature Scheme with Small Parameters (Special Section on Cryptography and Information Security)
- On the Security of the Improved Knapsack Cryptosystem (Special Section on Information Theory and Its Applications)