Near Maximum-Likelihood Performance of Some New Cyclic Codes Constructed in the Finite-Field Transform Domain

Simple item page
dc.creatorTjhai, C.
dc.creatorTomlinson, M.
dc.creatorHoran, R.
dc.creatorAmbroze, M.
dc.creatorAhmed, M.
dc.date2005-02-07
dc.date.accessioned2026-07-07T08:15:20Z
dc.date.available2026-07-07T08:15:20Z
dc.descriptionIt is shown that some well-known and some new cyclic codes with orthogonal parity-check equations can be constructed in the finite-field transform domain. It is also shown that, for some binary linear cyclic codes, the performance of the iterative decoder can be improved by substituting some of the dual code codewords in the parity-check matrix with other dual code codewords formed from linear combinations. This technique can bring the performance of a code closer to its maximum-likelihood performance, which can be derived from the erroneous decoded codeword whose euclidean distance with the respect to the received block is smaller than that of the correct codeword. For (63,37), (93,47) and (105,53) cyclic codes, the maximum-likelihood performance is realised with this technique.
dc.description5 pages, 5 figures and 3 tables. Submitted to the ISCTA'05 conference
dc.identifierhttps://arxiv.org/abs/cs/0502035
dc.identifierhttp://arxiv.org/abs/cs/0502035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133418
dc.subjectInformation Theory
dc.titleNear Maximum-Likelihood Performance of Some New Cyclic Codes Constructed in the Finite-Field Transform Domain
dc.typetext

Files

Collections

arXiv