An Estimate of the Complexity of Constructing Binary Linear Cascade Codes

The author considers the construction of binary linear cascade codes for which the ratio of the code distance to the code length tends to a positive quantity which depends on the transmission rate as the code length and transmission rate constant increase. The number of operations necessary to specify such a code, for arbitrary code length, is bounded from above by the square of the length of a code combination. A ower bound is found for the code distance of a cascade code.