Riv.Mat.Univ.Parma (4) 17 (1991)


A decoding method for planer near-ring codes

Received: 2 October 1991
Mathematics Subject Classification: 16Y30 - 14B35 - 05B05

Abstract: Using planar near-rings J. R. Clay and G. Ferrero constructed BIB-designs of high efficiency. For instance, if N is a finite integral planar near-ring, then the set of blocks B = {nN* + m|n, m ∈ n ≠ 0} always forms a BIBD. By taking either the rows or the columns of the incidence matrix of such a BIBD one can obtain nonlinear codes. The purpose of this paper is to develop decoding algorithms for these codes.