Special subsets and optimum codes based on lattices and cosets

Detalhes bibliográficos
Autor(a) principal: Rosal, E. M. [UNESP]
Data de Publicação: 1997
Outros Autores: Borelli, W. C. [UNESP], Farrell, P. G. [UNESP]
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/ISIT.1997.613458
http://hdl.handle.net/11449/64994
Resumo: This paper introduces the concept of special subsets when applied to generator matrices based on lattices and cosets as presented by Calder-bank and Sloane. By using the special subsets we propose a non exhaustive code search for optimum codes. Although non exhaustive, the search always results in optimum codes for given (k1, V, Λ/Λ′). Tables with binary and ternary optimum codes to partitions of lattices with 8, 9 e 16 cosets, were obtained.
id UNSP_b3fc8e5da6149a2fbd5b6d0079c945d6
oai_identifier_str oai:repositorio.unesp.br:11449/64994
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Special subsets and optimum codes based on lattices and cosetsEncoding (symbols)Matrix algebraSet theoryTernary codesBinary codesThis paper introduces the concept of special subsets when applied to generator matrices based on lattices and cosets as presented by Calder-bank and Sloane. By using the special subsets we propose a non exhaustive code search for optimum codes. Although non exhaustive, the search always results in optimum codes for given (k1, V, Λ/Λ′). Tables with binary and ternary optimum codes to partitions of lattices with 8, 9 e 16 cosets, were obtained.UNESPUNESPUniversidade Estadual Paulista (Unesp)Rosal, E. M. [UNESP]Borelli, W. C. [UNESP]Farrell, P. G. [UNESP]2014-05-27T11:18:11Z2014-05-27T11:18:11Z1997-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject521http://dx.doi.org/10.1109/ISIT.1997.613458IEEE International Symposium on Information Theory - Proceedings, p. 521-.http://hdl.handle.net/11449/6499410.1109/ISIT.1997.6134582-s2.0-0030650922Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengIEEE International Symposium on Information Theory - Proceedingsinfo:eu-repo/semantics/openAccess2021-10-23T21:37:55Zoai:repositorio.unesp.br:11449/64994Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestrepositoriounesp@unesp.bropendoar:29462021-10-23T21:37:55Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Special subsets and optimum codes based on lattices and cosets
title Special subsets and optimum codes based on lattices and cosets
spellingShingle Special subsets and optimum codes based on lattices and cosets
Rosal, E. M. [UNESP]
Encoding (symbols)
Matrix algebra
Set theory
Ternary codes
Binary codes
title_short Special subsets and optimum codes based on lattices and cosets
title_full Special subsets and optimum codes based on lattices and cosets
title_fullStr Special subsets and optimum codes based on lattices and cosets
title_full_unstemmed Special subsets and optimum codes based on lattices and cosets
title_sort Special subsets and optimum codes based on lattices and cosets
author Rosal, E. M. [UNESP]
author_facet Rosal, E. M. [UNESP]
Borelli, W. C. [UNESP]
Farrell, P. G. [UNESP]
author_role author
author2 Borelli, W. C. [UNESP]
Farrell, P. G. [UNESP]
author2_role author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
dc.contributor.author.fl_str_mv Rosal, E. M. [UNESP]
Borelli, W. C. [UNESP]
Farrell, P. G. [UNESP]
dc.subject.por.fl_str_mv Encoding (symbols)
Matrix algebra
Set theory
Ternary codes
Binary codes
topic Encoding (symbols)
Matrix algebra
Set theory
Ternary codes
Binary codes
description This paper introduces the concept of special subsets when applied to generator matrices based on lattices and cosets as presented by Calder-bank and Sloane. By using the special subsets we propose a non exhaustive code search for optimum codes. Although non exhaustive, the search always results in optimum codes for given (k1, V, Λ/Λ′). Tables with binary and ternary optimum codes to partitions of lattices with 8, 9 e 16 cosets, were obtained.
publishDate 1997
dc.date.none.fl_str_mv 1997-01-01
2014-05-27T11:18:11Z
2014-05-27T11:18:11Z
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/ISIT.1997.613458
IEEE International Symposium on Information Theory - Proceedings, p. 521-.
http://hdl.handle.net/11449/64994
10.1109/ISIT.1997.613458
2-s2.0-0030650922
url http://dx.doi.org/10.1109/ISIT.1997.613458
http://hdl.handle.net/11449/64994
identifier_str_mv IEEE International Symposium on Information Theory - Proceedings, p. 521-.
10.1109/ISIT.1997.613458
2-s2.0-0030650922
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv IEEE International Symposium on Information Theory - Proceedings
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 521
dc.source.none.fl_str_mv Scopus
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 repositoriounesp@unesp.br
_version_ 1834483646366482432

Registros relacionados