Paper Info
Title
The Ubiquity of Reed-Muller Codes
Abstract
It is argued that the nearly fifty-year-old Reed-Muller codes underlie a surprisingly large number of algebraic problems in coding and cryptography. This thesis is supported by examples that include some new results such as the construction of a new class of constant-weight cyclic codes with a remarkably simple decoding algorithm and a much simplified derivation of the well-known upper bound on the linear complexity of the running key produced by a nonlinearly filtered maximal-length shift-register.
Year
DOI
Venue
2001
10.1007/3-540-45624-4_1
AAECC
Keywords
Field
DocType
nonlinearly filtered maximal-length shift-register,linear complexity,fifty-year-old reed-muller code,simple decoding algorithm,constant-weight cyclic code,new result,algebraic problem,large number,new class,reed-muller codes,reed muller code,cyclic code,upper bound
Discrete mathematics,Upper and lower bounds,Block code,Binary code,Cyclic code,Error detection and correction,Reed–Muller code,Linear code,List decoding,Mathematics
Conference
ISBN
Citations 
PageRank 
3-540-42911-5
1
0.39
References 
Authors
10
1
Name
Order
Citations
PageRank
James L. Massey11096272.94