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

(1, 2) Optimal codes over GF(5)

โœ Scribed by Dass, Bal Kishan; Iembo, Rosanna; Jain, Sapna


Book ID
127120124
Publisher
Informa UK (Taylor & Francis)
Year
2006
Tongue
English
Weight
171 KB
Volume
9
Category
Article
ISSN
0972-0502

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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

Self-dual codes over GF(5)
โœ J.S Leon; V Pless; N.J.A Sloane ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 796 KB
New Optimal Self-Dual Codes over GF(7)
โœ T. Aaron Gulliver; Masaaki Harada ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 113 KB
Binomial coefficient codes over GF(2)
โœ Persi Diaconis; Ron Graham ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 366 KB

Diaconis, P. and R

Codes over GF(3) of length 5, 27 codewor
โœ 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