Affiliation:
1. YILDIZ TEKNİK ÜNİVERSİTESİ
Abstract
In this study, we obtain one-Lee weight codes over a class of nonchain rings and study their structures.
We give an explicit construction for one-Lee weight codes. A method to derive more one-Lee weight codes from given a one-Lee weight code is also represented. By defining and making use of a distance-preserving Gray map, we get a family of optimal one-Hamming weight codes over finite fields.
Publisher
Journal of Engineering Technology and Applied Science
Reference19 articles.
1. [1] Agrell, E., Vardy, A., Zeger, K., "Upper bounds for constant-weight codes", IEEE Transactions on Information Theory 46 (2000) : 2373-2395.
2. [2] Bonisoli, A., "Every equidistant linear code is a sequence of dual Hamming codes", Ars Combinatoria 18 (1983) : 181-186.
3. [3] Brouwer, A.E., Shearer, J.B., Sloane, N.J.A., Smith, W.D., "A new table of constant-weight codes", IEEE Transactions on Information Theory 36 (1990) : 1334-1380.
4. [4] Carlet, C., "One-weight -linear codes", Coding, Cryptography and Related Areas (2000) : 57-72.
5. [5] Kuekes, P.J., Robinett, W., Roth, R.M., Seroussi, G., Snider, G.S., Williams, R.S., "Resistor-logic demultiplexers for nano electronics based on constant-weight codes", Nanotechnology 17 (2006) : 1052-1061.