Special subsets and optimum codes based on lattices and cosets
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/05/2014
27/05/2014
01/01/1997
|
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. |
Formato |
521 |
Identificador |
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 |
Idioma(s) |
eng |
Relação |
IEEE International Symposium on Information Theory - Proceedings |
Direitos |
closedAccess |
Palavras-Chave | #Encoding (symbols) #Matrix algebra #Set theory #Ternary codes #Binary codes |
Tipo |
info:eu-repo/semantics/conferencePaper |