A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
In many communication systems, variable-redundancy coding schemes are highly desirable either due to the fact that messages of various degrees of importance are present, or due to some change in the real communication channel. A class of "cyclic product codes" presented in this paper is capable of operating in variable redundancy modes. In the simplest case, the generator polynomial in the high redundancy mode is g(x) = gl(x)g:(x), while the generator polynomial in the low redundancy mode isdoi:10.1016/s0019-9958(66)90238-5 fatcat:vakhzxi7tfe3ph65su32tu3w7q