One generator quasi-cyclic codes over F 2+uF 2

Irfan Siap; Taher Abualrub; Bahattin Yildiz

doi:10.1016/j.jfranklin.2011.10.020

One generator quasi-cyclic codes over F ₂+uF ₂

Irfan Siap, Taher Abualrub, Bahattin Yildiz

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

In this paper, we study quasi-cyclic codes over the ring R=F ₂u+F ₂=0,1,u,u1 where u ²=0. By exploring their structure, we determine the type of one generator quasi-cyclic codes over R and the size by giving a minimal spanning set. We also determine the rank and introduce a lower bound for the minimum distance of free quasi-cyclic codes over R. We include some examples of quasi-cyclic codes of various lengths over R. In particular, we obtain a family of 2-quasi-cyclic codes from cyclic codes over the ring F ₂u+F ₂v+F ₂+uvF ₂. Finally, using the Gray map we obtain a family of optimal binary linear codes as the images of quasi-cyclic codes over R.

Original language	English (US)
Pages (from-to)	284-292
Number of pages	9
Journal	Journal of the Franklin Institute
Volume	349
Issue number	1
DOIs	https://doi.org/10.1016/j.jfranklin.2011.10.020
State	Published - Feb 2012
Externally published	Yes

ASJC Scopus subject areas

Control and Systems Engineering
Signal Processing
Computer Networks and Communications
Applied Mathematics

Access to Document

10.1016/j.jfranklin.2011.10.020

Cite this

@article{6f3bc0536c6444c9b9e2f00c202bf2c6,

title = "One generator quasi-cyclic codes over F 2+uF 2 ",

abstract = "In this paper, we study quasi-cyclic codes over the ring R=F 2u+F 2=0,1,u,u1 where u 2=0. By exploring their structure, we determine the type of one generator quasi-cyclic codes over R and the size by giving a minimal spanning set. We also determine the rank and introduce a lower bound for the minimum distance of free quasi-cyclic codes over R. We include some examples of quasi-cyclic codes of various lengths over R. In particular, we obtain a family of 2-quasi-cyclic codes from cyclic codes over the ring F 2u+F 2v+F 2+uvF 2. Finally, using the Gray map we obtain a family of optimal binary linear codes as the images of quasi-cyclic codes over R.",

author = "Irfan Siap and Taher Abualrub and Bahattin Yildiz",

year = "2012",

month = feb,

doi = "10.1016/j.jfranklin.2011.10.020",

language = "English (US)",

volume = "349",

pages = "284--292",

journal = "Journal of the Franklin Institute",

issn = "0016-0032",

publisher = "Elsevier Limited",

number = "1",

}

TY - JOUR

T1 - One generator quasi-cyclic codes over F 2+uF 2

AU - Siap, Irfan

AU - Abualrub, Taher

AU - Yildiz, Bahattin

PY - 2012/2

Y1 - 2012/2

N2 - In this paper, we study quasi-cyclic codes over the ring R=F 2u+F 2=0,1,u,u1 where u 2=0. By exploring their structure, we determine the type of one generator quasi-cyclic codes over R and the size by giving a minimal spanning set. We also determine the rank and introduce a lower bound for the minimum distance of free quasi-cyclic codes over R. We include some examples of quasi-cyclic codes of various lengths over R. In particular, we obtain a family of 2-quasi-cyclic codes from cyclic codes over the ring F 2u+F 2v+F 2+uvF 2. Finally, using the Gray map we obtain a family of optimal binary linear codes as the images of quasi-cyclic codes over R.

AB - In this paper, we study quasi-cyclic codes over the ring R=F 2u+F 2=0,1,u,u1 where u 2=0. By exploring their structure, we determine the type of one generator quasi-cyclic codes over R and the size by giving a minimal spanning set. We also determine the rank and introduce a lower bound for the minimum distance of free quasi-cyclic codes over R. We include some examples of quasi-cyclic codes of various lengths over R. In particular, we obtain a family of 2-quasi-cyclic codes from cyclic codes over the ring F 2u+F 2v+F 2+uvF 2. Finally, using the Gray map we obtain a family of optimal binary linear codes as the images of quasi-cyclic codes over R.

UR - http://www.scopus.com/inward/record.url?scp=84655167974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84655167974&partnerID=8YFLogxK

U2 - 10.1016/j.jfranklin.2011.10.020

DO - 10.1016/j.jfranklin.2011.10.020

M3 - Article

AN - SCOPUS:84655167974

SN - 0016-0032

VL - 349

SP - 284

EP - 292

JO - Journal of the Franklin Institute

JF - Journal of the Franklin Institute

IS - 1

ER -

One generator quasi-cyclic codes over F ₂+uF ₂

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this