1. The Structure of Dual Schubert Union Codes.
- Author
-
Pinero, Fernando L.
- Subjects
- *
INFORMATION theory , *DECODING algorithms , *ERROR-correcting codes , *TANNER graphs , *CODING theory , *GRASSMANN manifolds - Abstract
In this paper, we prove that Schubert union codes are Tanner codes constructed from the point–line incidence geometry inherited from the Grassmannian. Our proof is based on an iterative encoding algorithm for Tanner codes. This encoder determines the entries of a code word of a Tanner code from the entries in a given subset of its positions. As a result, we find sufficient conditions on the initial positions such that a code word is determined from the component codes only. This algorithm has linear complexity in the code length. We also use this encoder to determine the minimum distance of Schubert union codes in terms of the minimum distance of the Schubert varieties contained therein. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF