Affine Grassmann Codes

DOI10.1109/TIT.2010.2048470MaRDI QIDQ5281384zbMATH OpenFDO

Authors Peter Beelen, Sudhir R. Ghorpade, Tom Høholdt

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/TIT.2010.2048470

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited in

(12)

• Almost affine codes
• Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes
• Automorphism groups of Grassmann codes
• The structure of dual Grassmann codes
• Parameterized affine codes
• Affine Reflection Group Codes
• Affine 3-nonsystematic codes
• On Lagrangian-Grassmannian codes
• Linear codes associated to determinantal varieties in the space of Hermitian matrices
• The weight spectrum of certain affine Grassmann codes
• Computing the minimum distance of the \(C( \mathbb{O}_{3 , 6})\) polar orthogonal Grassmann code with elementary methods
• Majority logic decoding of affine Grassmann codes over nonbinary fields

This page was built for publication: Affine Grassmann Codes

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