Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes

DOI10.1109/TIT.2004.828142MaRDI QIDQ3547655zbMATH OpenFDO

Authors Sarah A. Spence

Publication date 21 December 2008

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

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

zbMATH Keywords

dimensionerror-control codesnonbinary codesReed-Solomon codessubspace subcodes

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• Subspace subcodes of Reed-Solomon codes
• Subspace subcodes of generalized Reed-Solomon codes
• On subspace codes
• Subcodes of Reed-Solomon Codes Suitable for Soft Decoding
• Efficient encoding for a class of subspace subcodes
• Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
• Subspace Codes
• The dimension of subcode-subfields of shortened generalized Reed-Solomon codes
• Subspace code constructions
• Repairing Reed-Solomon Codes via Subspace Polynomials

Cited in

(2)

• Subspace subcodes of Reed-Solomon codes
• Subspace subcodes of generalized Reed-Solomon codes

This page was built for publication: Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes

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