A formalized optimum code search for q-ary trellis codes

Detalhes bibliográficos
Autor(a) principal: Rosa, E. M. [UNESP]
Data de Publicação: 1997
Outros Autores: Borelli, W. C., Farrell, P. G.
Tipo de documento: Artigo de conferência
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1109/GLOCOM.1997.638466
http://hdl.handle.net/11449/132276
Resumo: This 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.
id UNSP_9b81ee68f456edb89e2b431ec279101c
oai_identifier_str oai:repositorio.unesp.br:11449/132276
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling A formalized optimum code search for q-ary trellis codesAlgorithmsBinary codesConvolutional codesEncoding (symbols)Lattice partitionsQ ary codesTrellis codesThis 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.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Univ of State of Sao PauloUNESP, BauruInstitute of Electrical and Electronics Engineers (IEEE)Universidade Estadual Paulista (Unesp)Universidade Estadual de Campinas (UNICAMP)University of ManchesterRosa, E. M. [UNESP]Borelli, W. C.Farrell, P. G.2014-05-20T15:25:04Z2014-05-20T15:25:04Z1997-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject948-952http://dx.doi.org/10.1109/GLOCOM.1997.638466Conference Record / IEEE Global Telecommunications Conference, v. 2, p. 948-952.http://hdl.handle.net/11449/13227610.1109/GLOCOM.1997.638466WOS:A1997BJ90L001782-s2.0-0031355719Web of Sciencereponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengGlobecom 97 - IEEE Global Telecommunications Conference, Conference Record, Vols 1-3info:eu-repo/semantics/openAccess2021-10-23T21:44:26Zoai:repositorio.unesp.br:11449/132276Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462021-10-23T21:44:26Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv A formalized optimum code search for q-ary trellis codes
title A formalized optimum code search for q-ary trellis codes
spellingShingle A formalized optimum code search for q-ary trellis codes
Rosa, E. M. [UNESP]
Algorithms
Binary codes
Convolutional codes
Encoding (symbols)
Lattice partitions
Q ary codes
Trellis codes
title_short A formalized optimum code search for q-ary trellis codes
title_full A formalized optimum code search for q-ary trellis codes
title_fullStr A formalized optimum code search for q-ary trellis codes
title_full_unstemmed A formalized optimum code search for q-ary trellis codes
title_sort A formalized optimum code search for q-ary trellis codes
author Rosa, E. M. [UNESP]
author_facet Rosa, E. M. [UNESP]
Borelli, W. C.
Farrell, P. G.
author_role author
author2 Borelli, W. C.
Farrell, P. G.
author2_role author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
Universidade Estadual de Campinas (UNICAMP)
University of Manchester
dc.contributor.author.fl_str_mv Rosa, E. M. [UNESP]
Borelli, W. C.
Farrell, P. G.
dc.subject.por.fl_str_mv Algorithms
Binary codes
Convolutional codes
Encoding (symbols)
Lattice partitions
Q ary codes
Trellis codes
topic Algorithms
Binary codes
Convolutional codes
Encoding (symbols)
Lattice partitions
Q ary codes
Trellis codes
description This 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.
publishDate 1997
dc.date.none.fl_str_mv 1997-01-01
2014-05-20T15:25:04Z
2014-05-20T15:25:04Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1109/GLOCOM.1997.638466
Conference Record / IEEE Global Telecommunications Conference, v. 2, p. 948-952.
http://hdl.handle.net/11449/132276
10.1109/GLOCOM.1997.638466
WOS:A1997BJ90L00178
2-s2.0-0031355719
url http://dx.doi.org/10.1109/GLOCOM.1997.638466
http://hdl.handle.net/11449/132276
identifier_str_mv Conference Record / IEEE Global Telecommunications Conference, v. 2, p. 948-952.
10.1109/GLOCOM.1997.638466
WOS:A1997BJ90L00178
2-s2.0-0031355719
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Globecom 97 - IEEE Global Telecommunications Conference, Conference Record, Vols 1-3
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 948-952
dc.publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers (IEEE)
publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers (IEEE)
dc.source.none.fl_str_mv Web of Science
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1797790264472895488

Registros relacionados