๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Nonexistence of certain symmetric spherical codes

โœ Scribed by Peter Boyvalenkov

Publisher
Springer
Year
1993
Tongue
English
Weight
221 KB
Volume
3
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The nonexistence of [71,5,46;3]-codes
The nonexistence of [71,5,46;3]-codes
โœ Noboru Hamada; Yoko Watamori ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 789 KB
The nonexistence of ternary [79,6,51] co
The nonexistence of ternary [79,6,51] codes
โœ Noboru Hamada; Yoko Watamori ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 143 KB

It is known (cf. Hamada, J. Combin. Inform. System Sci. 18 (1993b) that there is no ternary [78,6,51] code meeting the Griesmer bound and n 3(6; 51) = 79 or 80, where n3(k; d) denotes the smallest value of n for which there exists a ternary [n; k; d] code.

Nonexistence of certain perfect arrays
Nonexistence of certain perfect arrays
โœ Wai-Kiu Chan; Man-Keung Siu; Siu-Lun Ma ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 447 KB

Perfect binary arrays are equivalent to Menon difference sets in certain groups. This note proves a theorem on the Menon difference set and interprets its consequences on the nonexistence of certain perfect arrays. examples of perfect arrays of sizes 6 x 6 and 3 x 12. In recent years quite a number