Self-orthogonal codes constructed from cyclic squares
Xiaohong Peng, P.G. Farrel · 1991
Self-orthogonal codes are a class of one-step majority logic decodable (MLD) codes; i.e. they have a very simple decoding algorithm and relatively low cost, although performance is below the theoretical limits of some codes with similar rate and minimum distances. The ideas of cyclic square and complete set of cyclic squares, and some operations on them, are introduced. From these one can easily construct a class of self-orthogonal codes. This kind of codes has the virtue of being adjustable in its error control capacities, and a strong potential to be employed in communication and information storage systems. >