188 research outputs found
Semidefinite code bounds based on quadruple distances
Let be the maximum number of words of length , any two
having Hamming distance at least . We prove , which implies
that the quadruply shortened Golay code is optimal. Moreover, we show
, , , ,
, , , ,
, , , ,
, , and .
The method is based on the positive semidefiniteness of matrices derived from
quadruples of words. This can be put as constraint in a semidefinite program,
whose optimum value is an upper bound for . The order of the matrices
involved is huge. However, the semidefinite program is highly symmetric, by
which its feasible region can be restricted to the algebra of matrices
invariant under this symmetry. By block diagonalizing this algebra, the order
of the matrices will be reduced so as to make the program solvable with
semidefinite programming software in the above range of values of and .Comment: 15 page
Avaliação da reação de resistência à ferrugem da folha e do colmo à campo no germoplasma de azevém da Embrapa, safra 2006.
bitstream/CNPGL/12932/1/comunicado_167.pd
Avaliação da reação de resistência à ferrugem da folha e do colmo à campo no germoplasma de azevém da Embrapa, safra 2006.
bitstream/item/31297/1/comunicado-167.pd
Situação atual e demandas de pesquisa, desenvolvimento e inovação tecnológica em forrageiras e pastagens - Região Sul do Rio Grande do Sul.
bitstream/item/33620/1/documento-178.pd
Use of Patterns for Knowledge Management in the Ceramic Tile Design Chain
Knowledge Management (KM) is a complex objective, especially in the instance of extended enterprises consisting of SMEs, and critical in new product design and development (NPD). The use of patterns is essential to get KM in collaborative NPD processes. This paper presents the use of patterns adopted in the CE-TILE project to standardize information and knowledge in collaborative work. The different types of patterns and models established for the knowledge capture, formalization and configuration are also described
- …