Name
Abstract | ||
|---|---|---|
The main aim of this paper is to study $LCD$ codes. Linear code with complementary dual($LCD$) are those codes which have their intersection with their dual code as ${0}$. In this paper we will give rather alternative proof of Masseyu0027s theoremcite{8}, which is one of the most important characterization of $LCD$ codes. Let $LCD[n,k]_3$ denote the maximum of possible values of $d$ among $[n,k,d]$ ternary $LCD$ codes. In cite{4}, authors have given upper bound on $LCD[n,k]_2$ and extended this result for $LCD[n,k]_q$, for any $q$, where $q$ is some prime power. We will discuss cases when this bound is attained for $q=3$. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Information Theory | Discrete mathematics,Upper and lower bounds,Ternary operation,Liquid-crystal display,Linear code,Prime power,Mathematics,Dual code |
DocType | Volume | Issue |
Journal | abs/1802.03014 | 5 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nitin S. Darkunde | 1 | 0 | 1.01 |
| Arunkumar R. Patil | 2 | 20 | 2.97 |