Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Binary Quadratic Form: A Solution To The Set Partitioning Over Gf(q)|
|Author:||de Almeida Celso|
Palazzo Jr. R.
|Abstract:||Summary form only given, as follows. A general solution to the set-partitioning problem over GF(q) obtained by using the binary quadratic forms for bidimensional lattices is presented. From Fermat's results, genus and composition theorems, it is shown that, when the solution is relatively prime, the resultant fundamental set forms a Latin square and that the least-squared Euclidean distance between points belonging to the same coset is q.|
|Editor:||Publ by IEEE, Piscataway, NJ, United States|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.