On 2-adically extended projective geometry based codes and their efficient decoding architecture

In this paper we consider a new class of codes over rings obtained through 2-adically extending the Projective Geometry (PG) codes by means of lifting. We also propose an elegant and configurable bit-serial Majority Logic (MLG) decoding architecture consisting of simple blocks, making it amenable for Very Large Scale Integration (VLSI). Some preliminary performance results are also provided to demonstrate the utility of the coding scheme in random and burst error scenarios. The proposed code and the associated decoder appears to be a useful candidate for both communications involving power and complexity constrained devices as well as in storage systems, especially nanoscale memories.