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

Codes over GF(4) and complex lattices

โœ Scribed by N.J.A Sloane

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
633 KB
Volume
52
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal linear codes over GF(4)
Optimal linear codes over GF(4)
โœ P.P. Greenough; R. Hill ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 653 KB

A central problem in coding theory is that of finding the smallest length for which there exists a linear code of dimension k and minimum distance d, over a field of ~7 elements, We consider here the problem for quaternary codes (q=4), solving the problem for k< 3 for all values of d, and for k=4 fo

Codes over GF(3) of length 5, 27 codewor
Codes over GF(3) of length 5, 27 codewords, and covering radius 1
โœ E. Kolev ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 493 KB

1 + 2(1> + ... + 2R(G) vectors it follows that ICl(1 + 2(?) + ... + 2 R ( i ) ) 2 3". Thus, we have a simple lower bound for the number of codewords in a code of given

Code loops and even codes over F4
Code loops and even codes over F4
โœ Masaaki Kitazume ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 414 KB
Orthogonal Frames in the Leech Lattice a
Orthogonal Frames in the Leech Lattice and a Type II Code over Z22
โœ T.Aaron Gulliver; Masaaki Harada ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 80 KB

In this paper, we consider the problem of the existence of a basis of orthogonal vectors of norm 2k in the Leech lattice. Recently it has been shown that there is such a basis for every k ( 2) which is not of the form 11 r . In this paper, this problem is completely settled by finding such a basis f