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...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 71; no. 12; pp. 9330 - 9339
Main Authors:	Kuang, Yi, Li, Songsong, Liu, Shu, Ma, Liming, Xing, Chaoping
Format:	Journal Article
Language:	English
Published:	IEEE 01.12.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!