Balanced Reed-Solomon Codes

We consider the problem of constructing linear Maximum Distance Separable (MDS) error-correcting codes with generator matrices that are sparsest and balanced. In this context, sparsest means that every row has the least possible number of non-zero entries, and balanced means that every column contai...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2016-01
Hauptverfasser:	Halbawi, Wael, Liu, Zihan, Hassibi, Babak
Format:	Artikel
Sprache:	eng
Schlagworte:	Codes Columnar structure Computing time Decoding Error correcting codes Error correction Error correction & detection Mathematical analysis Matrix methods Reed-Solomon codes
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!