P. Mathys, "A class of codes for T active users out of N multiple-access communication system", IEEE Transactions on Information Theory, Vol. 36, No. 6, November 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and Mathys [5] For the M user synchronous binary input real adder channel, a family of asymptotically optimal codes with two codewords per user has been constructed [6] The channels in [5] and [6] are noiseless. For a survey on codes for specific multiple access channels see the introduction in [7]. The receiver is based on successive decoding. The key idea behind successive decoding is to decode one user at a time, using already produced codeword estimates as side information to decode remaining users. This technique is also known as onion peeling, stripping, and (not always ....

P. Mathys, "A class of codes for a T active users out of N multiple-access communication system," IEEE Trans. Inform. Theory, vol. IT--36, pp. 1206--1219, Nov. 1990. 29

....for the following five types of slotted ALOHA systems with capture and multiple packet receptions: 1. Single packet reception system with geometric capture[7] 9] 2. Independent multiple packet reception system[6] with geometric capture; 3. Single packet reception system with M out of N capture[10][11] where M = N ; 4. Multiple packet reception system with M out of N capture[10] 11] 5. Single packet reception system with perfect capture [12] The first two systems belong to a stochastic capture model, while the last three systems, to a deterministic model. In the next section we ....

....1. Single packet reception system with geometric capture[7] 9] 2. Independent multiple packet reception system[6] with geometric capture; 3. Single packet reception system with M out of N capture[10] 11] where M = N ; 4. Multiple packet reception system with M out of N capture[10][11] 5. Single packet reception system with perfect capture [12] The first two systems belong to a stochastic capture model, while the last three systems, to a deterministic model. In the next section we describe our system model. In Section 3 general expressions for the cusp points and the ....

[Article contains additional citation context not shown here]

P. Mathys, "A class of codes for T active users out of N multiple-access communication system," IEEE Trans. Inform. Theory, vol. IT-36, no. 6, pp. 1206--1219, Nov. 1990.

....information theory, and c) spread spectrum code division multiaccess (CDMA) Each approach has its own advantages and drawbacks, and none addresses all aspects of the problem. It was pointed out that unification between these approaches are needed and since then, advances have been made (e.g. [2, 3], etc) To model a multiuser environment with bursty users, we will consider a L out of K (LOOK) additive white Gaussian noise (AWGN) channel where there are K po 1 This work was done when the author was with Dept. of ECE, University of Colorado at Boulder, Boulder, CO 80309, and was partially ....

P. Mathys, "A class of codes for a T active users out of N multiple-access communication system," IEEE Transactions on Information Theory, vol. IT-36, no. 6, pp. 1206-- 1219, November 1990.

....information theory, and c) spread spectrum code division multiaccess (CDMA) Each approach has its own advantages and drawbacks, and none addresses all aspects of the problem. It was pointed out that unification between these approaches are needed and since then, advances have been made (e.g. [2, 3], etc) To model a multiuser environment with bursty users, we will consider a L out of K (LOOK) additive white Gaussian noise (AWGN) channel where there are K potential users and at most L of them are actively transmitting (or active) at any given time. The receiver does not know the set of ....

P. Mathys, "A class of codes for a T active users out of N multiple-access communication system, " IEEE Transactions on Information Theory, vol. IT-36, no. 6, pp. 1206--1219, November 1990.

.... studied by Massey and Mathys [10] For the M user synchronous binary input real adder channel (which is noiseless) a family of asymptotically optimal codes with two codewords per user has been constructed [11] For a survey on codes for specific multiple access channels see the introduction in [12]. The second approach to achieving the difficult rate tuples is time sharing between vertices. This approach can require as many as M multiple access codes, each multiple access code requiring M individual codes (one for each user) Thus, this scheme requires on the order of M 2 individual ....

P. Mathys, "A class of codes for a T active users out of N multiple-access communication system," IEEE Trans. Inform. Theory, vol. IT--36, pp. 1206--1219, Nov. 1990.

.... studied by Massey and Mathys [10] For the M user synchronous binary input real adder channel (which is noiseless) a family of asymptotically optimal codes with two codewords per user has been constructed [11] For a survey on codes for specific multiple access channels see the introduction in [12]. The second approach to achieving the difficult rate tuples is time sharing between vertices. This approach can require as many as M multiple access codes, each multiple access code requiring M individual codes for each user. Thus, this scheme requires on the order of M 2 individual codes. ....

P. Mathys, "A class of codes for a T active users out of N multiple-access communication system," IEEE Trans. Inform. Theory, vol. IT--36, pp. 1206--1219, Nov. 1990.

No context found.

P. Mathys, "A class of codes for T active users out of N multiple-access communication system", IEEE Transactions on Information Theory, Vol. 36, No. 6, November 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC