New Families of Triple Error Correcting Codes with BCH Parameters

Simple item page
dc.creatorBracken, Carl
dc.date2008-03-25
dc.date.accessioned2026-07-07T12:17:52Z
dc.date.available2026-07-07T12:17:52Z
dc.descriptionDiscovered by Bose, Chaudhuri and Hocquenghem, the BCH family of error correcting codes are one of the most studied families in coding theory. They are also among the best performing codes, particularly when the number of errors being corrected is small relative to the code length. In this article we consider binary codes with minimum distance of 7. We construct new families of codes with these BCH parameters via a generalisation of the Kasami-Welch Theorem.
dc.description11 pages. Submitted to IEEE Transactions on information Theory
dc.identifierhttps://arxiv.org/abs/0803.3553
dc.identifierhttp://arxiv.org/abs/0803.3553
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212218
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titleNew Families of Triple Error Correcting Codes with BCH Parameters
dc.typetext

Files

Collections

arXiv