Hierarchical Quasi-cyclic Codes: Algebraic Construction and Parameter Bounds

This paper introduces a novel algebraic construction of hierarchical quasi-cyclic codes, a type of error-correcting code. The significance lies in providing explicit code parameters and bounds, particularly for codes derived from Reed-Solomon codes. The algebraic approach contrasts with simulation-based methods, offering new insights into code properties and potentially improving minimum distance for binary codes. The hierarchical structure and quasi-cyclic nature are also important for practical applications.