A formalized optimum code search for q-ary trellis codes

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorRosa, E. M.
dc.creatorBorelli, W. C.
dc.creatorFarrell, P. G.
dc.date2014-05-20T15:25:04Z
dc.date2016-10-25T21:25:26Z
dc.date2014-05-20T15:25:04Z
dc.date2016-10-25T21:25:26Z
dc.date1997-01-01
dc.date.accessioned2017-04-06T09:37:52Z
dc.date.available2017-04-06T09:37:52Z
dc.identifierConference Record / IEEE Global Telecommunications Conference, v. 2, p. 948-952.
dc.identifierhttp://hdl.handle.net/11449/132276
dc.identifierhttp://acervodigital.unesp.br/handle/11449/132276
dc.identifier10.1109/GLOCOM.1997.638466
dc.identifierWOS:A1997BJ90L00178
dc.identifier2-s2.0-0031355719
dc.identifierhttp://dx.doi.org/10.1109/GLOCOM.1997.638466
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/942816
dc.descriptionThis paper gives a formalization for q-ary codes of the search algorithm [3] for optimum codes based on lattices and cosets [1]. With a more efficient and an automated algorithm it also has been possible to extend the search for larger convolutional encoder parameters and lattices partitions. New optimum binary, ternary and quaternary trellis codes are listed together with their coding gains.
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.languageeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relationGlobecom 97 - IEEE Global Telecommunications Conference, Conference Record, Vols 1-3
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectAlgorithms
dc.subjectBinary codes
dc.subjectConvolutional codes
dc.subjectEncoding (symbols)
dc.subjectLattice partitions
dc.subjectQ ary codes
dc.subjectTrellis codes
dc.titleA formalized optimum code search for q-ary trellis codes
dc.typeOtro


Este ítem pertenece a la siguiente institución