Special subsets and optimum codes based on lattices and cosets
Nenhuma Miniatura disponível
Data
1997-01-01
Autores
Rosal, E. M. [UNESP]
Borelli, W. C. [UNESP]
Farrell, P. G. [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
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.
Descrição
Palavras-chave
Encoding (symbols), Matrix algebra, Set theory, Ternary codes, Binary codes
Como citar
IEEE International Symposium on Information Theory - Proceedings, p. 521-.