The Structure of Dual Schubert Union Codes

DOI10.1109/TIT.2017.2650207zbMATH Open1366.94258arXiv1410.3703MaRDI QIDQ5280840FDOQ5280840

Authors: Fernando L. Piñero 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1410.3703

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Cited In (3)

• Minimum distance and the minimum weight codewords of Schubert codes
• Title not available (Why is that?)
• The weight spectrum of certain affine Grassmann codes

This page was built for publication: The Structure of Dual Schubert Union Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280840)