Channel Coding with a Sequential Algebraic Coding Scheme

In this paper a simple coding scheme utilizing both sequential and algebraic coding is proposed, and bounds on its performance are derived using theoretical bounds on the performance of sequential decoding. These bounds are compared with bounds on a similar, though more complex, scheme proposed by Falconer [2]. Except for sequential rates in a range strictly above the bounds on the present scheme are shown to be superior.