2014/10/14 by Fernando Piñero, Piñero, Fernando L.
Computer Science · Engineering · #Coding theory and cryptography #Combinatorics (math.CO) #Error Correcting Code Techniques #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1410.3703
openalex publication_date 2014/10/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this article we prove that Schubert union codes are Tanner codes constructed with the point--line incidence geometry that Schubert varieties inherit from the Grassmannian. We do this by first finding an lengthening algorithm for Tanner codes. This algorithm finds the entries of a codeword of a Tanner code from the entries in a given subset of its positions. We find sufficient conditions on the initial set and the initial positions such that a codeword is determined from the component codes only. We find an iterative and systematic encoding algorithm for Schubert union codes with linear complexity. With this encoder we also determine the minimum distance of Schubert union codes.