✦ LIBER ✦

Optimal binary linear codes and Z4-linearity

✍ Scribed by Encheva, S.B.; Jensen, H.E.

Book ID: 114540417
Publisher: IEEE
Year: 1996
Tongue: English
Weight: 746 KB
Volume: 42
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.508844

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved binary codes and sequence famil

Improved binary codes and sequence families from Z4-linear codes

✍ Shanbhag, A.G.; Vijay Kumar, P.; Hellesath, T. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 556 KB

On the non Z4-linearity of certain good

On the non Z4-linearity of certain good binary codes

✍ Fields, J.; Gaborit, P. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 134 KB

On the additive (Z4-linear and non-Z4-li

On the additive (Z4-linear and non-Z4-linear) Hadamard codes: rank and kernel

✍ Phelps, K.T.; Rifa, J.; Villanueva, M. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 184 KB

Rigid linear binary codes

✍ Hanno Lefmann; Kevin T Phelps; Vojtěch Rödl 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 669 KB

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

Z4-linear Hadamard and extended perfect

Z4-linear Hadamard and extended perfect codes

✍ D.S. Krotov 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 376 KB

If N = 2 k 16 then there exist exactly b(k 1)=2c pairwise nonequivalent Z 4linear Hadamard (N 2N N = 2)-codes and b(k + 1 ) =2c pairwise nonequivalent Z 4linear extended perfect (N 2 N =2N 4)-codes. Recurrent construction of Z 4 -linear Hadamard codes is given.