lee weight
Recently Published Documents


TOTAL DOCUMENTS

30
(FIVE YEARS 3)

H-INDEX

6
(FIVE YEARS 0)

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 133043-133048
Author(s):  
Zongbing Lin ◽  
Kaimin Cheng
Keyword(s):  

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Jie Geng ◽  
Huazhang Wu ◽  
Patrick Solé

<p style='text-indent:20px;'>This paper mainly study <inline-formula><tex-math id="M2">\begin{document}$ \mathbb{Z}_{2}\mathbb{Z}_{4}[u] $\end{document}</tex-math></inline-formula>-additive codes. A Gray map from <inline-formula><tex-math id="M3">\begin{document}$ \mathbb{Z}_{2}^{\alpha}\times\mathbb{Z}_{4}^{\beta}[u] $\end{document}</tex-math></inline-formula> to <inline-formula><tex-math id="M4">\begin{document}$ \mathbb{Z}_{4}^{\alpha+2\beta} $\end{document}</tex-math></inline-formula> is defined, and we prove that is a weight preserving and distance preserving map. A MacWilliams-type identity between the Lee weight enumerator of a <inline-formula><tex-math id="M5">\begin{document}$ \mathbb{Z}_{2}\mathbb{Z}_{4}[u] $\end{document}</tex-math></inline-formula>-additive code and its dual is proved. Some properties of one-weight <inline-formula><tex-math id="M6">\begin{document}$ \mathbb{Z}_{2}\mathbb{Z}_{4}[u] $\end{document}</tex-math></inline-formula>-additive codes and two-weight projective <inline-formula><tex-math id="M7">\begin{document}$ \mathbb{Z}_{2}\mathbb{Z}_{4}[u] $\end{document}</tex-math></inline-formula>-additive codes are discussed. As main results, some construction methods for one-weight and two-weight <inline-formula><tex-math id="M8">\begin{document}$ \mathbb{Z}_{2}\mathbb{Z}_{4}[u] $\end{document}</tex-math></inline-formula>-additive codes are studied, meanwhile several examples are presented to illustrate the methods.</p>


2018 ◽  
Vol 98 (1) ◽  
pp. 167-174
Author(s):  
MINJIA SHI ◽  
YUE GUAN ◽  
CHENCHEN WANG ◽  
PATRICK SOLÉ

We construct two families of few-weight codes for the Lee weight over the ring $R_{k}$ based on two different defining sets. For the first defining set, taking the Gray map, we obtain an infinite family of binary two-weight codes which are in fact $2^{k}$-fold replicated MacDonald codes. For the second defining set, we obtain two infinite families of few-weight codes. These few-weight codes can be used to implement secret-sharing schemes.


2016 ◽  
Vol 30 (2) ◽  
pp. 484-493 ◽  
Author(s):  
Minjia Shi ◽  
Yong Luo ◽  
Patrick Solé
Keyword(s):  

Filomat ◽  
2016 ◽  
Vol 30 (2) ◽  
pp. 255-268
Author(s):  
Ödemiş Özger ◽  
Bahattin Yıldız ◽  
Steven Dougherty
Keyword(s):  

2014 ◽  
Vol 93 (3) ◽  
pp. 415-424 ◽  
Author(s):  
Minjia Shi ◽  
Lou Chen
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document