Projection codes for burst error correction in SSMA networks

Abstract

The authors consider a multihop packet radio network, i.e., a spread-spectrum multiple-access (SSMA) network. The network by nature of its operation, has collisions, when two or more users share the same frequency bin at a given time. A solution to the collisions is available by introducing error-correcting codes into the transmitted data. A simple projection code which asymptotically approaches Reiger's bound is suggested and analyzed. Unlike the Reed-Solomon code the projection code is not subject to algebraic constraints and can be easily adjusted to any system parameters such as packet size, code rate, number of bits per hop, and modulation alphabet. The code's structure, features, performances, and implementation, and its advantages over other codes are described.<>