Please use this identifier to cite or link to this item:
- Special subsets and optimum codes based on lattices and cosets
- Universidade Estadual Paulista (UNESP)
- 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.
- IEEE International Symposium on Information Theory - Proceedings, p. 521-.
- Encoding (symbols)
- Matrix algebra
- Set theory
- Ternary codes
- Binary codes
- Acesso restrito
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.