Encoding and decoding of Reed-Muller codes with quasi-linear complexity

Encoding and decoding of Reed-Muller codes have been a major research topic in coding and theoretical computer science communities. Despite of the fact that there have been numerous encoding and decoding algorithms in the literature, most of them are not quasi-linear time algorithms for arbitrary or...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory Jg. 71; H. 12; S. 1
Hauptverfasser:	Kuang, Yi, Li, Songsong, Liu, Shu, Ma, Liming, Xing, Chaoping
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.12.2025
Schlagworte:	Codes Complexity theory Decoding Encoding Encoding and Decoding Algorithms Frequency modulation Galois fields Interpolation Polynomials Quasi-linear Complexity Reed-Muller codes Reed-Solomon codes
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!