The Basics of Bases
The maximum length of MDS codes for a given field and dimension, and their structure in the optimal case, remain unknown. However, at least asymptotically, the Reed-Solomon codes (RS codes) are optimal in the family of MDS codes. These RS codes are fundamental in technological applications ranging f...
Gespeichert in:
Veröffentlicht in: | The Mathematical intelligencer 2010-06, Vol.32 (2), p.49-55 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The maximum length of MDS codes for a given field and dimension, and their structure in the optimal case, remain unknown. However, at least asymptotically, the Reed-Solomon codes (RS codes) are optimal in the family of MDS codes. These RS codes are fundamental in technological applications ranging from computer drives to CD and DVD players to all manner of digital imaging, such as the amazing pictures transmitted by Voyager II. Here, Bruen and Bruen explain how many bases are contained in a spanning set and obtain the fundamental lower bound for the number of bases in a spanning set in a vector space. Moreover, using a little algebraic geometry they sketch an embedding result for finite fields. |
---|---|
ISSN: | 0343-6993 1866-7414 |
DOI: | 10.1007/s00283-010-9149-4 |