Redundancies of Correction-Capability-Optimized Reed-Muller Codes

Simple item page
dc.creatorBras-Amorós, Maria
dc.creatorO'Sullivan, Michael E.
dc.date2006-09-29
dc.date.accessioned2026-07-07T08:18:02Z
dc.date.available2026-07-07T08:18:02Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/cs/0609160
dc.identifierhttp://arxiv.org/abs/cs/0609160
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134295
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectE.4
dc.titleRedundancies of Correction-Capability-Optimized Reed-Muller Codes
dc.typetext

Files

Collections

arXiv