Answers are grounded in this paper and cite their sources.
A new class of codes, called product generator codes, which are similar to Elias's iterated codes, are investigated. An important subclass of these codes is the generalized Reed-Muller codes. If the original codes that are iterated to produce a product code areL_1andL_2-step orthogonalizable, then the product code is (L_1 + L_2 - 1)-step orthogonalizable. Further if a-order product generator code is produced from these originalL-step orthogonal izable codes, the new code is at most(ν +1)step orthogonalizable.
No takes yet. Share an insight, caveat, or question.
W. Gore (1970) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: