The Structure of One Weight Linear and Cyclic Codes Over Z2^r x\n (Z2+uZ2)^s

2017/04/24 by İsmail Aydoğdu, Aydogdu, Ismail
Computer Science · Engineering · #Advanced Wireless Network Optimization #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1704.07212

openalex publication_date 2017/04/24 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28

Abstract

Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have\nbeen introduced by Aydogdu et al. more recently. Although these family of codes\nare similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some\nadvantages compared to Z2Z4-additive codes. A code is called constant\nweight(one weight) if all the codewords have the same weight. It is well known\nthat constant weight or one weight codes have many important applications. In\nthis paper, we study the structure of one weight Z2Z2[u]-linear and cyclic\ncodes. We classify these type of one weight codes and also give some\nillustrative examples.\n

Related

• One-Lee weight and two-Lee weight ℤ₂ℤ₂[u]-additive codes
• The Weight Enumerator of Three Families of Cyclic Codes
• Weight Distributions of a Class of Cyclic Codes with Arbitrary Number of Zeros II
• Constant composition codes derived from linear codes
• Weight Distribution of a Class of Cyclic Codes with Arbitrary Number of Zeros