Document Type
Report
Date
4-1972
Keywords
Codes
Language
Language
Disciplines
Computer Sciences
Description/Abstract
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.
Recommended Citation
Hartmann, Carlos R.P. and Rudolph, Luther D., "Generalized Finite-Geometry Codes" (1972). Electrical Engineering and Computer Science - Technical Reports. 32.
https://surface.syr.edu/eecs_techreports/32
Source
local
