Efficient encoding for a class of subspace subcodes

DOI10.1109/18.782162MaRDI QIDQ4503412zbMATH OpenOpenAlexFDO

Authors Marten van Dijk, L. M. G. M. Tolhuizen

Publication date 7 September 2000

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

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

zbMATH Keywords

encoding algorithmexplicit algorithmlinear maximum-distance separablesubspace subcodes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• On subspace codes
• Subspace subcodes of Reed-Solomon codes
• Subspace code constructions
• Subspace Codes
• Subspace subcodes of generalized Reed-Solomon codes
• Binary subspace codes in small ambient spaces
• Construction of optimal constant-dimension subspace codes
• Generalized Subspace Subcodes With Application in Cryptology
• Constructions and bounds for mixed-dimension subspace codes
• Subspace code based on flats in affine space over finite fields

Cited in

(5)

• New constructions of optimal subsystem codes
• Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes
• Subspace Codes
• Subexponential and Linear Subpacketization Coded Caching via Projective Geometry
• Cross Subspace Alignment Codes for Coded Distributed Batch Computation

This page was built for publication: Efficient encoding for a class of subspace subcodes

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