Generalized Finite-Geometry Codes

Carlos R.P. Hartmann, Syracuse University
Luther D. Rudolph, Syracuse University



A technique is presented for constructing cyclic codes that retain many of the combinatorial properties of finite-geometry codes, but are often superior to geometry codes. It is shown that L-step orthogonalization is applicable to certain subclasses of these codes.