A New Method for Constructing Large Size WBE Codes with Low Complexity ML Decoder

Simple item page
dc.creatorFaraji, Mohammad Javad
dc.creatorPad, Pedram
dc.creatorMarvasti, Farokh
dc.date2008-10-04
dc.date2009-03-07
dc.date.accessioned2026-07-07T12:49:29Z
dc.date.available2026-07-07T12:49:29Z
dc.descriptionIn this paper we wish to introduce a method to reconstruct large size Welch Bound Equality (WBE) codes from small size WBE codes. The advantage of these codes is that the implementation of ML decoder for the large size codes is reduced to implementation of ML decoder for the core codes. This leads to a drastic reduction of the computational cost of ML decoder. Our method can also be used for constructing large Binary WBE (BWBE) codes from smaller ones. Additionally, we explain that although WBE codes are maximizing the sum channel capacity when the inputs are real valued, they are not necessarily appropriate when the input alphabet is binary. The discussion shows that when the input alphabet is binary, the Total Squared Correlation (TSC) of codes is not a proper figure of merit.
dc.identifierhttps://arxiv.org/abs/0810.0764
dc.identifierhttp://arxiv.org/abs/0810.0764
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/222418
dc.subjectInformation Theory
dc.titleA New Method for Constructing Large Size WBE Codes with Low Complexity ML Decoder
dc.typetext

Files

Collections

arXiv