Paper Info
Title
Redundancies of correction capability optimized Reed-Muller codes
Abstract
This article is focused on some variations of Reed-Muller codes that yield improvements to the rate for a prescribed decoding performance under the Berlekamp-Massey-Sakata algorithm with majority voting. Explicit formulas for the redundancies of the new codes are given.
Year
DOI
Venue
2008
10.1016/j.dam.2008.01.004
Discrete Applied Mathematics
Keywords
DocType
Volume
prescribed decoding performance,reed-muller code,new code,correction capability,explicit formula,feng–rao improved code,yield improvement,berlekamp-massey-sakata algorithm,reed–muller code,majority voting,reed muller code
Journal
156
Issue
ISSN
Citations 
15
Discrete Applied Mathematics
0
PageRank 
References 
Authors
0.34
7
2
Name
Order
Citations
PageRank
Maria Bras-Amoros114719.96
Michael E. O'Sullivan2889.65