In this paper we present a new non-free $\mathbb Z$4-linear code of length $29$ and size $128$ whose minimum Lee distance is $28$.
Missing: ℤ4- | Show results with:ℤ4-
Jun 8, 2024 · In this paper we present a new non-free ℤ 4 -linear code of length 29 and size 128 whose minimum Lee distance is 28.
Abstract—A new series of Z4-linear codes of high mini- mum Lee distance is given. It is derived from the Z4-linear representation of the Kerdock codes.
We consider Z4 equipped with the Lee weight, which is given by wtL(0) ... Zwanzger, A Z4-linear code of high minimum Lee distance derived from a hyperoval,.
Mar 16, 2016 · Zwanzger, “A Z4-linear code of high minimum Lee distance derived from a hyperoval,” Advances in Mathematics of Communications, vol. 5, no. 2 ...
The classification of Type Ⅰ Z 4 -codes of length 16 and self-dual Z 4 -codes of lengths 17 up to 19 was given by M. Harada and A. Munemasa in 2009 [23]. More ...
Apr 12, 2010 · Let O be a hyperoval in PHG(2,Z4) and. µ : P → Rad(Z4), p 7→. (. 0 if p ∈ O. 2 otherwise. M. Kiermaier, J. Zwanzger (Bayreuth). A new Z4-linear ...
People also ask
How do you find the minimum distance of a linear code?
Inform. Theory, 40 (1994) 301-319. ... M. Kiermaier, J. Zwanzger, A Z 4 -linear code of high minimum Lee distance derived from a hyperoval, Adv. Math. Commun., 5 ...
A ℤ 4 -linear code of high minimum Lee distance derived from a hyperoval. Article. May 2011. Michael Kiermaier · Johannes Zwanzger. In this paper we present a ...
We show that the strength of the Gray map image of a linear Z4-code is one less than the minimum Lee weight of the ... the minimum Lee distance of C is equal to ...
Missing: high hyperoval.