Logotipo do repositório
 

Publicação:
Special subsets and optimum codes based on lattices and cosets

Página do item simplificado
dc.contributor.authorRosal, E. M. [UNESP]
dc.contributor.authorBorelli, W. C. [UNESP]
dc.contributor.authorFarrell, P. G. [UNESP]
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:18:11Z
dc.date.available2014-05-27T11:18:11Z
dc.date.issued1997-01-01
dc.description.abstractThis 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.en
dc.description.affiliationUNESP
dc.description.affiliationUnespUNESP
dc.format.extent521
dc.identifierhttp://dx.doi.org/10.1109/ISIT.1997.613458
dc.identifier.citationIEEE International Symposium on Information Theory - Proceedings, p. 521-.
dc.identifier.doi10.1109/ISIT.1997.613458
dc.identifier.scopus2-s2.0-0030650922
dc.identifier.urihttp://hdl.handle.net/11449/64994
dc.language.isoeng
dc.relation.ispartofIEEE International Symposium on Information Theory - Proceedings
dc.rights.accessRightsAcesso aberto
dc.sourceScopus
dc.subjectEncoding (symbols)
dc.subjectMatrix algebra
dc.subjectSet theory
dc.subjectTernary codes
dc.subjectBinary codes
dc.titleSpecial subsets and optimum codes based on lattices and cosetsen
dc.typeTrabalho apresentado em evento
dcterms.licensehttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
dspace.entity.typePublication

Arquivos

Coleções

Artigos