Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T03:23:54.651Z Has data issue: false hasContentIssue false

ON LINEAR COMPLEMENTARY DUAL FOUR CIRCULANT CODES

Published online by Cambridge University Press:  29 April 2018

HONGWEI ZHU
Affiliation:
School of Mathematical Sciences, Anhui University, Hefei, Anhui 230601, China email zhwgood66@163.com
MINJIA SHI*
Affiliation:
Key Laboratory of Intelligent Computing and Signal Processing, Ministry of Education, Anhui University, No. 3 Feixi Road, Hefei, Anhui Province 230039, PR ChinaSchool of Mathematical Sciences of Anhui University, Anhui 230601, PR China email smjwcl.good@163.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We study linear complementary dual four circulant codes of length $4n$ over $\mathbb{F}_{q}$ when $q$ is an odd prime power. When $q^{\unicode[STIX]{x1D6FF}}+1$ is divisible by $n$ , we obtain an exact count of linear complementary dual four circulant codes of length $4n$ over $\mathbb{F}_{q}$ . For certain values of $n$ and $q$ and assuming Artin’s conjecture for primitive roots, we show that the relative distance of these codes satisfies a modified Gilbert–Varshamov bound.

MSC classification

Information

Type
Research Article
Copyright
© 2018 Australian Mathematical Publishing Association Inc.